Abstract
Goal-directed proof search in first-order logic uses meta- variables 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 proof-search 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baumgartner, P., Fuchs, A., Tinelli, C.: ME(LIA) – Model evolution with linear integer arithmetic constraints. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 258–273. Springer, Heidelberg (2008)
Baumgartner, P., Furbach, U., Petermann, U.: A unified approach to theory reasoning. Technical report, Inst. für Informatik, Univ. (1992)
Baumgartner, P., Tinelli, C.: Model evolution with equality modulo built-in theories. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 85–100. Springer, Heidelberg (2011)
Beckert, B.: Chapter 8: Rigid E-unification. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction – A Basis for Applications. Foundations. Calculi and Methods, vol. I, pp. 265–289. Kluwer Academic Publishers (1998)
Beckert, B.: Equality and other theories. In: Handbook of Tableau Methods, pp. 197–254. Kluwer Academic Publishers (1999)
Dross, C., Conchon, S., Kanig, J., Paskevich, A.: Reasoning with triggers. In: Fontaine, P., Goel, A. (eds.) 10th Int. Work. on Satisfiability Modulo Theories, SMT 2012. EPiC Series, vol. 20, pp. 22–31. EasyChair, June 2012
Ganzinger, H., RueB, H., Shankar, N.: Modularity and refinement in inference systems. Technical Report SRI-CSL-04-02, SRI (2004)
Giese, M.: Proof search without backtracking using instance streams, position paper. In: Baumgartner, P., Zhang, H. (eds.) 3rd Int. Work. on First-Order Theorem Proving (FTP), pp. 227–228. Univ. of Koblenz, St. Andrews (2000)
Giese, M., Hähnle, R.: Tableaux + constraints. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 37–42. Springer, Heidelberg (2003)
Graham-Lengrand, S.: Psyche: A proof-search engine based on sequent calculus with an LCF-Style architecture. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS, vol. 8123, pp. 149–156. Springer, Heidelberg (2013)
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). J. of the ACM Press 53(6), 937–977 (2006)
Psyche: the Proof-Search factorY for Collaborative HEuristics
Rouhling, D., Farooque, M., Graham-Lengrand, S., Notin, J.-M., Mahboubi, A.: Axiomatisation of constraint systems to specify a tableaux calculus modulo theories. Technical report, Laboratoire d’informatique de l’École Polytechnique - CNRS, Microsoft Research - INRIA Joint Centre, Parsifal & TypiCal - INRIA Saclay, France, December 2014
Rümmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274–289. Springer, Heidelberg (2008)
Saraswat, V.A., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: Wise, D.S. (ed.) 18th Annual ACM Symp. on Principles of Programming Languages (POPL 1991), pp. 333–352. ACM Press, January 1991
Stickel, M.E.: Automated deduction by theory resolution. J. of Automated Reasoning 1(4), 333–355 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rouhling, D., Farooque, M., Graham-Lengrand, S., Mahboubi, A., Notin, JM. (2015). Axiomatic Constraint Systems for Proof Search Modulo Theories. In: Lutz, C., Ranise, S. (eds) Frontiers of Combining Systems. FroCoS 2015. Lecture Notes in Computer Science(), vol 9322. Springer, Cham. https://doi.org/10.1007/978-3-319-24246-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-24246-0_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24245-3
Online ISBN: 978-3-319-24246-0
eBook Packages: Computer ScienceComputer Science (R0)