Bounds on the size of PC and URC formulas
From MaRDI portal
Publication:5145828
DOI10.1613/jair.1.12006zbMath1497.68453arXiv2001.00819OpenAlexW3115673399MaRDI QIDQ5145828
Publication date: 22 January 2021
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00819
Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
- Learning definite Horn formulas from closure queries
- On the power of clause-learning SAT solvers as resolution engines
- On finding solutions for extended Horn formulas
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- Recognition of \(q\)-Horn formulae in linear time
- Polynomial-time inference of all valid implications for Horn and related formulae
- On tackling the limits of resolution in SAT solving
- Investigations on autark assignments
- DRMaxSAT with MaxHS: first contact
- Complexity issues related to propagation completeness
- On CNF Encodings of Decision Diagrams
- Properties of SLUR Formulae
- Knowledge Compilation with Empowerment
- Generalising and Unifying SLUR and Unit-Refutation Completeness
- GAC Via Unit Propagation
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on the size of PC and URC formulas
