Knowledge Compilation with Empowerment

DOI10.1007/978-3-642-27660-6_50zbMath1302.68248OpenAlexW1547258182MaRDI QIDQ2891394

Lucas Bordeaux, João P. Marques-Silva

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10344/2767

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

On preprocessing techniques and their impact on propositional model counting ⋮ Generalising and Unifying SLUR and Unit-Refutation Completeness ⋮ Learning a propagation complete formula ⋮ Tackling universal properties of minimal trap spaces of Boolean networks ⋮ Disjunctive closures for knowledge compilation ⋮ Bounds on the size of PC and URC formulas ⋮ A lower bound on CNF encodings of the at-most-one constraint ⋮ Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers ⋮ Propagation complete encodings of smooth DNNF theories ⋮ Generalising unit-refutation completeness and SLUR via nested input resolution

Cites Work

• Unnamed Item
• On the power of clause-learning SAT solvers as resolution engines
• Preprocessing of intractable problems
• GAC Via Unit Propagation
• Encodings of the Sequence Constraint
• Short proofs are narrow—resolution made simple
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution