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.
References
E. Börger: Berechenbarkeit, Komplexität, Logik, Vieweg, 1985
M. Garey, D.S. Johnson: Computers and Intractability, Freeman and Company, 1979
H. Kleine Büning: Complexity Results for Classes of First-Order Formulas with Identity and Conjunctive Quantificational Form, Forschungsberichte der Universität Karlsruhe, 1985
H. Kleine Büning, Th. Lettmann: First-Order Formulas in Conjunctive Quantificational Form, Forschungsberichte der Universität Karlsruhe, 1985
A.R. Meyer, L.J. Stockmeyer: Word Problems Requiring Exponential Time, Proc. 5th Ann. ACM Symp. on Theory of Computing, 1973
D.A. Plaisted: Complete Problems in the First-Order Predicate Calculus, Journal of Computer and System Sciences, 1984
R. Reiter: Towards a Logical Reconstrustion of Relational Database Theory, in On Conceptual Modelling, Ed. Brodie, Mylopoulos, Schmidt Springer Verlag
T. J. Schäfer: The Complexity of Satisfiability Problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, 1978
Author information
Authors and Affiliations
Editor information
Rights 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