Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 304-309

  De Bruijn, Jos ^a   Eiter, Thomas ^b   Polleres, Axel ^c   Tompits, Hans ^b  

^a UNIVERSITY OF INNSBRUCK   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL LOGIC; CLASSICAL THEORY; FIRST ORDER LOGIC; FIRST-ORDER; KNOWLEDGE BASE; LOGIC PROGRAMS; NONMONOTONIC LOGIC PROGRAMS; RULE BASIS;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

FORMAL LOGIC;

EID: 84880863877     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. F. Baader and B. Hollunder. Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reas., 14:149-180, 1995.
2. P. Bonatti, C. Lutz, and F. Wolter. Expressive non-monotonic description logics based on circumscription. In Proc. KR 2006.
3. J. de Bruijn, T. Eiter, A. Polleres, H. Tompits. On representational issues about combinations of classical theories with nonmonotonic rules. In Proc. KSEM 2006.
4. J. Chen. Minimal knowledge + negation as failure = only knowing (sometimes). In Proc. LPNMR'93.
5. F. M. Donini, D. Nardi, and R. Rosati. Description logics of minimal knowledge and negation as failure. ACM ToCL, 3(2):177-225, 2002.
6. T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining answer set programming with description logics for the semantic web. In Proc. KR 2004.
7. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. ICLP' 88.
8. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Gen. Computing, 9(3/4):365-386, 1991.
9. M. Gelfond and H. Przymusinska. Reasoning on open domains. In Proc. LPNMR' 93.
10. S. Heymans, D. Van Nieuwenborgh, and D. Vermeir. Guarded Open Answer Set Programming. In Proc. LPNMR 2005.
11. I. Horrocks and P. F. Patel-Schneider. A proposal for an OWL rules language. In Proc. WWW 2004.
12. M. Kaminski and G. Rey. Revisiting quantification in autoepistemic logic. ACM ToCL, 3(4):542-561, 2002.
13. K. Konolige. Quantification in autoepistemic logic. Fund. Informaticae, 15(3-4):275-300, 1991.
14. H. Levesque and G. Lakemeyer. The Logic of Knowledge Bases. MIT Press, 2000.
15. V. Lifschitz and G. Schwarz. Extended logic programs as autoepistemic theories. In Proc. LPNMR' 93.
16. V. Marek and M. Truszczyński. Reflexive autoepistemic logic and logic programming. In Proc. LPNMR'93.
17. R. C. Moore. Semantical considerations on nonmonotonic logic. Art. Intell., 25(1):75-94, 1985.
18. T. Przymusinski. Stable semantics for disjunctive programs. New Gen. Comp., 9(3-4):401-424.
19. R. Rosati. DL+ log : Tight integration of description logics and disjunctive datalog. In Proc. KR 2006.
20. K. van Belleghem, M. Denecker, and D. De Schreye. A strong correspondence between description logics and open logic programming. In Proc. ICLP'97.