On the Existence of Answer Sets in Normal Extended Logic Programs

Authors:
Martin Caminada;Chiaki Sakama
Affiliations:
Institute of Information and Computing Sciences, P.O. Box 80 089 3508 TB Utrecht The Netherlands/ email: martinc@cs.uu.nl;Department of Computer and Communication Sciences, Wakayama University, Wakayama 640-8510, Japan/ email: sakama@sys.wakayama-u.ac.jp
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 3
Cited 2

Answer set programming and plan generation

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
An axiomatic account of formal argumentation

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2

Prioritized conditional imperatives: problems and a new proposal

Autonomous Agents and Multi-Agent Systems
A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

Fundamenta Informaticae - Logic, Language, Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the serious problems in answer set programming is that relatively small pieces of information can cause a total absence of answer sets. To cope with this problem, this paper introduces a class of normal extended logic programs which are extended logic programs, whose defeasible rules are comparable to normal defaults in default logic. Under suitable program transformations, we show that every normal extended logic program always yields at least one answer set.