Skip navigation
Skip navigation

Completeness of hyper-resolution via the semantics of disjunctive logic programs

Nguyen, Linh Anh; Gore, Rajeev

Description

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.

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
URI: http://hdl.handle.net/1885/83144
Source: Information Processing Letters
DOI: 10.1016/j.ipl.2005.02.003

Download

File Description SizeFormat Image
01_Nguyen_Completeness_of_2005.pdf106.25 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator