Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning

From MaRDI portal
Publication:682374

DOI10.1007/S10817-017-9408-6zbMATH Open1425.68379arXiv1602.04568OpenAlexW2952307256MaRDI QIDQ682374FDOQ682374


Authors: Bruno Woltzenlogel Paleo, John K. Slaney Edit this on Wikidata


Publication date: 2 February 2018

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Abstract: This paper defines the (first-order) conflict resolution calculus: an extension of the resolution calculus inspired by techniques used in modern SAT-solvers. The resolution inference is restricted to (first-order) unit-propagation and the calculus is extended with a mechanism for assuming decision literals and a new inference rule for clause learning, which is a first-order generalization of the propositional conflict-driven clause learning (CDCL) procedure. The calculus is sound (because it can be simulated by natural deduction) and refutationally complete (because it can simulate resolution), and these facts are proven in detail here.


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




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682374)