Relating minimal models and pre-requisite-free normal defaults

Jorge Lobo; V. S. Subrahmanian

doi:10.1016/0020-0190(92)90052-W

Relating minimal models and pre-requisite-free normal defaults

Jorge Lobo^*, V. S. Subrahmanian

^*Corresponding author for this work

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

4 Scopus citations

Abstract

Given any disjunctive logic program p, we show that the minimal Herbrand models of P are in a precise one-one correspondence with the default logic theory Δ_P obtained by adding toP, the default logic schema :¬A A.

Original language	English (US)
Pages (from-to)	129-133
Number of pages	5
Journal	Information Processing Letters
Volume	44
Issue number	3
DOIs	https://doi.org/10.1016/0020-0190(92)90052-W
State	Published - Nov 30 1992
Externally published	Yes

Keywords

default logic
formal semantics
Logic programming
negation
non-Horn logic programs
non-monotonic reasoning

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/0020-0190(92)90052-W

Cite this

@article{c2ef34f4d46b49f3a41e2ddde1c3a314,

title = "Relating minimal models and pre-requisite-free normal defaults",

abstract = "Given any disjunctive logic program p, we show that the minimal Herbrand models of P are in a precise one-one correspondence with the default logic theory ΔP obtained by adding toP, the default logic schema :¬A A.",

keywords = "default logic, formal semantics, Logic programming, negation, non-Horn logic programs, non-monotonic reasoning",

author = "Jorge Lobo and Subrahmanian, {V. S.}",

note = "Funding Information: This research was supported by the Army Research Office under Grant Number DAAL-03-92-G-0225, and by the National Science Foundation under Grant Number IRI-9109755. We are particularly grateful to both referees for making insightful comments that clarified the proofs, and for directing us to an observation of Etherington.",

year = "1992",

month = nov,

day = "30",

doi = "10.1016/0020-0190(92)90052-W",

language = "English (US)",

volume = "44",

pages = "129--133",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Relating minimal models and pre-requisite-free normal defaults

AU - Lobo, Jorge

AU - Subrahmanian, V. S.

N1 - Funding Information: This research was supported by the Army Research Office under Grant Number DAAL-03-92-G-0225, and by the National Science Foundation under Grant Number IRI-9109755. We are particularly grateful to both referees for making insightful comments that clarified the proofs, and for directing us to an observation of Etherington.

PY - 1992/11/30

Y1 - 1992/11/30

N2 - Given any disjunctive logic program p, we show that the minimal Herbrand models of P are in a precise one-one correspondence with the default logic theory ΔP obtained by adding toP, the default logic schema :¬A A.

AB - Given any disjunctive logic program p, we show that the minimal Herbrand models of P are in a precise one-one correspondence with the default logic theory ΔP obtained by adding toP, the default logic schema :¬A A.

KW - default logic

KW - formal semantics

KW - Logic programming

KW - negation

KW - non-Horn logic programs

KW - non-monotonic reasoning

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

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

U2 - 10.1016/0020-0190(92)90052-W

DO - 10.1016/0020-0190(92)90052-W

M3 - Article

AN - SCOPUS:0009422273

SN - 0020-0190

VL - 44

SP - 129

EP - 133

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Relating minimal models and pre-requisite-free normal defaults

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this