Abstract
Certainly, the ability to draw inferences is a central operation in any Artificial Intelligence (AI) system. Consequently, automated deduction is one of the most traditional disciplines in AI. A major goal of research here is to develop general algorithms or semi-decision procedures for the solution of problems formulated in first-order predicate logic. One core technique, the resolution principle [Robinson, 1965b] nowadays seems to be even standard knowledge of any computer scientist. Resolution made popular the use of clause logic and of unification in theorem proving calculi. In particular, the use of unification is a major point, as calculi were predominated at that time by reducing first order logic to propositional logic by more or less blindly guessing ground instantiations of formulae.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baumgartner, P. (1998). 1. Introduction. In: Theory Reasoning in Connection Calculi. Lecture Notes in Computer Science(), vol 1527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692875_1
Download citation
DOI: https://doi.org/10.1007/10692875_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65509-1
Online ISBN: 978-3-540-49210-8
eBook Packages: Springer Book Archive