Abstract
The SAT-Problem fot boolean formulas in conjunctive normal form often arises in the area of artificial intelligence, its solution is known as mechanical theorem proving. Most mechanical theorem provers perform this by using a variant of the resolution principle. The time and space complexity of resolution strongly depends on the class of formulas. Horn formulas, where each clause may contain at most one positive literal, represent the most important class where resolution proofs with polynomial length exist.
A special sort of Horn formulas, where each clause contains exactly one positive literal, is called logic programs. In logic programs, clauses of length one are also known as facts, clauses of length greater than one are known as rules. We show that there are typically short resolution proofs under unit/Davis-Putnam resolution for some models of formulas, and we study the “density” of rules necessary in another model for deriving the empty clause with probability tending to one.
Preview
Unable to display preview. Download preview PDF.
References
Vašek Chvátal and Endre Szemerédi. Many hard examples for resolution. Journal of the ACM, 35(4):759–768, October 1988.
Andreas Goerdt. Davis-putnam resolution versus unrestricted resolution. In Egon Börger, Hans Kleine Büning, and Michael M. Richter, editors, Workshop on Computer Science Logic 89, pages 143–162, Berlin, Heidelberg, New York, Tokyo, 1990. Springer Verlag.
A. Goldberg, P. Purdom, and C. Brown. Average time analysis of simplified davis-putnam procedures. Inform. Proc. Letters, 15:72–75, 1982.
Armin Haken. The intractability of resolution. Theoretical Computer Science, 39:297–308, 1985.
T.C. Hu, C.Y. Tang, and R.C.T. Lee. An average case analysis of a resolution principle algorithm in mechanical theorem proving. Technical report, National Tsing Hua University, Hsinchu, 1989.
A. Itai and J. Makowsky. On the complexity of derivations in the propositional calculus. J. of Logic Programming, 4:105–117, 1987.
Hans Kleine Büning and Ulrich Löwen. SLD-resolution needs expo time. Technical report, Universität-Gesamthochschule Duisburg, 1987.
G. S. Tseitin. On the complexity of derivations in the propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, pages 115–125, New York, London, 1968. Consultants Bureau.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heusch, P., Speckenmeyer, E. (1992). Some aspects of the probabilistic behavior of variants of resolution. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023765
Download citation
DOI: https://doi.org/10.1007/BFb0023765
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive