Skip to main content
SpringerLink
Log in

Model-Theoretic Methods in Combined Constraint Satisfiability

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We extend the Nelson–Oppen combination procedure to the case of theories that are compatible with respect to a common subtheory in the shared signature. The notion of compatibility relies on model completions and related concepts from classical model theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Armando, A., Ranise, S. and Rusinowitch, M. (2001) Uniform derivation of superposition based decision procedures, in L. Fribourg (ed.), Proc. of the Annual Conf. on Computer Science Logic (CSL-01), Paris, France, pp. 513–527.

  • Baader, F. and Nipkow, T. (1998) Term Rewriting and All That, Cambridge University Press.

  • Baader, F., Ghilardi, S. and Tinelli, C. (2004) A new combination procedure for the word problem that generalizes fusion decidability in modal logic, in Proc. of the Second Int. Joint Conf. on Automated Reasoning (IJCAR-04), LNAI, Springer, pp. 183–197. Extended version available at http://www.cs.uiowa.edu/~tinelli/html/papers.html as Technical Report No. 03-03, Department of Computer Science, The University of Iowa.

  • Baader, F. and Tinelli, C. (1997) A new approach for combining decision procedures for the word problem, and its connection to the Nelson–Oppen combination method, in W. McCune (ed.), Proc. of the 14th Int. Conf. on Automated Deduction (CADE-14), LNCS 1249, Springer, pp. 19–33.

  • Baader, F. and Tinelli, C. (2002a) Deciding the word problem in the union of equational theories, Inform. and Comput. 178(2), 346–390.

    Google Scholar 

  • Baader, F. and Tinelli, C. (2002b) Combining decision procedures for positive theories sharing constructors, in S. Tison (ed.), Proc. of the 13th Int. Conf. on Rewriting Techniques and Applications (RTA-02), LNCS 2378, Springer, pp. 352–366.

  • Bachmair, L. and Ganzinger, H. (1990) On restrictions of ordered paramodulation with simplification, in M. Stickel (ed.), Proc. of the 10th Int. Conf. on Automated Deduction (CADE-10), LNCS 449, Springer, pp. 427–441.

  • Bachmair, L. and Ganzinger, H. (1994) Rewrite-based equational theorem proving with selection and simplification, J. Logic Comput. 4(3), 217–247.

    Google Scholar 

  • Bachmair, L. and Ganzinger, H. (1998) Equational reasoning in saturation-based theorem proving, in L. Bibel and P. H. Schmitt (eds.), Automated Deduction – A Basis for Applications, I, Kluwer, pp. 353–397.

  • Bockmayr, A. and Weispfenning, V. (2001) Solving numerical constraints, in A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning, Vol. I, Elsevier/MIT, pp. 751–842.

  • Chang, C. C. and Keisler, H. J. (1990) Model Theory, 3rd edn, North-Holland.

  • Cooper, D. C. (1972) Theorem proving in arithmetic without multiplication, in B. Meltzer and D. Milchie (eds.), Machine Intelligence 7, pp. 91–99.

  • Ferrante, J. and Rackoff, C. W. (1979) The Computational Complexity of Logical Theories, Lecture Notes in Math. 718, Springer.

  • Fiorentini, C. and Ghilardi, S. (2003) Combining word problems through rewriting in categories with products, Theoret. Comput. Sci. 294, 103–149.

    Google Scholar 

  • Ghilardi, S. (2003) Reasoners’ cooperation and quantifier elimination, Technical Report No. 288-03, Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano. Available at http://homes.dsi.unimi.it/~ghilardi/

  • Ghilardi, S. and Santocanale, L. (2003) Algebraic and model theoretic techniques for fusion decidability in modal logic, in M. Vardi and A. Voronkov (eds.), Logic for Programming, Artificial Intelligence and Reasoning (LPAR-03), LNAI 2850, Springer, pp. 152–166.

  • Ghilardi, S. and Zawadowski, M. (2002) Sheaves, Games and Model Completions, Trends in Logic Series, Kluwer.

  • Janici \`{c} , P. and Bundy, A. (2002) A general setting for flexibly combining and augmenting decision procedures, J. Automated Reasoning 28, 257–305.

  • MacIntyre, A. (1977) Model completeness, in J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, pp. 139–180.

  • Mal’cev, A. I. (1962) Axiomatizable classes of locally free algebras of certain types, Sibirsk. Mat. Zh. 3, 729–743.

    Google Scholar 

  • Nelson, G. and Oppen, D. (1979) Simplification by cooperating decision procedures, ACM Trans. on Programming Languages and Systems 1(2), 245–257.

    Google Scholar 

  • Nieuwenhuis R. and Rubio, A. (2001) Paramodulation-based theorem proving, in A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning, Vol. I, Elsevier/MIT, pp. 371–533.

  • Oppen, D. (1978) A \(2^{2^{2^{pn}}}\) -upper bound on the complexity of Presburger arithmetic, J. Comput. Systems Sci. 16(3), 323–332.

    Google Scholar 

  • Oppen, D. (1980a) Complexity, convexity and combination of theories, Theoret. Comput. Sci. 12, 291–302.

    Google Scholar 

  • Oppen, D. (1980b) Reasoning about recursively defined data structures, J. ACM 27(3), 403–411.

    Google Scholar 

  • Tinelli, C. (2003) Cooperation of background reasoners in theory reasoning by residue sharing, J. Automated Reasoning 30(1), 1–31.

    Google Scholar 

  • Tinelli, C. and Harandi, M. (1996) A new correctness proof of the Nelson–Oppen combination procedure, in F. Baader and K. Schulz (eds.), 1st International Workshop on Frontiers of Combining Systems (FroCos-96), Applied Logic Series, Vol. 3, Kluwer Academic Publishers, pp. 103–120.

  • Tinelli, C. and Ringeissen, C. (2003) Unions of non-disjoint theories and combination of satisfiability procedures, Theoret. Comput. Sci. 290(1), 291–353.

    Google Scholar 

  • Tinelli, C. and Zarba, C. (2003) Combining non-stably infinite theories, in Proc. of the Int. Workshop on First Order Theorem Proving (FTP-03), Electronic Notes in Theoretical Computer Science 86(1).

  • Wheeler, W. H. (1976) Model-companions and definability in existentially complete structures, Israel J. Math. 25, 305–330.

    Google Scholar 

  • Weidenbach, C., Afshordel, B., Brahm, U., Cohrs, C., Engel, T., Keen, E., Theobalt, C. and Topic, D. (1999) System description: SPASS version 1.0.0, in H. Ganzinger (ed.), Proc. of the 16th Int. Conf. on Automated Deduction (CADE-16), LNAI 1632, Springer, pp. 314–318. See also the SPASS Home Page http://spass.mpi-sb.mpg.de/

  • Weispfenning, V. (1990) The complexity of linear problems in fields, J. Symbolic Comput. 5(1–2), 3–27.

    Google Scholar 

  • Wolter, F. (1998) Fusions of modal logics revisited, in M. Kracht, M. De Rijke, H. Wansing and M. Zakharyaschev (eds.), Advances in Modal Logic, CSLI, Stanford.

    Google Scholar 

  • Zarba, C. G. (2002) A tableau calculus for combining non-disjoint theories, in U. Egly and C. Fermüller (eds.), Automated Reasoning with Analytical Tableaux and Related Methods, LNCS 2381, Springer, pp. 315–329.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy

    Silvio Ghilardi

Authors
  1. Silvio Ghilardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Silvio Ghilardi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghilardi, S. Model-Theoretic Methods in Combined Constraint Satisfiability. J Autom Reasoning 33, 221–249 (2004). https://doi.org/10.1007/s10817-004-6241-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-004-6241-5

Keywords

Search

Navigation