Article ID Journal Published Year Pages File Type
10331971 Information Processing Letters 2005 7 Pages PDF
Abstract
We present a proof of completeness of hyper-resolution based on the fixpoint semantics of disjunctive logic programs. This shows that hyper-resolution can be studied from the point of view of logic programming.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Completeness of hyper-resolution via the semantics of disjunctive logic programs
Authors
, ,