𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Possibilistic uncertainty handling for answer set programming

✍ Scribed by Pascal Nicolas; Laurent Garcia; Igor Stéphan; Claire Lefèvre

Publisher
Springer Netherlands
Year
2006
Tongue
English
Weight
1013 KB
Volume
47
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

📜 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