Splitting an operator: Algebraic modularity results for logics with fixpoint semantics

ACM Transactions on Computational Logic

Volumn 7, Issue 4, 2006, Pages 765-797

  Vennekens, Joost ^a   Gilis, David ^a   Denecker, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Auto epistemic logic; Default logic; Logic programming; Modularity

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; SEMANTICS; THEOREM PROVING;

AUTO-EPISTEMIC LOGIC; DEFAULT LOGIC; FIXPOINT SEMANTICS; SPLITTING THEORY;

LOGIC PROGRAMMING;

EID: 33750145738     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1183278.1183284     Document Type: Article

References (32)

1. APT, K., BLAIR, H., AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan-Kaufmann, Los Alamitos, CA.
2. BARAL, C. AND SUBRAHMANIAN, V. 1991. Duality between alternative semantics of logic programs and nonmonotonic formalisms. In Proceedings of the International Workshop on Logic Programming and Nonmonotonic Reasoning (Washington DC), A. Nerode, W. Marek, and V. Subrahmanian, Eds. MIT Press, Cambridge, MA, 69-86.
3. DENECKER, M. 2000. Extending classical logic with inductive definitions. In Proceedings of the 1st International Conference on Computational Logic (CL2000) (London, UK), J. Lloyd et al., Ed. Lecture Notes in Artificial Intelligence, vol. 1861. Springer-Verlag, New York, 703-717.
4. DENECKER, M., MAREK, V., AND TRUSZCZYNSKI, M. 1998. Fixpoint 3-valued semantics for autoepistemic logic. In Proceedings of the 15th National Conference on Artificial Intelligence. MIT Press/AAAI-Press, 840-845.
5. DENECKER, M., MAREK, V., AND TRUSZCZYNSKI, M. 2000. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In Logic-Based Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, MA, 127-144.
6. DENECKER, M., MAREK, V., AND TRUSZCZYNSKI, M. 2003. Uniform semantic treatment of default and autoepistemic logics. Artif. Intel. 143, 1 (Jan.), 79-122.
7. DENECKER, M. AND TERNOVSKA, E. 2004. A logic of non-monotone inductive definitions and its modularity properties. In LPNMR. 47-60.
8. Dix, J. 1995. A classification theory of semantics normal logic programs: II. weak properties. Fund. Inf. XXII, 257-288.
9. EITER, T., GOTTLOB, G., AND MANNILA, H. 1997. Disjunctive datalog. ACM Trans. Database Systems (TODS) 22, 364-418.
10. ERDOǦAN, S. AND LIFSCHFTZ, V. 2004. Definitions in answer set programming. In Proc. Logic Programming and Non Monotonie Reasoning, LPNMR'04. Lecture Notes in Artificial Itelligence, vol. 2923. Springer-Verlag, New York, 185-197.
11. ETHERINGTON, D. 1988. Reasoning with incomplete information. Research notes in Artificial Intelligence. Morgan-Kaufmann, Reading, MA.
12. FITTING, M. 1985. A Kripke-Kleene semantics for logic programs. J. Logic Prog. 2, 4, 295-312.
13. FITTING, M. 1991. Bilattices and the semantics of logic programming. J. Logic Prog. 11, 91- 116.
14. GELFOND, M. 1987. On stratified autoepistemic theories. In Proceedings of AAAI87. Morgan-Kaufman, Los Altos, CA, 207-211.
15. GELFOND, M. AND PRZYMUSINSKA, H. 1992. On consistency and completeness of autoepistemic theories. Fund. Inf. 16, 1, 59-92.
16. GINSBEHG, M. 1988. Multivalued logics: A uniform approach to reasoning in artificial intelligence. Computat. Intell. 4, 265-316.
17. KONOLIGE, K. 1987. On the relation between default and autoepistemic logic. In Readings in Nonmonotonic Reasoning, M. L. Ginsberg, Ed. Morgan-Kaufmann, Los Altos, CA, 195-226.
18. LEONE, N., RULLO, P., AND SCAHCELLO, F. 1995. Declarative and fixpoints characterizations of disjunctive stable models. In Proceedings of the International Logic Programming Symposium (ILPS '95). MIT Press, Cambridge, MA, 399-413.
19. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming. MIT Press, Cambridge, MA, 23-37.
20. LLOYD, J. 1987. Foundations of Logic Programming. Springer-Verlag, New York.
21. MEYER, J.-J.CH. AND VAN DER HOEK, W. 1995. Epistemic Logic for Computer Science and Artificial Intelligence. Cambridge University Press.
22. MOORE, R. C. 1984. Possible-world semantics for autoepistemic logic. In Proceedings of the Non-Monotonic Reasoning Workshop. AAAI, Mohonk, NY, 344-354.
23. PELOV, N. AND TRUSZCZYNSKI, M. 2004. Semantics of disjunctive programs with monotone aggregates - an operator-based approach. In Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, B.C., Canada, June 6-8, J. P. Delgrande and T. Schaub, Eds. 327-334.
24. NIEMELÄ, I. AND RINTANEN, J. 1994. On the impact of stratification on the complexity of nonmonotonic reasoning. J. Appl. Non-Classical Log. 4, 2.
25. PRZYMUSINSKI, T. 1998. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the 8th Symposium on Principles of Database Systems (PODS). 11-21.
26. REITER, R. 1980. A logic for default reasoning. Artif. Intell. 13, 1-2, 81-132.
27. TARSKI, A. 1955. Lattice-theoretic fixpoint theorem and its applications. Pac. J. Math. 5, 285-309.
28. TURNER, H. 1996. Splitting a default theory. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference. AAAI Press, 645-651.
29. VAN GELDER, A., ROSS, K., AND SCHLIPF, J. 1991. The well-founded semantics for general logic programs. J. ACM 38, 3, 620-650.
30. VENNEKENS, J., GILIS, D., AND DENECKER, M. 2004a. Splitting an operator: An algebraic modularity result and its application to auto-epistemic logic. In Proceedings of International Workshop on Non-Monotonic Reasoning, Whistler, B.C., Canada.
31. VENNEKENS, J., GILIS, D., AND DENECKER, M. 2004b. Splitting an operator: An algebraic modularity result and its applications to logic programming. In Proceedings of the 20th International Conference on Logic Programming (ICLP 2004), Lecture Notes in Computer Science, vol. 3132. Springer-Verlag, New York, 195-209.
32. VERBAETEN, S., DENECKER, M., AND SCHREYE, D. D. 2000. Compositionality of normal open logic programs. J. Logic Prog. 41, 151-183.