Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
74 | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc |
Classical and Intuitionistic Logic Are Asymptotically Identical. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 177-193, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Implicational formulas, Tautologies, Analytic combinatorics, Intuitionistic logic |
67 | Dima Grigoriev |
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 648-652, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Nullstellensatz proofs, Tseitin's tautologies, lower bounds, expander |
62 | Søren Riis |
A complexity gap for tree resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(3), pp. 179-209, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Logical aspects of complexity, resolution proofs, propositional proof complexity |
56 | Olaf Beyersdorff, Sebastian Müller 0003 |
Does Advice Help to Prove Propositional Tautologies? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 65-72, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Scott Diehl, Dieter van Melkebeek, Ryan Williams 0001 |
An Improved Time-Space Lower Bound for Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 429-438, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Masahiro Kumabe, Toshio Suzuki, Takeshi Yamazaki |
Does truth-table of linear norm reduce the one-query tautologies to a random oracle? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(2), pp. 159-180, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 03D15 |
56 | Antoine Genitrini, Jakub Kozik, Marek Zaionc |
Intuitionistic vs. Classical Tautologies, Quantitative Comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers, pp. 100-109, 2007, Springer, 978-3-540-68084-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Arist Kojevnikov, Dmitry Itsykson |
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 323-334, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
56 | Michael Alekhnovich, Alexander A. Razborov |
Satisfiability, Branch-Width and Tseitin Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 593-603, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán |
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 314-323, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
47 | Moataz Saleh El-Zekey, Wafik Boulos Lotfallah, Nehad N. Morsi |
Computational complexities of axiomatic extensions of monoidal t-norm based logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 13(11), pp. 1089-1097, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
47 | Antoine Genitrini, Jakub Kozik |
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 280-294, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Zofia Kostrzycka, Marek Zaionc |
Asymptotic Densities in Logic and Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 88(3), pp. 385-403, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
asymptotic density of tautologies, probabilistic methods in logic and type theory, propositional logic |
42 | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 5, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
counting principles, graph tautologies, algebraic proof systems, binomial proofs, Nullstellensatz proofs, polynomial calculus proofs, propositional logic, Proof complexity |
41 | Toshio Suzuki |
Bounded truth table does not reduce the one-query tautologies to a random oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(6), pp. 751-762, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 03D15 |
41 | Vincent Danos, Jean-Louis Krivine |
Disjunctive Tautologies as Synchronisation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 292-301, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
41 | Matthias Baaz, Richard Zach |
Short Proofs of Tautologies Using the Schema of Equivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers, pp. 33-35, 1993, Springer, 3-540-58277-0. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Ran Raz, Iddo Tzameret |
The Strength of Multilinear Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 407-457, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17, 13P10 |
31 | Phuong Nguyen, Stephen A. Cook |
The Complexity of Proving the Discrete Jordan Curve Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pp. 245-256, 2007, IEEE Computer Society, 0-7695-2908-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Edward A. Hirsch, Sergey I. Nikolenko |
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 135-142, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Marcin Mostowski, Konrad Zdanowski |
Degrees of logics with Henkin quantifiers in poor vocabularies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(5), pp. 691-702, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Henkin quantifiers, Degrees of unsolvability |
31 | Phuong Nguyen, Stephen A. Cook |
VTC circ: A Second-Order Theory for TCcirc. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 378-387, 2004, IEEE Computer Society, 0-7695-2192-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Mauricio Osorio 0001, Fernando Zacarías Flores |
On Updates of Logic Programs: A Properties-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, Third International Symposium, FoIKS 2004, Wilhelminenberg Castle, Austria, February 17-20, 2004, Proceedings, pp. 231-241, 2004, Springer, 3-540-20965-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Nelson logic, Update programs, AGM postulates, Answer set programming, Properties, Strong negation |
31 | Vitaly Eltekov |
Checking the Four-Valued Boolean Algebra by the Use PLANNER. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part I, pp. 764-773, 2003, Springer, 3-540-40194-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
Exponential Lower Bound for Static Semi-algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 257-268, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
Complexity of Semi-algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 419-430, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Ivan Kramosil |
Boolean-like and frequentistic nonstandard semantics for first-order predicate calculus without functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 5(1), pp. 45-57, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
First-order predicate calculus, Standard semantics, Boolean-like semantics, Frequentistic semantics, Completeness theorems |
31 | Eli Ben-Sasson, Russell Impagliazzo |
Random CNF's are Hard for the Polynomial Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 415-421, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
polynomial calculus, satisfiability, proof complexity |
31 | Petr Hájek 0001 |
Basic fuzzy logic and BL-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 2(3), pp. 124-128, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Grazyna Mirkowska |
On the Propositional Algorithmic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, pp. 381-389, 1979, Springer, 0-387-09526-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
27 | Paola Bruscoli, Alessio Guglielmi |
On the proof complexity of deep inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(2), pp. 14:1-14:34, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Frege systems, Statman tautologies, Analyticity, deep inference, calculus of structures |
27 | Zofia Kostrzycka, Marek Zaionc |
Statistics of Intuitionistic versus Classical Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 76(3), pp. 307-328, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
prepositional logic, asymptotic density of tautologies, probabilistic methods in logic |
27 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Pseudorandom Generators in Propositional Proof Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 43-53, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
combinatorial pseudorandom generators, Nisan-Wigderson generator, Tseitin tautologies, polynomial calculus with resolution, polynomial calculus, computational complexity, theorem proving, process algebra, resolution, random processes, pseudorandom generators, propositional proof complexity |
25 | Bartosz Wcislo |
Compositional truth with propositional tautologies and quantifier-free correctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 63(1-2), pp. 239-257, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Hunter Monroe |
Average-Case Hardness of Proving Tautologies and Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
25 | Hunter Monroe |
Average-Case Hardness of Proving Tautologies and Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.07803, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Joshua Blinkhorn |
Simulating DQBF Preprocessing Techniques with Resolution Asymmetric Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Bin Zhao, Jing Lu |
Characteristics and applications of JI, B-implications via some classical logic tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 110, pp. 96-106, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Manuel Kauers, Martina Seidl, Doron Zeilberger |
On the maximal minimal cube lengths in distinct DNF tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.03431, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 17(4), pp. 26, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Vasil Sgurev |
Formulae, tautologies, and equipotences in the complex s-logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Conf. on Intelligent Systems ![In: 8th IEEE International Conference on Intelligent Systems, IS 2016, Sofia, Bulgaria, September 4-6, 2016, pp. 280-283, 2016, IEEE, 978-1-5090-1354-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Olena Yaskorska, Katarzyna Budzynska, Magdalena Kacprzak |
Proving Propositional Tautologies in a Natural Dialogue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 128(1-2), pp. 239-253, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Leszek Jaworski |
From the research on logics without tautologies (part 2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 21(2), pp. 234-251, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Leszek Jaworski |
From the research on logics without tautologies (part 3). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 21(2), pp. 252-262, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Leszek Jaworski |
From the research on logics without tautologies (part 1). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 21(2), pp. 216-233, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | László Aszalós, Tamás Herendi |
Density of Tautologies in Logics with One Variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Cybern. ![In: Acta Cybern. 20(3), pp. 385-398, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Huawen Liu |
On a New Class of Implications: (G, Min)-Implications and Several Classical Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. ![In: Int. J. Uncertain. Fuzziness Knowl. Based Syst. 20(1), pp. 1-20, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Jan Krajícek |
On the computational complexity of finding hard tautologies ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1212.1789, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
25 | Antoine Genitrini, Jakub Kozik |
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 163(7), pp. 875-887, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Michael Alekhnovich, Alexander A. Razborov |
Satisfiability, Branch-Width and Tseitin tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 20(4), pp. 649-678, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Scott Diehl, Dieter van Melkebeek, Ryan Williams 0001 |
An improved time-space lower bound for tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 22(3), pp. 325-338, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 93-103, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc |
Tautologies over implication with negative literals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 56(4), pp. 388-396, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
25 | Petr Hájek 0001 |
Some (non)tautologies of łukasiewicz and Product Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rev. Symb. Log. ![In: Rev. Symb. Log. 3(2), pp. 273-278, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Stefan Hetzl |
Describing proofs by short tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 159(1-2), pp. 129-145, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Balázs Szörényi |
Disjoint DNF Tautologies with Conflict Bound Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Satisf. Boolean Model. Comput. ![In: J. Satisf. Boolean Model. Comput. 4(1), pp. 1-14, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Jan Krajícek |
Substitutions into propositional tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 101(4), pp. 163-167, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | J. Balasubramaniam 0001 |
Yager's new class of implications Jf and some classical tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 177(3), pp. 930-946, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Benjamín René Callejas Bedregal |
A normal form which preserves tautologies and contradictions in a class of fuzzy logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 62(3-4), pp. 135-147, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Samuel R. Buss |
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 357(1-3), pp. 35-52, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Marek Zaionc |
Probability distribution for simple tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 355(2), pp. 243-260, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Jan Krajícek |
Structured pigeonhole principle, search problems and hard tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 70(2), pp. 619-630, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Marek Zaionc |
On the Asymptotic Density of Tautologies in Logic of Implication and Negation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reports Math. Log. ![In: Reports Math. Log. 39, pp. 67-87, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
25 | Benjamín René Callejas Bedregal, Regivan H. N. Santiago, Anne Magály de Paula Canuto |
A normal form which preserves 1-tautologies and 0-contradictions in a class of residuum-based propositional fuzzy logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUZZ-IEEE ![In: IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2004, Budapest, Hungary, July 25-29, 2004., pp. 647-652, 2004, IEEE, 0-7803-8353-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Jan Krajícek |
Tautologies from pseudo-random generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 7(2), pp. 197-212, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Matthias Baaz, Petr Hájek 0001, Franco Montagna, Helmut Veith |
Complexity of t-tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 113(1-3), pp. 3-11, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Stefan S. Dantchev, Søren Riis |
"Planar" Tautologies Hard for Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 220-229, 2001, IEEE Computer Society, 0-7695-1390-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Toshio Suzuki |
Complexity of the r-query Tautologies in the Presence of a Generic Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 41(2), pp. 142-151, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Petr Savický, Jirí Sgall |
DNF tautologies with a limited number of occurrences of every variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 238(1-2), pp. 495-498, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Jan Krajícek |
Tautologies from pseudo-random generators ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR00, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
25 | Søren Riis, Meera Sitharam |
Generating hard tautologies using predicate logic and the symmetric group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 8(6), pp. 787-795, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Wolfgang Bibel, Elmar Eder |
Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(2), pp. 320-344, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
connection-graph resolution, decomposition of unsatisfiable formulas, semantic trees, regular graphs, strong completeness |
25 | Jeremy Avigad |
Plausibly hard combinatorial tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Complexity and Feasible Arithmetics ![In: Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996, pp. 1-12, 1996, DIMACS/AMS, 978-0-8218-0577-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Michael Bertol, Klaus Reinhardt |
The Tautologies over a Finite Set are Context-Free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 57, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
25 | Uwe Egly |
Super-Polynomial Speed-Ups in Proof Length by New Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPIA ![In: Progress in Artificial Intelligence, 7th Portuguese Conference on Artificial Intelligence, EPIA '95, Funchal, Madeira Island, Portugal, October 3-6, 1995, Proceedings, pp. 29-40, 1995, Springer, 3-540-60428-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Gennady Davydov, Inna Davydova |
Tautologies and Positive Solvability of Linear Homogeneous Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 57(1), pp. 27-43, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Wieslaw Dziobiak |
A Finite Matrix Whose Set of Tautologies Is Not Finitely Axiomatizable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reports Math. Log. ![In: Reports Math. Log. 25, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
25 | Daniele Mundici |
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 27(3), pp. 265-273, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
25 | Balakrishnan Krishnamurthy, Robert N. Moll |
Examples of Hard Tautologies in the Propositional Calculus ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, May 11-13, 1981, Milwaukee, Wisconsin, USA, pp. 28-37, 1981, ACM. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
25 | Leo Simons |
More logics without tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 19(4), pp. 543-557, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
25 | Alan Rose |
A Note on the Existence of Tautologies in Certain Propositional Calculi Without Propositional Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 22(1), pp. 117-118, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
25 | Alan Rose |
A note on the existence of tautologies without constants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 21(1), pp. 141-144, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
25 | Leo Simons |
Logic without tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 15(3), pp. 411-431, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
25 | M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson |
A note on disjunctive form tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 5(2), pp. 17-20, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
25 | Gerald Standley |
Testing Singly Quantified Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 31(3), pp. 478-480, 1966. The full citation details ...](Pics/full.jpeg) |
1966 |
DBLP DOI BibTeX RDF |
|
25 | Jan Kalicki |
A Test for the Existence of Tautologies According to Many-Valued Truth-Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 15(3), pp. 182-184, 1950. The full citation details ...](Pics/full.jpeg) |
1950 |
DBLP DOI BibTeX RDF |
|
16 | Søren Riis |
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 272-283, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Algebraic proof complexity, predicate logic, Propositional proof complexity |
16 | Dragan G. Radojevic, Aleksandar Perovic, Zoran Ognjanovic, Miodrag Raskovic |
Interpolative Boolean Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIMSA ![In: Artificial Intelligence: Methodology, Systems, and Applications, 13th International Conference, AIMSA 2008, Varna, Bulgaria, September 4-6, 2008. Proceedings, pp. 209-219, 2008, Springer, 978-3-540-85775-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Zofia Kostrzycka |
The density of truth in monadic fragments of some intermediate logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 16(3), pp. 283-302, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Density of truth, Medvedev’s logic, Linear logic, Generating functions |
16 | Manuel Clavel, Francisco Durán 0001, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer 0001, Carolyn L. Talcott |
LTL Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
All About Maude ![In: All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, pp. 385-418, 2007, Springer, 978-3-540-71940-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Pedro Cabalar, David Pearce 0001, Agustín Valverde |
Minimal Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings, pp. 104-118, 2007, Springer, 978-3-540-74608-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minimisation of boolean and multivalued functions, logic programming, answer set programming |
16 | Zbigniew Bonikowski, Urszula Wybraniec-Skardowska |
Rough Sets and Vague Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSEISP ![In: Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28-30, 2007, Proceedings, pp. 122-132, 2007, Springer, 978-3-540-73450-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Alexis Maciel, Toniann Pitassi |
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pp. 189-200, 2006, IEEE Computer Society, 0-7695-2631-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Stefan S. Dantchev |
Relativisation Provides Natural Separations for Resolution-Based Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 147-158, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Arist Kojevnikov, Alexander S. Kulikov |
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 11-21, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Jan Krajícek |
Forcing with Random Variables and Proof Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 277-278, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | DoRon B. Motter, Jarrod A. Roy, Igor L. Markov |
Resolution cannot polynomially simulate compressed-BFS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 44(1-2), pp. 121-156, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Petr Hájek 0001 |
Arithmetical complexity of fuzzy predicate logics - a survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 9(12), pp. 935-941, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Jan Rauch |
Logic of Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 22(1), pp. 9-28, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
GUHA method, 4ft-Miner procedure, data mining, association rules, mathematical logic |