Loop formulas for disjunctive logic programs

Joohyung Lee, Vladimir Lifschitz

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages' theorem are extended to disjunctive programs as well.

Original languageEnglish (US)
Pages (from-to)451-465
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2916
DOIs
StatePublished - 2003
Externally publishedYes

Fingerprint

Logic Programs
Answer Sets
Theorem
Completion
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science
  • Engineering(all)

Cite this

@article{2240937867744265913d777bb177ba4d,
title = "Loop formulas for disjunctive logic programs",
abstract = "We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages' theorem are extended to disjunctive programs as well.",
author = "Joohyung Lee and Vladimir Lifschitz",
year = "2003",
doi = "10.1007/978-3-540-24599-5_31",
language = "English (US)",
volume = "2916",
pages = "451--465",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Loop formulas for disjunctive logic programs

AU - Lee, Joohyung

AU - Lifschitz, Vladimir

PY - 2003

Y1 - 2003

N2 - We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages' theorem are extended to disjunctive programs as well.

AB - We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages' theorem are extended to disjunctive programs as well.

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

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

U2 - 10.1007/978-3-540-24599-5_31

DO - 10.1007/978-3-540-24599-5_31

M3 - Article

VL - 2916

SP - 451

EP - 465

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -