An Algorithm for the Class of Pure Implicational Formulas (original) (raw)
Related papers
The complexity of the falsifiability problem for pure implicational formulas
Discrete Applied Mathematics, 1999
The complexity of minimum partial truth assignments and implication in negation-free formulae
Annals of Mathematics and Artificial Intelligence, 1996
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics
… Symposium on Multiple …, 2008
On the complexity of computing minimal unsatisfiable LTL formulas
2005
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics, 2003
Algorithms for testing the satisfiability of propositional formulae
The Journal of Logic Programming, 1989
Polynomial-time inference of all valid implications for Horn and related formulae
Annals of Mathematics and Artificial Intelligence, 1990
On the computational complexity of satisfiability in propositional logics of programs
Theoretical Computer Science, 1982
Linear CNF formulas and satisfiability
Discrete Applied Mathematics, 2009
Investigations into the complexity of some propositional calculi
University of Oxford, PRG technical monographs, 1990
Why almost all satisfiable kkk-CNF formulas are easy
Discrete Mathematics & Theoretical Computer Science, 2007
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
Polynomially solvable satisfiability problems* 1
Information Processing Letters, 1988
Why almost all k-CNF formulas are easy
2007
On the tractability of minimal model computation for some CNF theories
Artificial Intelligence, 2014
Hard satisfiable formulas for DPLL-type algorithms
Computing Research Repository, 2003
Toward A Good Algorithm for Determining Unsatisfiability of Propositional Formulas
1997
Variable Minimal Unsatisfiability
2006
Complexity of computing with extended propositional logic programs
Annals of Mathematics and Artificial Intelligence, 1995
On Unit-Refutation Complete Formulae with Existentially Quantified Variables
Mikoláš Janota, Pierre Marquis
A deduction method complete for refutation and finite satisfiability
1998
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
Lecture Notes in Computer Science, 2005
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
Complexity and structural heuristics for propositional and quantified satisfiability
2007
2018
Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae
MBMV, 2009
On complexity reduction of Σ 1 formulas
Archive for Mathematical Logic, 2003
On-line algorithms for polynomially solvable satisfiability problems
The Journal of Logic Programming, 1991