Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Provetti, A., Son, T.C.: Answer set programming, towards efficient and scalable knowledge representation and reasoning. In: Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, Stanford, CA, USA (2001)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Blair, H.A., Marek, V.W., Remmel, J.B.: Spatial logic programming. In: Proceedings SCI 2001, Orlando, FL, July (2001)
Blair, H.A., Marek, V.W., Remmel, J.B., Rivera, A.: Set based logic programming. In: Proceedings of the of the 4-th International Workshop on Computational Logic in Multi-Agent Systems (2004)
Blair, H.A., Marek, V.W., Remmel, J.B.: Set based logic programming. Ann. Math. Artif. Intell. 52, 81–105 (2008)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Joint Conference and Symposium on Logic Programming, pp. 1070–1080. MIT, Massachusetts (1988)
Lifschitz, V.: Minimal belief and negation as failure. Artif. Intell. 70, 53–72 (1994)
Marek, W., Nerode, A., Remmel, J.B.: A context for belief revision: normal nonmonotonic programs. In: Proceedings of the Workshop on Defeasible Resoning and Constraint Solving at International Logic Programming Symposium, San Diego, CA (1992)
Marek, W., Nerode, A., Remmel, J.B.: Basic foward chaining construction for logic programs. In: Logical Foundations of Computer Science, 4-th Internation Symposium, LFCS’97, Yaroslavl, Russia, 6–12 July 1997. Lecture Notes in Computer Science 1234, pp. 214–225. Springer, Berlin (1997)
Marek, W., Nerode, A., Remmel, J.B.: Complexity of recursive normal default logic. Fundam. Inform. XXXII, 139–148 (1997)
Marek, W., Nerode, A., Remmel, J.B.: Logic programs, well-orderings, and forward chaining. Ann. Pure Appl. Logic 96, 231–276 (1999)
Marek, V.W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm, pp. 375–398. Series Artificial Intelligence. Springer, Berlin (1999)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3,4), 241–273 (1999)
Reiter, R.: A logic for default reasoning. Artif. Intell. 13, 81–132 (1980)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated the Victor Marek on the occasion of his 65-th birthday.
Rights and permissions
About this article
Cite this article
Nerode, A., Remmel, J.B. Consistency properties and set based logic programming. Ann Math Artif Intell 53, 289–311 (2008). https://doi.org/10.1007/s10472-009-9117-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-009-9117-x