Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription

DOI10.1007/978-3-642-15675-5_18zbMath1306.68190arXiv1006.5896OpenAlexW1649706165MaRDI QIDQ4930765

Mikoláš Janota, Radu Grigore, João P. Marques-Silva

Publication date: 1 October 2010

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.5896

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (5)

Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem ⋮ Synchronous counting and computational algorithm design ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Abstraction-Based Algorithm for 2QBF ⋮ Solving QBF with counterexample guided refinement

This page was built for publication: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription