Extending the smodels system

Authors:
Ilkka Niemelä;Patrik Simons
Affiliations:
Helsinki Univ. of Technology, Helsinki, Finland;Helsinki Univ. of Technology, Helsinki, Finland
Venue:
Logic-based artificial intelligence
Year:
2000

Citing 14
Cited 0

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logic programs with classical negation

Logic programming
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Stable semantics for probabilistic deductive databases

Information and Computation
Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Principles of knowledge representation

Principles of knowledge representation
Answer set planning

Proceedings of the 1999 international conference on Logic programming
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Hybrid Knowledge Bases

IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates

IEEE Transactions on Knowledge and Data Engineering
Unifying SAT-based and Graph-based Planning

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Strong and Weak Constraints in Disjunctive Datalog

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.