External sources of knowledge and value invention in logic programming

The issue of value invention in logic programming embraces many scenarios, such as logic programming with function symbols, object oriented logic languages, inter-operability with external sources of knowledge, or set unification. This work introduces a framework embedding value invention in a general context. The class of programs having a suitable (but, in general, not decidable) ‘finite grounding property’ is identified, and the class of ‘value invention restricted’ programs is introduced. Value invention restricted programs have the finite grounding property and can be decided in polynomial time. They are a very large polynomially decidable class having this property, when no assumption can be made about the nature of invented values (while this latter is the case in the specific literature about logic programming with function symbols). Relationships with existing formalisms are eventually discussed, and the implementation of a system supporting the class of such programs is described.

[1]  Luigi Palopoli,et al.  Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming , 2005, ISMIS.

[2]  Luca Cabibbo,et al.  The Expressive Power of Stratified Logic Programs with Value Invention , 1998, Inf. Comput..

[3]  Hans Tompits,et al.  Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning , 2006, ESWC.

[4]  Hans Tompits,et al.  Nonmonotonic Description Logic Programs: Implementation and Experiments , 2005, LPAR.

[5]  Yehoshua Sagiv,et al.  Safety of datalog queries over infinite databases , 1989, PODS '89.

[6]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[7]  Tommi Syrjänen.  Omega-Restricted Logic Programs , 2001, LPNMR.

[8]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[9]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[10]  Kenneth A. Ross,et al.  The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.

[11]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[12]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[13]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[14]  Luca Cabibbo.  Expressiveness of Semipositive Logic Programs with Value Invention , 1996, Logic in Databases.

[15]  Abraham Silberschatz,et al.  Safety of recursive Horn clauses with infinite relations , 1987, PODS '87.

[16]  Stijn Heymans,et al.  Semantic Web Reasoning with Conceptual Logic Programs , 2004, RuleML.

[17]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

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

[19]  Francesco Scarcello,et al.  Improving ASP Instantiators by Join-Ordering Methods , 2001, LPNMR.

[20]  Stijn Heymans,et al.  Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs , 2005, ESWC.

[21]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[22]  Agostino Dovier,et al.  Set unification , 2001, Theory and Practice of Logic Programming.

[23]  Pasquale Rullo,et al.  Reasoning-Based Knowledge Extraction for Text Classification , 2004, Discovery Science.

[24]  Enrico Pontelli,et al.  Proceedings of the 24th International Conference on Logic Programming , 2008 .

[25]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[26]  Masatoshi Yoshikawa,et al.  ILOG: Declarative Creation and Manipulation of Object Identifiers , 1990, VLDB.