Download PDFOpen PDF in browser

On Conflict-Driven Reasoning

19 pagesPublished: April 16, 2018


Automated formal methods and automated reasoning are interconnected, as formal methods generate reasoning problems and incorporate reasoning techniques. For example, formal methods tools employ reasoning engines to find solutions of sets of constraints, or proofs of conjectures. From a reasoning perspective, the expressivity of the logical lan- guage is often directly proportional to the difficulty of the problem. In propositional logic, Conflict-Driven Clause Learning (CDCL) is one of the key features of state-of-the-art sat- isfiability solvers. The idea is to restrict inferences to those needed to explain conflicts, and use conflicts to prune a backtracking search. A current research direction in auto- mated reasoning is to generalize this notion of conflict-driven satisfiability to a paradigm of conflict-driven reasoning in first-order theories for satisfiability modulo theories and as- signments, and even in full first-order logic for generic automated theorem proving. While this is a promising and exciting lead, it also poses formidable challenges.

Keyphrases: Equality Reasoning, model building, Satisfiability modulo assignment, Satisfiability Modulo Theory, theorem proving, theory combination

In: Natarajan Shankar and Bruno Dutertre (editors). Automated Formal Methods, vol 5, pages 31--49

BibTeX entry
  author    = {Maria Paola Bonacina},
  title     = {On Conflict-Driven Reasoning},
  booktitle = {Automated Formal Methods},
  editor    = {Natarajan Shankar and Bruno Dutertre},
  series    = {Kalpa Publications in Computing},
  volume    = {5},
  pages     = {31--49},
  year      = {2018},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2515-1762},
  url       = {},
  doi       = {10.29007/spwm}}
Download PDFOpen PDF in browser