๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Answer set programming and plan generation

โœ Scribed by Vladimir Lifschitz

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
113 KB
Volume
138
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started with the invention of formal nonmonotonic reasoning in 1980.

๐Ÿ“œ SIMILAR VOLUMES

Open answer set programming for the sema
Open answer set programming for the semantic web
โœ Stijn Heymans; Davy Van Nieuwenborgh; Dirk Vermeir ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB

We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extende

Preferred answer sets for extended logic
Preferred answer sets for extended logic programs
โœ Gerhard Brewka; Thomas Eiter ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 442 KB

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi