Access the full text.
Sign up today, get DeepDyve free for 14 days.
Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan (2009)
Characterizations of stable model semantics for logic programs with arbitrary constraint atomsTheory and Practice of Logic Programming, 9
V. Lifschitz (1994)
Minimal Belief and Negation as FailureArtif. Intell., 70
A. Andrew (2004)
Knowledge Representation, Reasoning and Declarative Problem SolvingKybernetes, 33
K. Apt, V. Marek, M. Truszczynski, D. Warren (1999)
The Logic Programming Paradigm
V. Marek, A. Nerode, J. Remmel (1997)
Complexity of Recursive Normal Default LogicFundam. Informaticae, 32
M. Gelfond, V. Lifschitz (1988)
Proceedings of the International Joint Conference and Symposium on Logic Programming
I. Niemelä (1999)
Logic programs with stable model semantics as a constraint programming paradigmAnnals of Mathematics and Artificial Intelligence, 25
V. Marek, A. Nerode, J. Remmel (1997)
Basic Forward Chaining Construction for Logic Programs
H. Blair, V. Marek, J. Remmel (2008)
Set based logic programmingAnnals of Mathematics and Artificial Intelligence, 52
A. Provetti, Cao Tran (2001)
Answer set programming : towards efficient and scalable knowledge representation and reasoning : papers from the 2001 AAAI Symposium, March 26-28, Stanford, California
(1992)
A context for belief revision: normal nonmonotonic programs
R. Reiter (1987)
A Logic for Default ReasoningArtif. Intell., 13
V. Marek, A. Nerode, J. Remmel (1999)
Logic Programs, Well-Orderings, and Forward ChainingAnn. Pure Appl. Log., 96
V. Marek, M. Truszczynski (1998)
Stable models and an alternative logic programming paradigm
H. Blair, V. Marek, J. Remmel (2006)
Spatial Logic Programming
(1997)
Basic foward chaining construction for logic programs . In : Logical Foundations of Computer Science , 4th Internation Symposium , LFCS ’ 97 , Yaroslavl , Russia , 6 – 12 July
Blair et al. (2001) developed an extension of logic programming called set based logic programming. In the theory of set based logic programming the atoms represent subsets of a fixed universe X and one is allowed to compose the one-step consequence operator with a monotonic idempotent operator O so as to ensure that the analogue of stable models in the theory are always closed under O. Marek et al. (1992, Ann Pure Appl Logic 96:231–276 1999) developed a generalization of Reiter’s normal default theories that can be applied to both default theories and logic programs which is based on an underlying consistency property. In this paper, we show how to extend the normal logic programming paradigm of Marek, Nerode, and Remmel to set based logic programming. We also show how one can obtain a new semantics for set based logic programming based on a consistency property.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 6, 2009
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.