Corpus ID: 994597

Smodels: A System for Answer Set Programming

@article{Niemel2000SmodelsAS,
  title={Smodels: A System for Answer Set Programming},
  author={Ilkka Niemel{\"a} and Patrik Simons and Tommi Syrj{\"a}nen},
  journal={ArXiv},
  year={2000},
  volume={cs.AI/0003033}
}
  • Ilkka Niemelä, Patrik Simons, Tommi Syrjänen
  • Published 2000
  • Computer Science
  • ArXiv
  • 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… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 97 CITATIONS, ESTIMATED 97% COVERAGE

    Enhancing disjunctive logic programming systems by SAT checkers

    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS

    A New Method for Computing Stable Models in Logic Programming

    VIEW 1 EXCERPT
    CITES BACKGROUND

    ACSPChecker: an ASP based CSP model checking tool

    VIEW 1 EXCERPT
    CITES BACKGROUND

    A New Approach to Conceive ASP Solvers

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    FILTER CITATIONS BY YEAR

    2001
    2020

    CITATION STATISTICS

    • 10 Highly Influenced Citations

    References

    Publications referenced by this paper.