Semantic Web Reasoning with Conceptual Logic Programs

We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while carefully guarding useful knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting Conceptual Logic Programs can be reduced to finite, normal Answer Set Programming, for which reasoners are available.

[1]  Stijn Heymans,et al.  Guarded Open Answer Set Programming , 2005, LPNMR.

[2]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[3]  Terrance Swift.  Deduction in Ontologies via Answer Set Programming , 2004 .

[4]  François Bry,et al.  An Entailment Relation for Reasoning on the Web , 2003, RuleML.

[5]  Boris Motik,et al.  Optimizing Query Answering in Description Logics using Disjunctive Deductive Databases , 2003, KRDB.

[6]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[7]  Danny De Schreye,et al.  A Strong Correspondence between Description Logics and Open Logic Programming , 1997, ICLP.

[8]  Sergio Tessaris.  Querying expressive DLs , 2001, Description Logics.

[9]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[10]  François Fages,et al.  Principles and Practice of Semantic Web Reasoning, Third International Workshop, PPSWR 2005, Dagstuhl Castle, Germany, September 11-16, 2005, Proceedings , 2005, PPSWR.

[11]  Francesco M. Donini,et al.  Description logics of minimal knowledge and negation as failure , 2002, TOCL.

[12]  H. Lan,et al.  SWRL : A semantic Web rule language combining OWL and ruleML , 2004 .

[13]  Michael Gelfond,et al.  Reasoning on Open Domains , 1993, LPNMR.

[14]  Ian Horrocks,et al.  A proposal for an owl rules language , 2004, WWW '04.

[15]  Francesco M. Donini,et al.  AL-log: Integrating Datalog and Description Logics , 1998, Journal of Intelligent Information Systems.

[16]  Ian Horrocks,et al.  Ontology Reasoning in the SHOQ(D) Description Logic , 2001, IJCAI.

[17]  Boris Motik,et al.  Reducing SHIQ-Description Logic to Disjunctive Datalog Programs , 2004, KR.

[18]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[19]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[20]  Stijn Heymans,et al.  Integrating ontology languages and answer set programming , 2003, 14th International Workshop on Database and Expert Systems Applications, 2003. Proceedings..

[21]  Theresa Swift,et al.  Deduction in Ontologies via ASP , 2004, LPNMR.

[22]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[23]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[24]  L. Stein,et al.  OWL Web Ontology Language - Reference , 2004 .

[25]  Stijn Heymans,et al.  Integrating Description Logics and Answer Set Programming , 2003, PPSWR.

[26]  Riccardo Rosati,et al.  Towards expressive KR systems integrating datalog and description logics: preliminary report , 1999, Description Logics.

[27]  Chitta Baral,et al.  Reasoning in description logics using declarative logic programming , 2004 .