Existence of simple propositional formulas
From MaRDI portal
Publication:917333
DOI10.1016/0020-0190(90)90069-AzbMath0704.68099MaRDI QIDQ917333
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Classical propositional logic (03B05)
Related Items
Complexity versus stability for classes of propositional formulas, Unique Horn renaming and Unique 2-Satisfiability
Cites Work
- On renaming a set of clauses as a Horn set
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Recognizing disguised NR(1) instances of the satisfiability problem
- Renaming a Set of Clauses as a Horn Set
- The complexity of satisfiability problems
