Abstract
Semantic trees have often been used as a theoretical tool for showing the unsatisfiability of clauses in first-order predicate logic. Their practicality has been overshadowed, however, by other strategies.
In this paper, we introduce unit clauses derived from resolutions when necessary to construct a semantic tree, leading to a strategy that combines the construction of semantic trees with resolution-refutation.
The parallel semantic tree theorem prover, called PrHERBY, combines semantic trees and resolution-refutation methods. The system presented is scalable by strategically selecting atoms with the help of dedicated resolutions. It performs significantly better and generally finds proof using fewer atoms than the semantic tree prover, HERBY.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Newborn, M.: Automated Theorem Proving: Theory and Practice. Springer, Heidelberg (2001)
Schumann, J.: SiCoTHEO-simple competitive parallel theorem provers based on SETHEO. Parallel Processing for Artificial Intelligence 3, 231–245 (1997)
Yu, Q., Almulla, M., Newborn, M.: Heuristics used by HERBY for semantic tree theorem proving. Annals of Math. and Artificial Intelligence 23, 247–266 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, C.K., Newborn, M. (2003). Competitive Semantic Tree Theorem Prover with Resolutions. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive