Approximating answer sets of unitary Lifschitz-Woo programs

Victor W. Marek, Inna Pivkina, Mirosław Truszczyński

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different methods of approximation and obtain results on the relationship between them. Since general logic programs with single literals as heads are equivalent to revision programs, we obtain results on approximations of justified revisions of databases by revision programs.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages66-78
Number of pages13
DOIs
StatePublished - 2005
Event8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005 - Diamante, Italy
Duration: Sep 5 2005Sep 8 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3662 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005
Country/TerritoryItaly
CityDiamante
Period9/5/059/8/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Approximating answer sets of unitary Lifschitz-Woo programs'. Together they form a unique fingerprint.

Cite this