ScholarLens Back to search
2006•ORCA Online Research @Cardiff (Cardiff University)Requires access

On the Existence of Answer Sets in Normal Extended Logic Programs

Martin W. A. Caminada, Chiaki Sakama

Open publisher page 7 citations

Abstract

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. 1

Open-access reader

About this research paper

What this paper is about

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. 1

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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. 1

Key concepts: Logic program, Default logic, Logic programming, Answer set programming, Computer science, Stable model semantics, Set (abstract data type), Class (philosophy)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Existence of Answer Sets in Normal Extended Logic Programs — Research Paper | ScholarLens