A CNF Formula Hierarchy over the Hypercube
From MaRDI portal
Publication:5385533
DOI10.1007/978-3-540-76928-6_25zbMath1138.68549MaRDI QIDQ5385533
Publication date: 6 May 2008
Published in: AI 2007: Advances in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76928-6_25
05C65: Hypergraphs
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
03B05: Classical propositional logic
Related Items
Cites Work
- Unnamed Item
- Solving satisfiability in less than \(2^ n\) steps
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Recognition of \(q\)-Horn formulae in linear time
- Polynomial-time inference of all valid implications for Horn and related formulae
- A perspective on certain polynomial-time solvable classes of satisfiability
- The complexity of theorem-proving procedures