2007•Unpublished venueRequires access

Incremental answer set programming : a preliminary report

Mona Gharib, Torsten H. Schaub, Robert E. Mercer

Abstract

Abstract. An alternative approach to answer set programming is developed in order to remedy the problems of “relevance ” and “modularity ” of answer set semantics for logic programs. The fundamental idea is to re-introduce monotonicity. In particular, we introduce the alternative concept of ι-answer sets, which are characterized by their applied rules. Furthermore, we develop a sound and complete theorem proving method for our incremental approach to answer set programming, which allows for query-oriented computations. Our proof procedure can manage negation in logic programming. Moreover, it enables us to deal with variables using unification instead of grounding. 1

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 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

Key concepts: Answer set programming, Stable model semantics, Logic programming, Unification, Computer science, Programming language, Set (abstract data type), Semantics (computer science)