Completeness of hyper-resolution via the semantics of disjunctive logic programs
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.
|Collections||ANU Research Publications|
|Source:||Information Processing Letters|
|01_Nguyen_Completeness_of_2005.pdf||106.25 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.