Skip to main content
SpringerLink
Log in

Decidability and Complexity of Finitely Closable Linear Equational Theories

  • Conference paper
  • First Online:
Book cover Automated Reasoning (IJCAR 2001)

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

Included in the following conference series:

Abstract

We define a subclass of the class of linear equational theories, called finitely closable linear theories. We consider unification problems with no repeated variables.We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic finitely closable linear theories.

This work was supported by NSF grant number CCR-9712388.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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 and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.

    Google Scholar 

  2. C. Kirchner. Computing unification algorithms. In Proceedings of the First Symposium on Logic in Computer Science, Boston, 200–216, 1990.

    Google Scholar 

  3. C. Kirchner and H. Kirchner. Rewriting, Solving, Proving. http://www.loria.fr/~ckirchne/ , 2000.

  4. C. Kirchner and F. Klay. Syntactic Theories and Unification. In LICS 5, 270–277, 1990.

    Google Scholar 

  5. F. Klay. Undecidable Properties in Syntactic Theories. In RTA 4,ed. R. V. Book, LNCS vol. 488, 136–149, 1991.

    Google Scholar 

  6. C. Lynch and B. Morawska. Goal-directed E-unification. To appear in 12th International Conference on Rewriting Techniques and Applications.

    Google Scholar 

  7. C. Lynch and B. Morawska. Approximating E-unification. Submitted.

    Google Scholar 

  8. C. Lynch and B. Morawska. http://www.clarkson.edu/~clynch/papers/linearfull.ps/ , 2001.

  9. R. Nieuwenhuis and A. Rubio. Paramodulation-based Theorem Proving. To appear in Handbook of Automated Reasoning, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Clarkson University, Box 5815, Potsdam, NY, 13699-5815, USA

    Christopher Lynch & Barbara Morawska

Authors
  1. Christopher Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara Morawska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lynch, C., Morawska, B. (2001). Decidability and Complexity of Finitely Closable Linear Equational Theories. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42254-9

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation