Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

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

Thumbnail Image

Date

2005

Authors

Nguyen, Linh Anh
Gore, Rajeev

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

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.

Description

Keywords

Keywords: Decision theory; Functions; Mathematical models; Mathematical operators; Semantics; Theorem proving; Automatic theorem proving; Fixpoint semantics; Herbrand model; Logical calculi; Logic programming Automatic theorem proving; Fixpoint semantics

Citation

URI

http://hdl.handle.net/1885/83144

Collections

ANU Research Publications

Source

Information Processing Letters

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1016/j.ipl.2005.02.003

Restricted until

2037-12-31

Downloads

File
Description
01_Nguyen_Completeness_of_2005.pdf (106.25 KB)

DSpace software copyright © 2002-2026 LYRASIS