Axiomatic constraint systems for proof search modulo theories

Damien Rouhling, Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi, Jean Marc Notin

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

Goal-directed proof search in first-order logic uses metavariables to delay the choice of witnesses; substitutions for such variables are produced when closing proof-tree branches, using first-order unification or a theory-specific background reasoner. This paper investigates a generalisation of such mechanisms whereby theory-specific constraints are produced instead of substitutions. In order to design modular proofsearch procedures over such mechanisms, we provide a sequent calculus with meta-variables, which manipulates such constraints abstractly. Proving soundness and completeness of the calculus leads to an axiomatisation that identifies the conditions under which abstract constraints can be generated and propagated in the same way unifiers usually are. We then extract from our abstract framework a component interface and a specification for concrete implementations of background reasoners.

Original languageEnglish
Title of host publicationFrontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Proceedings
EditorsCarsten Lutz, Silvio Ranise
PublisherSpringer Verlag
Pages220-236
Number of pages17
ISBN (Print)9783319242453
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event10th International Symposium on Frontiers of Combining Systems, FroCoS 2015 - Wroclaw, Poland
Duration: 21 Sep 201524 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9322
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Symposium on Frontiers of Combining Systems, FroCoS 2015
CountryPoland
CityWroclaw
Period21/09/1524/09/15

Fingerprint Dive into the research topics of 'Axiomatic constraint systems for proof search modulo theories'. Together they form a unique fingerprint.

  • Cite this

    Rouhling, D., Farooque, M., Graham-Lengrand, S., Mahboubi, A., & Notin, J. M. (2015). Axiomatic constraint systems for proof search modulo theories. In C. Lutz, & S. Ranise (Eds.), Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Proceedings (pp. 220-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9322). Springer Verlag. https://doi.org/10.1007/978-3-319-24246-0_14