Relating minimal models and pre-requisite-free normal defaults

Jorge Lobo*, V. S. Subrahmanian

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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 languageEnglish (US)
Pages (from-to)129-133
Number of pages5
JournalInformation Processing Letters
Volume44
Issue number3
DOIs
StatePublished - Nov 30 1992
Externally publishedYes

Funding

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.

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Relating minimal models and pre-requisite-free normal defaults'. Together they form a unique fingerprint.

Cite this