Abstract
We present a method of adding parallel computations to a reasoning process based on the Prolog Technology Theorem Proving approach. For this purpose, the input set of first-order logic formulas is translated into a logically equivalent program in the Oz language.
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
Bonacina, M.P.: A taxonomy of parallel strategies for deduction. Annals of Mathematics and Artificial Intelligence 29(1-4), 223–257 (2000)
Nilsson, U., Małuszyński, J.: Logic, Programming and Prolog, 2nd edn. John Wiley & Sons Ltd., Chichester (1995)
Van Roy, P., Haridi, S.: Concepts, Techniques, and Models of Computer Programming. The MIT Press, Cambridge (2004)
Schulte, C.: Programming Constraint Services, Ph.D thesis. University of Saarlandes (2000)
Stickel, M.: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog, Technical Note No. 464, SRI Int., Menlo Park (1989)
Sutcliffe, G., Suttner, C.B., Yemenis, T.: The TPTP Problem Library. In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, pp. 252–266. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meissner, A. (2008). Introducing Parallel Computations to a PTTP-Based First-Order Reasoning Process in the Oz Language. In: Darzentas, J., Vouros, G.A., Vosinakis, S., Arnellos, A. (eds) Artificial Intelligence: Theories, Models and Applications. SETN 2008. Lecture Notes in Computer Science(), vol 5138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87881-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-87881-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87880-3
Online ISBN: 978-3-540-87881-0
eBook Packages: Computer ScienceComputer Science (R0)