Teodor C. Przymusinski  Home/Search
Context Related
| ucr.edu/pub/teodor/genstrat.ps.gz 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: ucr.edu/~teodor/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 1 Introduction The perfect model semantics [ABW88, VG89b, Prz88a, Prz89b] provides an attractive alternative to the traditionally used semantics of logic programs based on Clark's completion of the program [Cla78, Llo84, Fit85, Kun87]. Perfect models are minimal models of the program, which can be equivalently described as iterated least fixed points of natural operators [ABW88, VG89b], as iterated least models of the program [ABW88, VG89b] or as preferred models with respect to a natural... (Update)
Context of citations to this paper: More
.... definitions in stratified or dynamically stratified Datalog, guaranteeing one single minimal model and thus unambiguous query results ([31]) 5 Technically, when using negation, recursion and the ternary representation of statements, static stratification can never be...
.... definitions in stratified or dynamically stratified Datalog, guaranteeing one single minimal model and thus unambiguous query results ( [8]) RDF QEL i A: Support for the usual aggregation functions as defined by SQL2 (e.g. COUNT, AVG, MIN, MAX) will be denoted by appending...
Cited by: More
Reliable Semantics for Extended Logic Programs with Rule.. - Analyti, Pramanik (2004) (Correct)
The Limits of Fixed-Order Computation - Sagonas, Swift, Warren (1996) (Correct)
Building Open Systems Using Edutella - Edutella framework and.. - Dolog (Correct)
Similar documents (at the sentence level):
6.4%: On the Declarative and Procedural Semantics of Logic Programs - Przymusinski (1995) (Correct)
Active bibliography (related documents): More All
0.3: Non-Monotonic Formalisms And Logic Programming - Przymusinski (1989) (Correct)
0.3: Semantic Issues in Deductive Databases and Logic Programs - Przymusinska, Przymusinski (1990) (Correct)
0.2: Logic Programming and Negation: A Survey - Apt, Bol (1994) (Correct)
Similar documents based on text: More All
0.2: Changes in web client access patterns: Characteristics and.. - Barford, al. (1998) (Correct)
0.2: Quality of Service (QoS) in Distributed.. - Kalkbrenner, Pirkmayer, .. (1993) (Correct)
0.2: Weakly Stratified Logic Programs - Przymusinska, Przymusinski (1990) (Correct)
Related documents from co-citation: More All
56: The Stable Model Semantics for Logic Programming - Gelfond - 1988
53: Foundations of Logic Programming (context) - Lloyd - 1987
40: A procedural semantics for well founded negation in logic programs - Ross - 1989
BibTeX entry: (Update)
T.C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the ACM Symposium on Principle of Database Systems (PODS), pages 11--21, 1989. http://citeseer.ist.psu.edu/przymusinski89every.html More
@inproceedings{ przymusinski89every,
author = "T. C. Przymusinski",
title = "Every logic program has a natural stratification and an iterated least fixed point model",
pages = "11--21",
year = "1989",
url = "citeseer.ist.psu.edu/przymusinski89every.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
759 Negation as failure (context) - Clark - 1978
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
186 Negation in logic programming (context) - Kunen - 1987
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
115 The alternating fixpoint of logic programs with negation (context) - Van Gelder - 1989
109 Constructive negation based on the completed database (context) - Chan - 1988
90 Horn clause queries and generalizations (context) - Chandra, Harel - 1985
62 the declarative and procedural semantics of logic programs - Przymusinski - 1989
55 A procedural semantics for well founded negation in logic pr.. - Ross - 1989
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinski - 1988
38 Weakly perfect model semantics for logic programs (context) - Przymusinska, Przymusinski - 1988
24 Logic programming as constructivism: A formalization and its.. (context) - Bry - 1989
22 Completeness of a top-down query evaluation procedure for st.. (context) - Kemp, Topor - 1988
21 On constructive negation in logic programming - Przymusinski - 1989
19 A query evaluation method for stratified programs under the .. (context) - Seki, Itoh - 1988
19 Design and implementation of logic-based language for data i.. (context) - Zaniolo - 1988
8 Three-valued non-monotonic formalisms and logic programming (context) - Przymusinski - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucr.edu/~teodor/papers.html): More
Stationary Default Extensions - Przymusinska, Prymusinski (1992) (Correct)
Well-Founded Semantics Coincides with Three-Valued Stable.. - Przymusinski (1990) (Correct)
Autoepistemic Logic of Knowledge and Beliefs - Przymusinski (1998) (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