Patrik Simons  Home/Search
Context Related
| tcs.hut.fi/pub/reports/A35.ps.Z tcs.hut.fi/smodels/../report...A35.ps.Z tcs.hut.fi/Publications/repo...A35.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: saturn.tcs.hut.fi/~psimons/ (more) From: tcs.hut.fi/smodels/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : The aim of this work is to develop an efficient implementation method of the stable model semantics of logic programs with negation using as a basis a lately proposed decision procedure for Reiter's default logic. The problem of finding a stable model of a logic program is NP-complete. An algorithm for computing the stable model semantics of propositional logic programs is presented. The time complexity of the algorithm is examined and found to be exponential in the size of the input in the... (Update)
Context of citations to this paper: More
...to normal logic programs with stable model semantics. We do this because there is an existing efficient implementation, smodels 1 [25, 34, 26, 35], for normal logic programs. As smodels works only for variable free programs, we have to use a front end to ground the programs. We...
Cited by: More
A Rule-Based Formal Model For Software Configuration - Syrjänen (1999) (Correct)
Similar documents (at the sentence level):
6.5%: Efficient Implementation of the Well-founded and Stable Model .. - Niemelä, Simons (1996) (Correct)
Active bibliography (related documents): More All
0.5: Implementation Of Local Grounding For Logic Programs With Stable .. - Syrjänen (1998) (Correct)
0.4: Proof Systems for Nonmonotonic Logics - Niemelä, Schwind (1994) (Correct)
0.4: Autoepistemic Logic As A Unified Basis For Nonmonotonic Reasoning - Niemelä (1993) (Correct)
Similar documents based on text: More All
0.2: Extending and Implementing the Stable Model Semantics - Simons (2000) (Correct)
0.2: Towards Constraint Satisfaction through Logic Programs and the.. - Simons (1997) (Correct)
0.1: Lexicographic Ordering as a Basis of Proirities in Default.. - Rintanen (1996) (Correct)
BibTeX entry: (Update)
P. Simons. Efficient implementation of the stable model semantics for normal logic programs. Research Report 35, Helsinki University of Technology, Helsinki, Finland, September 1995. http://citeseer.ist.psu.edu/simons95efficient.html More
@techreport{ programs95efficient,
author = "Patrik Simons programs",
title = "Efficient implementation of the stable model semantics for normal logic",
number = "A35",
year = "1995",
url = "citeseer.ist.psu.edu/simons95efficient.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
850 A logic for default reasoning (context) - Reiter - 1980
759 Negation as failure (context) - Clark - 1978
458 A theory of diagnosis from first principles (context) - Reiter - 1987
451 Circumscription---a form of non-monotonic reasoning (context) - McCarthy - 1980
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
334 A truth maintenance system (context) - Doyle - 1979
316 Freeman and Company (context) - Garey, Johnson et al. - 1979
312 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
311 Semantical considerations on nonmonotonic logic (context) - Moore - 1985
297 Applications of circumscription to formalizing commonsense k.. - McCarthy - 1986
295 On closed world data bases (context) - Reiter - 1978
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
151 Autoepistemic logic (context) - Marek, Truszczy'nski - 1991
132 An assumption-based TMS (context) - de Kleer - 1986
118 Unfounded sets and the well-founded semantics for general lo.. (context) - Van Gelder, Ross et al. - 1988
90 Horn clause queries and generalizations (context) - Chandra, Harel - 1985
84 The complexity of logic-based abduction - Eiter, Gottlob - 1995
79 On stratified autoepistemic theories (context) - Gelfond - 1987
68 Negation in logic programming (context) - Shepherdson - 1988
67 Negation as failure using tight derivations for general logi.. (context) - Van Gelder - 1988
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinski - 1988
52 the declarative semantics of logic programs with negation (context) - Lifschitz - 1988
43 Mixed integer programming methods for computing nonmonotonic.. - Bell, Nerode et al. - 1994
38 A rational reconstruction of nonmonotonic truth maintenance .. (context) - Elkan - 1990
38 Computation of stable models and its integration with logica.. - Chen, Warren - 1994
38 Weakly perfect model semantics for logic programs (context) - Przymusinska, Przymusinski - 1988
34 default and autoepistemic semantics for general logic progra.. (context) - Marek, Subrahmanian et al. - 1992
25 branch and bound = stable models (context) - Subrahmanian, Nau et al. - 1995
20 Towards efficient default reasoning - Niemela - 1995
17 A decision method for nonmonotonic reasoning based on autoep.. - Niemela - 1994
11 Computing stable models by using the ATMS (context) - Eshghi - 1990
9 A nonmonotonic assumption-based TMS using stable bases (context) - Pimentel, Rodi - 1991
8 Tie-breaking semantics and structural totality (context) - Papadimitriou, Yannakakis - 1992
8 the impact of stratification on the complexity of nonmonoton.. - Niemela, Rintanen - 1994
6 Available by ftp from seas (context) - Chen, Warren et al. - 1993
5 Negation by default and unstratified logic programs (context) - Bidoit, Froidevaux - 1991
2 A collection of programs and data (context) - Knuth, GraphBase - 1993
1 Accepted to be presented at the IJCAI'95 Workshop on Applica.. (context) - Niemela, Simons et al. - 1995
Documents on the same site (http://saturn.tcs.hut.fi/~psimons/): More
Efficient Implementation of the Well-founded and Stable Model .. - Niemelä, Simons (1996) (Correct)
Evaluating an Algorithm for Default Reasoning - Niemelä, Simons (1995) (Correct)
Smodels - an Implementation of the Stable Model and.. - Niemelä, Simons (1997) (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