Access the full text.
Sign up today, get DeepDyve free for 14 days.
Peter Cholak, H. Blair (1994)
The Complexity of Local StratificationFundam. Informaticae, 21
M. Fitting (1985)
A Kripke-Kleene Semantics for Logic ProgramsJ. Log. Program., 2
Teodor Przymusinski (1988)
On the Declarative Semantics of Deductive Databases and Logic Programs
M. Gelfond, N. Leone (2002)
Logic programming and knowledge representation - The A-Prolog perspectiveArtif. Intell., 138
E. Ashcroft, W. Wadge (1982)
R for SemanticsACM Trans. Program. Lang. Syst., 4
Teodor Przymusinski (1990)
The Well-Founded Semantics Coincides with the Three-Valued Stable SemanticsFundam. Inform., 13
Chitta Baral, M. Gelfond (1994)
Logic Programming and Knowledge Representation, 1471
Bertram Ludäscher (1998)
Integration of Active and Deductive Database Rules, 45
J. Lloyd (1987)
Foundations of logic programming; (2nd extended ed.)
G. Lakoff, R. Núñez (2000)
Where Mathematics Comes From
M. Gelfond, Vladimir Lifschitz (1988)
The Stable Model Semantics for Logic Programming
A. Gelder, K. Ross, J. Schlipf (1991)
The well-founded semantics for general logic programsJ. ACM, 38
Ashcroft and William W . Wadge . Prescription for semantics
P. Rondogiannis (2001)
Stratified negation in temporal logic programming and the cycle-sum testTheor. Comput. Sci., 254
M. Fitting (2001)
Fixpoint Semantics for Logic Programming a SurveyMathematics eJournal
(2003)
ACM Transactions on Computational Logic
K. Apt, H. Blair, A. Walker (1988)
Towards a Theory of Declarative Knowledge
V. Marek, M. Truszczynski (1998)
Stable models and an alternative logic programming paradigm
K. Apt, R. Bol (1994)
Logic Programming and Negation: A SurveyJ. Log. Program., 19/20
M. Orgun, W. Wadge (1992)
Towards a Unified Theory of Intensional Logic ProgrammingJ. Log. Program., 13
A. Gelder (1993)
The Alternating Fixpoint of Logic Programs with NegationJ. Comput. Syst. Sci., 47
Teodor Przymusinski (1989)
Every logic program has a natural stratification and an iterated least fixed point modelProceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
(2001)
Logic programming and negation : a survey
M. Emden, R. Kowalski (1976)
The Semantics of Predicate Logic as a Programming LanguageJ. ACM, 23
K. Kunen (1987)
Negation in Logic ProgrammingJ. Log. Program., 4
R. Guy (1978)
On numbers and gamesProceedings of the IEEE, 66
M. Orgun (1994)
Temporal and modal logic programming: an annotated bibliographySIGART Bull., 5
M. Denecker, M. Bruynooghe, V. Marek (2001)
Logic programming revisitedACM Transactions on Computational Logic (TOCL), 2
H. Przymusinska, Teodor Przymusinski (1990)
Semantic Issues in Deductive Databases and Logic Programs
C. Zaniolo, Natraj Arni, K. Ong (1993)
Negation and Aggregates in Recursive Rules: the LDL++ Approach
(1988)
The Netherlands, 321–367
J. Lloyd (1984)
Foundations of Logic Programming
Keith Clark (1987)
Negation as Failure
K. Apt, V. Marek, M. Truszczynski, D. Warren (2011)
The Logic Programming Paradigm: A 25-Year Perspective
We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics, the meaning of a program is, as in the classical case, the unique minimum model in a program-independent ordering. We use an expanded truth domain that has an uncountable linearly ordered set of truth values between False (the minimum element) and True (the maximum), with a Zero element in the middle. The truth values below Zero are ordered like the countable ordinals. The values above Zero have exactly the reverse order. Negation is interpreted as reflection about Zero followed by a step towards Zero ; the only truth value that remains unaffected by negation is Zero . We show that every program has a unique minimum model M P , and that this model can be constructed with a T P iteration which proceeds through the countable ordinals. Furthermore, we demonstrate that M P can alternatively be obtained through a construction that generalizes the well-known model intersection theorem for classical logic programming. Finally, we show that by collapsing the true and false values of the infinite-valued model M P to (the classical) True and False , we obtain a three-valued model identical to the well-founded one.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Apr 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.