Skip to main content
SpringerLink
Log in

Combining Constraint Solving

  • Chapter
  • First Online:
Constraints in Computational Logics (CCL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2002))

Included in the following conference series:

Abstract

In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.

Both authors supported by the ESPRIT working group CCL-II, ref.WG # 22457

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader. On the complexity of Boolean unification. Information Processing Letters, 67(4):215–220, 1998.

    Article  MathSciNet  Google Scholar 

  2. L. Bachmair. Canonical Equational Proofs. Birkhäuser, Boston, Basel, Berlin, 1991.

    MATH  Google Scholar 

  3. W.L. Buntine and H.-J. Bürckert. On solving equations and disequations. Journal of the ACM, 41(4):591–629, 1994.

    Article  MATH  Google Scholar 

  4. A. Boudet, J.-P. Jouannaud, and M. Schmidt-Schauß. Unification in Boolean rings and Abelian groups. J. Symbolic Computation, 8:449–477, 1989.

    Article  MATH  Google Scholar 

  5. A. Bockmayr. Algebraic and logical aspects of unification. In K.U. Schulz, editor, Proceedings of the 1st International Workshop on Word Equations and Related Topics (IWWERT’ 90), volume 572 of Lecture Notes in Computer Science, pages 171–180, Tübingen, Germany, October 1992. Springer-Verlag.

    Google Scholar 

  6. A. Boudet. Combining unification algorithms. Journal of Symbolic Computation, 8:449–477, 1993.

    Article  MathSciNet  Google Scholar 

  7. F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 50–65, Saratoga Springs, NY, USA, 1992. Springer-Verlag.

    Google Scholar 

  8. F. Baader and K.U. Schulz. General A-and AX-unification via optimized combination procedures. In Proceedings of the Second International Workshop on Word Equations and Related Topics, volume 677 of Lecture Notes in Computer Science, pages 23–42, Rouen, France, 1993. Springer-Verlag.

    Google Scholar 

  9. F. Baader and J.H. Siekmann. Unification theory. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, pages 41–125. Oxford University Press, Oxford, UK, 1994.

    Google Scholar 

  10. F. Baader and K.U. Schulz. Combination of constraint solving techniques: An algebraic point of view. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Artificial Intelligence, pages 352–366, Kaiserslautern, Germany, 1995. Springer-Verlag.

    Google Scholar 

  11. F. Baader and K.U. Schulz. Combination techniques and decision problems for disunification. Theoretical Computer Science B, 142:229–255, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  12. F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation, 21:211–243, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. F. Baader and K.U. Schulz. Combination of constraint solvers for free and quasi-free structures. Theoretical Computer Science, 192:107–161, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  14. F. Baader and W. Snyder. Unification theory. In J.A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers, 2000. To appear.

    Google Scholar 

  15. F. Baader and C. Tinelli. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. In W. McCune, editor, Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia), volume 1249 of Lecture Notes in Artificial Intelligence, pages 19–33. Springer-Verlag, 1997.

    Google Scholar 

  16. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories sharing constructors. In P. Narendran and M. Rusinowitch, editors, Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), volume 1631 of Lecture Notes in Computer Science, pages 175–189. Springer-verlag, 1999.

    Google Scholar 

  17. F. Baader and C. Tinelli. Combining equational theories sharing noncollapse-free constructors. In H. Kirchner and Ch. Ringeissen, editors, Proceedings of the 3rd International Workshop on Frontiers of Combining Systems (FroCoS 2000), volume 1794 of Lecture Notes in Artificial Intelligence, pages 257–271, Nancy, France, 2000. pringer-Verlag.

    Google Scholar 

  18. H.-J. Bürckert. A Resolution Principle for a Logic with Restricted Quanti fiers, volume 568 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991.

    Google Scholar 

  19. J. Calmet and K. Homann. Classification of communication and cooperation mechanisms for logical and symbolic computation systems. In F. Baader and K.U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic, pages 221–234. Kluwer Academic Publishers, March 1996.

    Google Scholar 

  20. C.C. Chang and H.J. Keisler. Model Theory, volume 73 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 3rd edition, 1990. (1st ed., 1973; 2nd ed., 1977).

    Google Scholar 

  21. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s decision procedure for combinations of theories. In M.A. McRobbie and J.K. Slaney, editors, Proceedings of the 13th International Conference on Automated Deduction, (New Brunswick, NJ), volume 1104 of Lecture Notes in Artificial Intelligence, pages 463–477. Springer-Verlag, 1996.

    Google Scholar 

  22. A. Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 85–99, Tokyo, Japan, 1984. North Holland.

    Google Scholar 

  23. A. Colmerauer. An introduction to Prolog III. Communications of the ACM, 33(7):69–90, 1990.

    Article  Google Scholar 

  24. H. Comon. Disunification: A survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 322–359. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  25. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25(2):95–169, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  26. E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for non-disjoint equational theories. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 267–281, Nancy, France, 1994. Springer-Verlag.

    Google Scholar 

  27. F. Fages. Associative-commutative unification. In R. E. Shostak, editor, Proceedings of the 7th International Conference on Automated Deduction, volume 170 of Lecture Notes in Computer Science, pages 194–208, Napa, USA, 1984. Springer-Verlag.

    Google Scholar 

  28. E. Hemaspaandra. Complexity transfer for modal logic. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science (LICS’ 94), pages 164–175, Paris, France, 1994. IEEE Computer Society Press.

    Google Scholar 

  29. A. Herold. Combination of unification algorithms. In J.H. Siekmann, editor, Proceedings of the 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 450–469, Oxford, UK, 1986. Springer-Verlag.

    Google Scholar 

  30. A. Herold and J.H. Siekmann. Unification in Abelian semigroups. J. Automated Reasoning, 3:247–283, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  31. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Computing, 15(4):1155–1194, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  32. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of A. Robinson. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  33. J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, pages 111–119, Munich, Germany, 1987.

    Google Scholar 

  34. J. Jaffar, J.-L. Lassez, and M. Maher. A theory of complete logic programs with equality. J. Logic Programming, 1, 1984.

    Google Scholar 

  35. S. Kepser. Combination of Constraint Systems. Phd thesis, CIS-Universität München, München, Germany, 1998. Also available as CISReport 98-118.

    Google Scholar 

  36. S. Kepser. Negation in combining constraint systems. In Dov Gabbay and Maarten de Rijke, editors, Frontiers of Combining Systems 2, Papers presented at FroCoS’98, pages 117–192, Amsterdam, 1999. Research Studies Press/Wiley.

    Google Scholar 

  37. C. Kirchner. Méthodes et Outils de Conception Systématique d’Algorithmes d’Unification dans les Théories Equationelles. Thèse d’État, Université de Nancy I, France, 1985.

    Google Scholar 

  38. C. Kirchner and H. Kirchner. Constrained equational reasoning. In Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon, 1989. ACM Press.

    Google Scholar 

  39. H. Kirchner and Ch. Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113–155, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  40. S. Kepser and J. Richts. Optimisation techniques for combining constraint solvers. In Dov Gabbay and Maarten de Rijke, editors, Frontiers of Combining Systems 2, Papers presented at FroCoS’98, pages 193–210, Amsterdam, 1999. Research Studies Press/Wiley.

    Google Scholar 

  41. S. Kepser and J. Richts. Unimok-a system for combining equational unification algorithms. In P. Narendran and M. Rusinowitch, editors, Proceedings of the 10th International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, pages 248–251, Trento, Italy, 1999. Springer-Verlag.

    Google Scholar 

  42. S. Kepser and K. U. Schulz. Combination of constraint systems II: Rational amalgamation. In E.C. Freuder, editor, Principles and Practice of Constraint Programming-CP96, volume 1118 of LNCS, pages 282–296. Springer, 1996. Long version to appear in Theoretical Computer Science.

    Google Scholar 

  43. M. Kracht and F. Wolter. Properties of independently axiomatizable bimodal logics. The Journal of Symbolic Logic, 56(4):1469–1485, December 1991.

    Article  MATH  MathSciNet  Google Scholar 

  44. C. Landauer and K.L. Bellman. Integration systems and interaction spaces. In F. Baader and K.U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic, pages 249–266. Kluwer Academic Publishers, March 1996.

    Google Scholar 

  45. M.J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the Third Annual IEEE Symposium on Logic in Computer Science, pages 348–357, Edinburgh, Scotland, 1988. IEEE Computer Society.

    Google Scholar 

  46. G.S. Makanin. The problem of solvability of equations in a free semigroup. Math. Sbornik, 103:147–236, 1977. English translation in Math. USSR Sbornik 32, 1977.

    MathSciNet  Google Scholar 

  47. A.I. Mal’cev. The Metamathematics of Algebraic Systems, volume 66 of Studies in Logic and the Foundation of Mathematics. North Holland, Amsterdam, 1971.

    Google Scholar 

  48. A.I. Mal’cev. Algebraic Systems, volume 192 of Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen. Springer-Verlag, Berlin, 1973.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  50. G. Nelson and D.C. Oppen. Fast decision procedures based on congruence closure. J. ACM, 27(2):356–364, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  51. R. Nieuwenhuis and A. Rubio. AC-superposition with constraints: No AC-unifiers needed. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 545–559, Nancy, France, 1994. Springer-Verlag.

    Google Scholar 

  52. E. Ohlebusch. On the modularity of termination of term rewriting systems. Theoretical Computer Science, 136:333–360, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  53. E. Ohlebusch. Modular properties of composable term rewriting systems. Journal of Symbolic Computation, 20(1):1–41, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  54. D.C. Oppen. Complexity, convexity and combinations of theories. Theoretical Computer Science, 12:291–302, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  55. G. Plotkin. Building in equational theories. Machine Intelligence, 7:73–90, 1972.

    MATH  MathSciNet  Google Scholar 

  56. J. Richts. Effiziente Entscheidungsverfahren zur E-Unfikation. Dissertation, RWTH Aachen, Germany, 1999. Published by Shaker Verlag Aachen, Berichte aus der Informatik, 2000.

    Google Scholar 

  57. C. Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In A. Voronkov, editor, Proceedings of the Conference on Logic Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence, pages 261–272, St. Petersburg, Russia, 1992. Springer-Verlag.

    Google Scholar 

  58. Ch. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K.U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic, pages 121–140. Kluwer, March 1996.

    Google Scholar 

  59. W.C. Rounds. Set values for unification-based grammar formalisms and logic programming. Research Report CSLI-88-129, CSLI, Stanford, 1988.

    Google Scholar 

  60. K.U. Schulz. Makanin’s algorithm for word equations: Two improvements and a generalization. In K.U. Schulz, editor, Proceedings of the 1st International Workshop on Word Equations and Related Topics (IWWERT’ 90), volume 572 of Lecture Notes in Computer Science, pages 85–150, Berlin, Germany, October 1992. Springer-Verlag.

    Google Scholar 

  61. K.U. Schulz. Tractable and intractable instances of combination problems for unification and disunification. J. Logic and Computation, 10(1):105–135, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  62. K.U. Schulz. Why combined decision procedures are often intractable. In H. Kirchner and Ch. Ringeissen, editors, Proceedings of the 3rd International Workshop on Frontiers of Combining Systems (FroCoS 2000), volume 1794 of Lecture Notes in Artificial Intelligence, pages 217–244, Nancy, France, 2000. Springer-Verlag.

    Google Scholar 

  63. R.E. Shostak. Deciding combinations of theories. Journal of the ACM, 31:1–12, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  64. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation, 8(1,2):51–99, 1989.

    Article  MATH  Google Scholar 

  65. J.H. Siekmann and P. Szabó. The undecidability of the DA-unification problem. J. Symbolic Computation, 54(2):402–414, 1989.

    MATH  Google Scholar 

  66. M. E. Stickel. A complete unification algorithm for associativecommutative functions. In Proceedings of the 4th International Joint Conference on Artificial Intelligence, pages 71–82, Tblisi, USSR, 1975.

    Google Scholar 

  67. M.E. Stickel. A unification algorithm for associative commutative functions. J. of the ACM, 28(3):423–434, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  68. M.E. Stickel. Automated deduction by theory resolution. J. Automated Reasoning, 1(4):333–355, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  69. E. Tidén and S. Arnborg. Unification problems with one-sided distributivity. J. Symbolic Computation, 3(1–2):183–202, 1987.

    Article  MATH  Google Scholar 

  70. C. Tinelli and M. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K.U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic, pages 103–120. Kluwer, March 1996.

    Google Scholar 

  71. E. Tidén. Unification in combinations of collapse-free theories with disjoint sets of function symbols. In J.H. Siekmann, editor, Proceedings of the 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 431–449, Oxford, UK, 1986. Springer-Verlag.

    Google Scholar 

  72. C. Tinelli. Combining Satisfiability Procedures for Automated Deduction and Constraint-based Reasoning. Phd thesis, Department of Computer Science, University of Illinois, Urbana-Champaign, Illinois, 1999.

    Google Scholar 

  73. Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. J. ACM, 34:128–143, 1987.

    Article  MathSciNet  Google Scholar 

  74. C. Tinelli and Ch. Ringeissen. Non-disjoint unions of theories and combinations of satisfiability procedures: First results. Technical Report UIUCDCS-R-98-2044, Department of Computer Science, University of Illinois at Urbana-Champaign, April 1998. (also available as INRIA research report no. RR-3402).

    Google Scholar 

  75. K. Yelick. Unification in combinations of collapse-free regular theories. J. Symbolic Computation, 3(1,2):153–182, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science, RWTH Aachen, Germany

    Franz Baader

  2. CIS, University of Munich, Germany

    Klaus U. Schulz

Authors
  1. Franz Baader
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus U. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Laboratoire Spécification et Vérification, École Normale Supérieure de Cachan, 61, avenue du Président Wilson, 94234, Cachan Cedex, France

    Hubert Comon

  5. Laboratoire de Recherche en Informatique, Université Paris-Sud, Bâtiment 490, 91405, Orsay Cedex, France

    Claude Marché  & Ralf Treinen  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Baader, F., Schulz, K.U. (2001). Combining Constraint Solving. In: Goos, G., Hartmanis, J., van Leeuwen, J., Comon, H., Marché, C., Treinen, R. (eds) Constraints in Computational Logics. CCL 1999. Lecture Notes in Computer Science, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45406-3_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45406-3_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41950-1

  • Online ISBN: 978-3-540-45406-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation