Open answer set programming for the semantic web

Journal of Applied Logic

Volumn 5, Issue 1, 2007, Pages 144-169

  Heymans, Stijn ^a   Van Nieuwenborgh, Davy ^a   Vermeir, Dirk ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

Answer set programming; Description logics; Open domain reasoning; Semantic web

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; SET THEORY; SYNTACTICS; WORLD WIDE WEB;

ANSWER SET PROGRAMMING; DESCRIPTION LOGICS; OPEN DOMAIN REASONING; SEMANTIC WEB;

LOGIC PROGRAMMING;

EID: 33846200748     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2006.02.001     Document Type: Article

References (54)

1. The rule markup initiative. http://www.ruleml.org
2. Alsaç G., and Baral C. Reasoning in description logics using declarative logic programming (2002). http://www.public.asu.edu/guray/dlreasoning.pdf
3. Andréka H., Németi I., and Van Benthem J. Modal languages and bounded fragments of predicate logic. J. Philos. Logic 27 3 (1998) 217-274
4. G. Antoniou, A nonmonotonic rule system using ontologies, in: CEUR Proceedings, 2002
5. Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P. The Description Logic Handbook (2003), Cambridge University Press
6. F. Baader, U. Sattler, Number restrictions on complex roles in description logics, in: Proc. of KR-96, 1996, pp. 328-339
7. Baral C. Knowledge Representation, Reasoning and Declarative Problem Solving (2003), Cambridge Press
8. Bechhofer S., Goble C., and Horrocks I. DAML + OIL is not enough. Proc. of the First Semantic Web Working Symposium (SWWS'01) (2001), CEUR 151-159
9. Bechhofer S., van Harmelen F., Hendler J., Horrocks I., McGuinness D.L., Patel-Schneider P.F., and Stein L.A. OWL web ontology language reference, W3C recommendation (February 2004). http://www.w3.org/TR/owl-ref/
10. K. Van Belleghem, M. Denecker, D. De Schreye, A strong correspondence between description logics and open logic programming, in: Proc. of ICLP'97, 1997, pp. 346-360
11. Bonatti P.A. Reasoning with infinite stable models. Artificial Intelligence 156 (2004) 75-111
12. Borgida A. On the relative expressiveness of description logics. Artificial Intelligence 82 1-2 (1996) 353-367
13. Bry F., and Schaffert S. An entailment relation for reasoning on the web. Proc. of Rules and Rule Markup Languages for the Semantic Web. Lecture Notes in Computer Science (2003), Springer 17-34
14. Dantsin E., Eiter T., Gottlob G., and Voronkov A. Complexity and expressive power of logic programming. ACM Comput. Surv. 33 3 (2001) 374-425
15. Donini F.M., Lenzerini M., Nardi D., and Schaerf A. AL-log: integrating datalog and description logics. J. Intelligent Cooperative Inf. Syst. 10 (1998) 227-252
16. Eiter T., Faber W., Fink M., Pfeifer G., and Woltran S. Complexity of model checking and bounded predicate arities for non-ground answer set programming. Proceedings Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004). June 2-5, Whistler, British Columbia, Canada (2004), Morgan Kaufmann 377-387
17. T. Eiter, T. Lukasiewicz, R. Schindlauer, H. Tompits, Combining answer set programming with description logics for the semantic web, in: Proc. of KR 2004
18. Eiter T., Lukasiewicz T., Schindlauer R., and Tompits H. Well-founded semantics for description logic programs in the semantic web. Proc. of RuleML 2004. Lecture Notes in Computer Science vol. 3323 (2004), Springer 81-97
19. Emerson E.A. Temporal and modal logic. Handbook of Theoretical Computer Science (1990), Elsevier Science Publishers B.V. 995-1072
20. Friendman-Hill E.J. Jess homepage. http://herzberg.ca.sandia.gov/jess/
21. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. Proc. of ICLP'88 (1988), MIT Press, Cambridge, MA 1070-1080
22. Gelfond M., and Przymusinska H. Reasoning in open domains. Logic Programming and Non-Monotonic Reasoning (1993), MIT Press 397-413
23. Golbreich C. Combining rule and ontology reasoners for the semantic web. Proc. of RuleML 2004. Lecture Notes in Computer Science vol. 3323 (2004), Springer 6-22
24. B.N. Grosof, I. Horrocks, R. Volz, S. Decker, Description logic programs: combining logic programs with description logic, in: Proc. of Twelfth International World Wide Web Conference (WWW 2003), 2003, pp. 48-57
25. Grosof B.N., and Poon T.C. SweetDeal: representing agent contracts with exceptions using XML rules. Proc. of WWW 2003 (2003), ACM Press 340-349
26. V. Haarslev, R. Moller, Description of the RACER system and its applications, in: Proc. of Description Logics 2001, 2001
27. Halpern J.Y., and Moses Y. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54 3 (1992) 319-379
28. Heymans S., Van Nieuwenborgh D., and Vermeir D. Semantic web reasoning with conceptual logic programs. Proc. of RuleML 2004. Lecture Notes in Computer Science vol. 3323 (2004), Springer 113-127
29. Heymans S., Van Nieuwenborgh D., and Vermeir D. Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. Proc. of ESWC 2005. Lecture Notes in Computer Science (2005), Springer in press
30. Heymans S., Van Nieuwenborgh D., and Vermeir D. Guarded open answer set programming. In: Baral C., Greco G., Leone N., and Terracina G. (Eds). 8th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2005), Diamante, Italy. Lecture Notes in Artificial Intelligence vol. 3662 (2005), Springer 92-104
31. Heymans S., and Vermeir D. Integrating description logics and answer set programming. Proc. of PPSWR 2003. Lecture Notes Computer Science vol. 2901 (2003), Springer 146-159
32. Hladik J., and Sattler U. A translation of looping alternating automata to description logics. Proc. of CADE-19. Lecture Notes in Artificial Intelligence vol. 2741 (2003), Springer
33. Horrocks I., and Patel-Schneider P.F. A proposal for an OWL rules language. Proc. of the Thirteenth International World Wide Web Conference (WWW 2004) (2004), ACM
34. Horrocks I., and Sattler U. Ontology reasoning in the SHOQ (D) description logic. Proc. of IJCAI'01 (2001), Morgan Kaufmann 199-204
35. Horrocks I., Sattler U., and Tobies S. Practical reasoning for expressive description logics. In: Ganzinger H., McAllester D., and Voronkov A. (Eds). Proc. of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR'99), vol. 1705 (1999), Springer 161-180
36. I. Horrocks, P.F. Schneider, H. Boley, S. Tabet, B. Grosof, M. Dean, SWRL: a semantic web rule language combining OWL and RuleML, May 2004
37. I. Horrocks, P. Patel-Schneider, Reducing OWL entailment to description logic satisfiability, J. Web Semantics, 2004, in press
38. - description logic to disjunctive datalog programs, FZI-Report 1-8-11/03, Forschungszentrum Informatik (FZI), 2003
39. Inoue K., and Sakama C. Negation as failure in the head. J. Logic Programming 35 1 (1998) 39-78
40. Ladner R.E. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6 3 (1977) 467-480
41. Leone N., Pfeifer G., and Faber W. dlv homepage. http://www.dbai.tuwien.ac.at/proj/dlv/
42. Lifschitz V. Answer set programming and plan generation. Artificial Intelligence 138 1-2 (2002) 39-54
43. Mei J., Liu S., Yue A., and Lin Z. An extension to OWL with general rules. Proc. of RuleML 2004. Lecture Notes in Computer Science vol. 3323 (2004), Springer 6-22
44. B. Motik, R. Volz, A. Maedche, Optimizing query answering in description logics using disjunctive deductive databases, in: Proc. of KRDB'03, 2003, 39-50
45. Motik B., Sattler U., and Studer R. Query answering for OWL-DL with rules. Proc. of ISWC 2004. Lecture Notes in Computer Science vol. 3298 (2004), Springer 549-563
46. Nute D. Defeasible logic. In: Gabbay D.M., Hogger C.J., and Robinson J.A. (Eds). Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3 (1994), Clarendon Press 353-395
47. R. Rosati, Towards expressive KR systems integrating datalog and description logics: preliminary report, in: Proc. of DL'99, 1999, pp. 160-164
48. J. Schlipf, Some remarks on computability and open domain semantics, in: Proc. of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming of the International Logic Programming Symposium, 1993
49. Schmidt-Schaub M., and Smolka G. Attributive concept descriptions with complements. Artificial Intelligence 48 1 (1991) 1-26
50. Simons P. smodels homepage. http://www.tcs.hut.fi/Software/smodels/
51. Smith M., Welty C., and McGuinness D. OWL web ontology language guide (2004). http://www.w3.org/TR/owl-guide/
52. Swift T. Deduction in ontologies via answer set programming. In: Lifschitz V., and Niemelä I. (Eds). Proc. of LPNMR 2004. Lecture Notes in Computer Science vol. 2923 (2004), Springer 275-288
53. M.Y. Vardi, Why is modal logic so robustly decidable? Technical Report TR97-274, Rice University, April 12, 1997
54. Vardi M.Y. Reasoning about the past with two-way automata. Proc. of ICALP '98 (1998), Springer 628-641