Logic Programming

Part of the Progress in Mathematics book series (MBC, volume 8)


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.


Logic Program Logic Programming Atomic Formula Horn Clause Ground Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 2008

Personalised recommendations