Skip to main content
SpringerLink
Log in

Simultaneous Rigid Sorted Unification

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1919))

Included in the following conference series:

  • 367 Accesses

Abstract

In this paper we integrate a sorted unification calculus into free variable tableau methods for logics with term declarations. The calculus we define is used to close a tableau at once, unifying a set of equations derived from pairs of potentially complementary literals occurring in its branches. Apart from making the deduction system sound and complete, the calculus is terminating and so, it can be used as a decision procedure. In this sense we have separated the complexity of sorts from the undecidability of first order logic.

Research supported by the Spanish Project TIC98-00445-C03-02 “TREND”.

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. A. G. Cohn. A more expressive formulation of many sorted logic. Journal of Automated Reasoning 3, 113–200, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. G. Cohn. A many sorted logic with possibly empty sorts. CADE’11. LNCS 607, 633–647, 1992.

    Google Scholar 

  3. A. Degtyarev, A. Voronkov. What you always wanted to know about rigid Eunification. Journal of Automated Reasoning 20(1), 47–80, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Fitting. First-Order Logic and Automated Theorem Proving (2 edition). Springer, 1996.

    Google Scholar 

  5. A. M. Frisch. The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artificial Intelligence 49, 161–198, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Gavilanes, J. Leach, P. J. Martín, S. Nieva. Reasoning with preorders and dynamic sorts using free variable tableaux. AISMC-3. LNCS 1138, 365–379, 1996.

    Google Scholar 

  7. A. Gavilanes, J. Leach, P. J. Martín, S. Nieva. Semantic tableaux for a logic with preorders and dynamic declarations. TABLEAUX’97 (Position paper), CRIN 97-R-030, 7–12, 1997.

    Google Scholar 

  8. O. Herzog et al. LILOG-Linguistic and logic methods for the computational understanding of german. LILOG-Report 1b, IBM Germany, 1986.

    Google Scholar 

  9. P. J. Martín, A. Gavilanes. Simultaneous sorted unification for free variable tableaux: an elegant calculus. TR-SIP 86/98. 1998.

    Google Scholar 

  10. P. J. Martín, A. Gavilanes, J. Leach. Free variable tableaux for a logic with term declarations. TABLEAUX’98. LNAI 1397, 202–216. 1998.

    Google Scholar 

  11. P. J. Martín, A. Gavilanes, J. Leach. Tableau methods for a logic with term declarations. Journal of Symbolic Computation 29, 343–372, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Nieuwenhuis, A. Rubio. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation 19, 321–351, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Schmidt-Schauss. Computational Aspects of an Order Sorted Logic with Term Declarations. LNAI 395, Springer, 1989.

    Google Scholar 

  14. C. Walther. A Many-sorted Calculus based on Resolution and Paramodulation. Research Notes in Artificial Intelligence. Pitman, 1987.

    Google Scholar 

  15. C. Weidenbach. A sorted logic using dynamic sorts. MPI-I-91-218, 1991.

    Google Scholar 

  16. C. Weidenbach. First-order tableaux with sorts. Journal of the Interest Group in Pure and Applied Logics 3(6), 887–907, 1995.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Spain

    Pedro J. Martín & Antonio Gavilanes

Authors
  1. Pedro J. Martín
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonio Gavilanes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, E.T.S.I. Informática, University of Málaga, 29071, Málaga, Spain

    Manuel Ojeda-Aciego  & Inma P. de Guzmán  & 

  2. Intelligent Systems Department, Computer Science Institute, University of Leipzig, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Center for Artificial Intelligence, Department of Computer Science, University of Lisbon, 2825-114, Caparica, Portugal

    Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martín, P.J., Gavilanes, A. (2000). Simultaneous Rigid Sorted Unification. In: Ojeda-Aciego, M., de Guzmán, I.P., Brewka, G., Moniz Pereira, L. (eds) Logics in Artificial Intelligence. JELIA 2000. Lecture Notes in Computer Science(), vol 1919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40006-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-40006-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41131-4

  • Online ISBN: 978-3-540-40006-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation