We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional schemata and on a version of the Closed World Assumption. We call it the extended logic of propositional schemata with CWA (PS+, in symbols). An important feature of the logic PS+ is that it supports explicit modeling of constraints on cardinalities of sets. In the paper, we characterize the class of problems that can be solved by finite PS+ theories. We implement a programming system based on the logic PS+ and design and implement a solver for processing theories in PS+. We present encouraging performance results for our approach — we show it to be competitive with smodels, a state-of-the-art answer-set programming system based on stable logic programming.
|Title of host publication||KI 2001|
|Subtitle of host publication||Advances in Artificial Intelligence - Joint German/Austrian Conference on AI, Proceedings|
|Editors||Franz Baader, Gerhard Brewka, Thomas Eiter|
|Number of pages||16|
|State||Published - 2001|
|Event||Joint 24th German Conference on Artificial Intelligence and 9th Austrian Conference on Artificial Intelligence, KI 2001 - Vienna, Austria|
Duration: Sep 19 2001 → Sep 21 2001
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||Joint 24th German Conference on Artificial Intelligence and 9th Austrian Conference on Artificial Intelligence, KI 2001|
|Period||9/19/01 → 9/21/01|
Bibliographical noteFunding Information:
This work was partially supported by the National Sleep Foundation grants CDA-9502645, IRI-9619233 and EPS-9874764.
© Springer-Verlag Berlin Heidelberg 2001.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)