On Unit-Refutation Complete Formulae with Existentially Quantified Variables (original) (raw)
Related papers
2005
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
Investigations into the complexity of some propositional calculi
University of Oxford, PRG technical monographs, 1990
An Algorithm for the Class of Pure Implicational Formulas
Discrete Applied Mathematics, 1999
On propositional quantifiers in provability logic
1993
Proof-Theoretic Reconstruction of Generalized Quantifiers
A deduction method complete for refutation and finite satisfiability
1998
Disjunctive closures for knowledge compilation
Artificial Intelligence, 2014
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1987
Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results
2015
Propositional fragments for knowledge compilation and quantified boolean formulae
Florian Letombe, Pierre Marquis
2005
Notes on Incompleteness Results and Provability Logic
A Partial Predicate Calculus in a Two-Valued Logic
Mathematical Logic Quarterly, 1983
Proof Complexities of Some Propositional Formulae Classes in Different Refutation Systems 1
Ashot Abajyan, Anahit Chubaryan
2010
A note on the ?-incompleteness formalization
Studia Logica - An International Journal for Symbolic Logic - SLOGICA, 1994
The complexity of the falsifiability problem for pure implicational formulas
Discrete Applied Mathematics, 1999
Quantified Propositional Gödel Logics
Lecture Notes in Artificial Intelligence, 2000
Parameterized Provability in Equational Logic
2017
Rewriting and reasoning with set-relations II: The non-ground case completeness
Lecture Notes in Computer Science, 1996
Decidability of Some Logics with Free Quantifier Variables
Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 1981
A Tableau Calculus for Quantifier-Free Set Theoretic Formulae
Lecture Notes in Computer Science, 1998
Model-completeness in a first order language with a generalized quantifier
Pacific Journal of Mathematics, 1975
Undecidability results on two-variable logics
Archive for Mathematical Logic, 1999
Exact knowledge compilation in predicate calculus: The partial achievement case
Lecture Notes in Computer Science, 1997
On countermodels in basic logic
2002
Propositional Logics Complexity and the Sub-Formula Property
Electronic Proceedings in Theoretical Computer Science, 2015
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
DOAJ (DOAJ: Directory of Open Access Journals), 2020
On a class of inference formulas
Journal of Computer Science and Cybernetics, 2012
2007
On the Expressive Power of Existential Quantification in Polynomial-Time Computability
2000
A guide to quantified propositional Gödel logic
2001
0–1 Laws and decision problems for fragments of second-order logic
Information and Computation, 1990
Notre Dame Journal of Formal Logic, 1980