Abstract
In this section we show that the execution of a program can be understood as the automated deduction of the empty clause from a given unsatisfiable clause set (possibly using the resolution refinements from Section 2.6). A further concept is needed: how to generate an answer, a result of the computation, from the resolution proof. A resolution proof as such shows only that the empty clause is derivable; an answer, in a sense, explains how it is obtained. The following ideas of extracting an answer from a resolution proof have their roots in the works of Green and Kowalski.
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
© 2008 Birkhäuser Boston
About this chapter
Cite this chapter
(2008). Logic Programming. In: Logic for Computer Scientists. Progress in Mathematics, vol 8. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4763-6_4
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4763-6_4
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4762-9
Online ISBN: 978-0-8176-4763-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)