Smodels: A System for Answer Set Programming

Abstract

The Smodels system implements the stable model semantics for normal logic programs. It handles a subclass of programs which contain no function symbols and are domain-restricted but supports extensions including built-in functions as well as cardinality and weight constraints. On top of this core engine more involved systems can be built. As an example, we have implemented total and partial stable model computation for disjunctive logic programs. An interesting application method is based on answer set programming, i.e., encoding an application problem as a set of rules so that its solutions are captured by the stable models of the rules. Smodels has been applied to a number of areas including planning, model checking, reachability analysis, product configuration, dynamic constraint satisfaction, and feature interaction.

Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, April 9-11, 2000, Breckenridge, Colorado 4 pages, uses aaai.sty

References in corpus (2)

• Unfolding Partiality and Disjunctions in Stable Model Semantics
• DES: a Challenge Problem for Nonmonotonic Reasoning Systems

Cited by in corpus (6)

• The DLV System for Knowledge Representation and Reasoning
• Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming
• Discovering Classes of Strongly Equivalent Logic Programs
• Justifying Answer Sets using Argumentation
• Improving the Deductive System DES with Persistence by Using SQL DBMS's
• Experimenting with recursive queries in database and logic programming systems