@article{Bonacina2018ProofsIC,
title={Proofs in conflict-driven theory combination},
author={M. Bonacina and S. Lengrand and N. Shankar},
journal={Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs},
year={2018}
}

Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs

Search-based satisfiability procedures try to construct a model of the input formula by simultaneously proposing candidate models and deriving new formulae implied by the input. When the formulae are satisfiable, these procedures generate a model as a witness. Dually, it is desirable to have a proof when the formulae are unsatisfiable. Conflict-driven procedures perform nontrivial inferences only when resolving conflicts between the formulae and assignments representing the candidate model… Expand