Extending the smodels system

The Smodels system is one of the state-of-the-art implementations of stable model computation for normal logic programs. In order to enable more realistic applications, the basic modeling language of normal programs has been extended with new constructs including cardinality and weight constraints and corresponding implementation techniques have been developed. This paper summarizes the extensions that have been included in the system, demonstrates their use, provides basic application methodology, illustrates the current level of performance of the system, and compares it to state-of-the-art satisfiability checkers.

[1]  Anil Nerode,et al.  Hybrid Knowledge Bases , 1996, IEEE Trans. Knowl. Data Eng..

[2]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[3]  V. S. Subrahmanian,et al.  Stable Semantics for Probabilistic Deductive Databases , 1994, Inf. Comput..

[4]  Thomas Eiter,et al.  Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..

[5]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[6]  David Scott Warren,et al.  The XSB Programming System , 1993, Workshop on Programming with Logic Databases , ILPS.

[7]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[8]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[9]  Luigi Palopoli,et al.  NP-SPEC: an executable specification language for solving all problems in NP , 1999, Comput. Lang..

[10]  Francesco Buccafurri,et al.  Strong and Weak Constraints in Disjunctive Datalog , 1997, LPNMR.

[11]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[12]  Patrik Simons,et al.  Extending the Stable Model Semantics with More Expressive Rules , 1999, LPNMR.

[13]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[14]  Ilkka Niemelä,et al.  Stable Model Semantics of Weight Constraint Rules , 1999, LPNMR.

[15]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[16]  Sergio Greco,et al.  Dynamic Programming in Datalog with Aggregates , 1999, IEEE Trans. Knowl. Data Eng..

[17]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[18]  Vladimir Lifschitz,et al.  Answer Set Planning (Abstract) , 1999, LPNMR.

[19]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[20]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

[21]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[22]  Chu Min Li,et al.  Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.