Propositional satisfiability in answer-set programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations


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.

Original languageEnglish
Title of host publicationKI 2001
Subtitle of host publicationAdvances in Artificial Intelligence - Joint German/Austrian Conference on AI, Proceedings
EditorsFranz Baader, Gerhard Brewka, Thomas Eiter
Number of pages16
StatePublished - 2001
EventJoint 24th German Conference on Artificial Intelligence and 9th Austrian Conference on Artificial Intelligence, KI 2001 - Vienna, Austria
Duration: Sep 19 2001Sep 21 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceJoint 24th German Conference on Artificial Intelligence and 9th Austrian Conference on Artificial Intelligence, KI 2001

Bibliographical note

Funding Information:
This work was partially supported by the National Sleep Foundation grants CDA-9502645, IRI-9619233 and EPS-9874764.

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Propositional satisfiability in answer-set programming'. Together they form a unique fingerprint.

Cite this