Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1986: 8th International Conference on Automated Deduction pp 553–563Cite as

Classes of first order formulas under various satisfiability definitions

  • Theoretical Issues
  • Conference paper
  • First Online:

  • 162 Accesses

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

Abstract

In this paper we consider some special satisfiability problems of first order logic. We study effects of a unique name assumption and a domain closure assumption on complexity of satisfiability tests for certain classes of formulas interesting in logic programming or relational database theory. It is shown that the last assumption simplifies the satisfiability problem for first order logic. However for classes of formulas with lower complexity of the unrestricted satisfiability problem no general reduction of complexity can be determined.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Börger: Berechenbarkeit, Komplexität, Logik, Vieweg, 1985

    Google Scholar 

  2. M. Garey, D.S. Johnson: Computers and Intractability, Freeman and Company, 1979

    Google Scholar 

  3. H. Kleine Büning: Complexity Results for Classes of First-Order Formulas with Identity and Conjunctive Quantificational Form, Forschungsberichte der Universität Karlsruhe, 1985

    Google Scholar 

  4. H. Kleine Büning, Th. Lettmann: First-Order Formulas in Conjunctive Quantificational Form, Forschungsberichte der Universität Karlsruhe, 1985

    Google Scholar 

  5. A.R. Meyer, L.J. Stockmeyer: Word Problems Requiring Exponential Time, Proc. 5th Ann. ACM Symp. on Theory of Computing, 1973

    Google Scholar 

  6. D.A. Plaisted: Complete Problems in the First-Order Predicate Calculus, Journal of Computer and System Sciences, 1984

    Google Scholar 

  7. R. Reiter: Towards a Logical Reconstrustion of Relational Database Theory, in On Conceptual Modelling, Ed. Brodie, Mylopoulos, Schmidt Springer Verlag

    Google Scholar 

  8. T. J. Schäfer: The Complexity of Satisfiability Problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe (TH), 7500, Karlsruhe

    H. Kleine Büning & Th. Lettmann

Authors
  1. H. Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Th. Lettmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kleine Büning, H., Lettmann, T. (1986). Classes of first order formulas under various satisfiability definitions. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation