Computer Science – Artificial Intelligence
Scientific paper
2000-03-08
Computer Science
Artificial Intelligence
Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, April 9-11, 2000, Breckenridge, Colorado 4 pages, us
Scientific paper
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.
Niemela Ilkka
Simons Patrik
Syrjanen Tommi
No associations
LandOfFree
Smodels: A System for Answer Set Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Smodels: A System for Answer Set Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smodels: A System for Answer Set Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-653636