Abstract
In Sections 2.4 and 2.5 we have shown that resolution can p-simulate (and even simulate step by step) the connection calculus, but that the connection calculus cannot p-simulate resolution. We have noted at the end of Section 2.5 that there are two main features which resolution has but the connection calculus does not have, and this is the main reason why the connection calculus cannot p-simulate resolution. One of these features is the use of lemmata. The other is the ability to forget variables.
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.
Rights and permissions
Copyright information
© 1992 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Brauschweig/Wiesbaden
About this chapter
Cite this chapter
Eder, E. (1992). Connection Structures. In: Relative Complexities of First Order Calculi. Artificial Intelligence / Künstliche Intelligenz. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-84222-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-322-84222-0_5
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-528-05122-8
Online ISBN: 978-3-322-84222-0
eBook Packages: Springer Book Archive