See this document in CiteSeerX!

Efficient Implementation of the Well-founded and Stable Model Semantics (1996)  (Make Corrections)  (60 citations)
Ilkka Niemelä, Patrik Simons
Joint International Conference and Symposium on Logic Programming



  Home/Search   Context   Related

 
View or download:
tcs.hut.fi/smodels/../...jicslp96.ps.gz
saturn.hut.fi/pub/ini/jicslp96.ps.gz
tcs.hut.fi/pub/papers/jicslp96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tcs.hut.fi/smodels/ (more)
From:  saturn.tcs.hut.fi/~psimons/
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: An implementation of the well-founded and stable model semantics for range-restricted function-free normal programs is presented. It includes two modules: an algorithm for implementing the two semantics for ground programs and an algorithm for computing a grounded version of a range-restricted function-free normal program. The latter algorithm does not produce the whole set of ground instances of the program but a subset which is sufficient in the sense that no stable models are lost. The... (Update)

Context of citations to this paper:   More

...called SLG [9] which was successfully used to answer queries in the presence of multiple stable models. A different type of engine, [11,17,36], are based on algorithms for computing stable models of programs without function symbols. tional specifications There are two...

Cited by:   More
Graphs and Colorings for Answer Set Programming: Abridged.. - Konczak, Linke, Schaub (2003)   (Correct)
Properties of Maximal Cliques of a Pair-Wise Compatibility.. - Mercer, Risch   (Correct)
A Deductive System for - Non-Monotonic Reasoning Thomas   (Correct)

Similar documents (at the sentence level):
49.5%:   Efficient Implementation of the Well-founded and Stable Model .. - Niemelä, Simons (1996)   (Correct)
5.0%:   Evaluating an Algorithm for Default Reasoning - Niemelä, Simons (1995)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Efficient Implementation of the Stable Model Semantics for Normal .. - Simons (1995)   (Correct)
0.2:   DisLoP: A Research Project on Disjunctive Logic Programming - Aravindan, Dix, Niemelä (1997)   (Correct)
0.1:   Smodels - an Implementation of the Stable Model and.. - Niemelä, Simons (1997)   (Correct)

Similar documents based on text:   More   All
0.6:   Contributions to the Stable Model Semantics of Logic Programs.. - Costantini   (Correct)
0.3:   Nonmonotonic Reasoning: Towards Efficient Calculi and.. - Dix, Furbach, Niemelä (1998)   (Correct)
0.3:   Unfolding Partiality and Disjunctions in Stable Model.. - Janhunen, Niemelä, Simons (2000)   (Correct)

Related documents from co-citation:   More   All
28:   The Stable Model Semantics for Logic Programming - Gelfond - 1988
22:   A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Propert.. - Dix - 1995
20:   The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross et al. - 1991

BibTeX entry:   (Update)

Ilkka Niemela and Patrik Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289--303, Bonn, Germany, September 1996. The MIT Press. http://citeseer.ist.psu.edu/niemela96efficient.html   More

@inproceedings{ niemela96efficient,
    author = "Ilkka Niemela and Patrik Simons",
    title = "Efficient Implementation of the Well-founded and Stable Model Semantics",
    booktitle = "Joint International Conference and Symposium on Logic Programming",
    pages = "289-303",
    year = "1996",
    url = "citeseer.ist.psu.edu/niemela96efficient.html" }
Citations (may not include all citations):
858   The stable model semantics for logic programming - Gelfond, Lifschitz - 1988  DBLP
312   The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
191   Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984  DBLP
149   Logic programming and knowledge representation - Baral, Gelfond - 1994  ACM   DBLP
115   The alternating fixpoints of logic programs with negation (context) - Van Gelder - 1989
60   Efficient implementation of the wellfounded and stable model.. - Niemela, Simons - 1996
43   Mixed integer programming methods for computing nonmonotonic.. - Bell, Nerode et al. - 1994  ACM   DBLP
38   Computation of stable models and its integration with logica.. - Chen, Warren - 1994  ACM   DBLP
27   Experimenting with nonmonotonic reasoning (context) - Cholewi'nski - 1995  DBLP
20   Towards efficient default reasoning - Niemela - 1995  DBLP
13   IEEE Transactions on Knowledge and Data Engineering (context) - Subrahmanian, Nau et al. - 1995
6   Available by ftp from seas (context) - Chen, Warren et al. - 1993
3   Available by ftp from labrea (context) - Knuth - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.tcs.hut.fi/smodels/):   More
Constraint Programming Based on Logic Programs with Stable Model.. - Niemelä   (Correct)
Logic Programs with Stable Model Semantics as a Constraint.. - Niemelä (1998)   (Correct)
Evaluating an Algorithm for Default Reasoning - Niemelä, Simons (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC