Object-Oriented Knowledge Bases in Logic Programming

characterization of the problem  Naturally existential rules  If you write a rule describing an object structure and create the following graph  Each variable in the body of the rule is a node  Each predicate in the body of the rule is a labeled edge between the variables participating in the predicate  The resulting graph is not tree-structured  Objects are so intricate that it is not possible to write a single rule  You need a mechanism of abstraction to create the graph structures separately and then let them refer to each other

[1]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[2]  Martin Gebser,et al.  clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[3]  John S. Schlipf.  A Survey of Complexity and Undecidability Results in Logic Programming , 1992, Structural Complexity and Recursion-theoretic methods in Logic-Programming.

[4]  Thomas Eiter,et al.  FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols , 2010, TOCL.

[5]  Jos de Bruijn,et al.  OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web , 2005, WWW '05.

[6]  Peter D. Karp,et al.  OKBC: A Programmatic Foundation for Knowledge Base Interoperability , 1998, AAAI/IAAI.

[7]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[8]  Wolfgang Faber,et al.  The dlv System: Model Generator and Application Frontends , 1997 .

[9]  Mario Alviano,et al.  Disjunctive ASP with functions: Decidable queries and effective computation , 2010, Theory Pract. Log. Program..

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

[11]  Peter Clark,et al.  Project Halo Update - Progress Toward Digital Aristotle , 2010, AI Mag..

[12]  Franz Baader.  Description Logics , 2009, Reasoning Web.

[13]  Georg Gottlob,et al.  Datalog±: a unified approach to ontologies and integrity constraints , 2009, ICDT '09.

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

[15]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[16]  Victor W. Marek,et al.  How Complicated is the Set of Stable Models of a Recursive Logic Program? , 1992, Ann. Pure Appl. Log..