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

Linh Anh Nguyen; Rajeev Goré

doi:10.1016/j.ipl.2005.02.003

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

Linh Anh Nguyen^*, Rajeev Goré

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	363-369
Number of pages	7
Journal	Information Processing Letters
Volume	95
Issue number	2
DOIs	https://doi.org/10.1016/j.ipl.2005.02.003
Publication status	Published - 31 Jul 2005

Access to Document

10.1016/j.ipl.2005.02.003

Cite this

@article{8255b0cbaa6746418de900c94a22b7b4,

title = "Completeness of hyper-resolution via the semantics of disjunctive logic programs",

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 = "Automatic theorem proving, Fixpoint semantics",

author = "Nguyen, {Linh Anh} and Rajeev Gor{\'e}",

year = "2005",

month = jul,

day = "31",

doi = "10.1016/j.ipl.2005.02.003",

language = "English",

volume = "95",

pages = "363--369",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Nguyen, Linh Anh

AU - Goré, Rajeev

PY - 2005/7/31

Y1 - 2005/7/31

N2 - 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.

AB - 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.

KW - Automatic theorem proving

KW - Fixpoint semantics

UR - http://www.scopus.com/inward/record.url?scp=20444479870&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2005.02.003

DO - 10.1016/j.ipl.2005.02.003

M3 - Article

SN - 0020-0190

VL - 95

SP - 363

EP - 369

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this