The complexity of the falsifiability problem for pure implicational formulas (original) (raw)
Related papers
An Algorithm for the Class of Pure Implicational Formulas
Discrete Applied Mathematics, 1999
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics, 2003
On the computational complexity of satisfiability in propositional logics of programs
Theoretical Computer Science, 1982
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
2005
The complexity of minimum partial truth assignments and implication in negation-free formulae
Annals of Mathematics and Artificial Intelligence, 1996
The Complexity of the Boolean Formula Value Problem
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics, 2012
The Complexity of Propositional Proofs
The Bulletin of Symbolic Logic, 1995
Complexity of computing with extended propositional logic programs
Annals of Mathematics and Artificial Intelligence, 1995
On the complexity of computing minimal unsatisfiable LTL formulas
Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas
2010
On meta complexity of propositional formulas and propositional proofs
Archive for Mathematical Logic, 2008
Algorithms for testing the satisfiability of propositional formulae
The Journal of Logic Programming, 1989
Investigations into the complexity of some propositional calculi
University of Oxford, PRG technical monographs, 1990
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics
… Symposium on Multiple …, 2008
Complexity of proofs in classical propositional logic
Logic from computer science, 1992
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
Lecture Notes in Computer Science, 2005
On the complexity of Entailment in Propositional Multivalued Logics
Annals of Mathematics and Artificial Intelligence, 1996
On complexity reduction of Σ 1 formulas
Archive for Mathematical Logic, 2003
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
2012
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics, 2010
Polynomial-time inference of all valid implications for Horn and related formulae
Annals of Mathematics and Artificial Intelligence, 1990
Proof Complexities of Some Propositional Formulae Classes in Different Refutation Systems 1
Ashot Abajyan, Anahit Chubaryan
2010
Toward A Good Algorithm for Determining Unsatisfiability of Propositional Formulas
1997
The quantifier complexity of polynomial-size iterated definitions in first-order logic
Mathematical Logic Quarterly, 2010
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2018
Computing Minimal Sets on Propositional Formulae I: Problems & Reductions
Polynomial Classes of Boolean Formulas for Computing the Degree of Belief
Lecture Notes in Computer Science, 2004