Abstract
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, set unification. This paper 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, in a sense, the broadest polynomially decidable class having this property, whenever 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; in particular, value invention restricted programs subsume ω-restricted programs and are incomparable with finitary programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Vianu, V.: Datalog Extensions for Database Queries and Updates. JCSS 43(1), 62–124 (1991)
Cabibbo, L.: Expressiveness of Semipositive Logic Programs with Value Invention. Logic in Databases, 457–474 (1996)
Hull, R., Yoshikawa, M.: ILOG: Declarative Creation and Manipulation of Object Identifiers. In: VLDB 1990, pp. 455–468 (1990)
Eiter, T., et al.: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming. In: IJCAI 2005, pp. 90–96 (2005)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. In: Gómez-Pérez, A., Euzenat, J. (eds.) ESWC 2005. LNCS, vol. 3532, pp. 392–407. Springer, Heidelberg (2005)
Leone, N., et al.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL (to appear, 2006), http://www.arxiv.org/ps/cs.AI/0211004
Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138, 181–234 (2002)
Calimeri, F., Ianni, G.: External Sources of Computation for Answer Set Solvers. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol. 3662, pp. 105–118. Springer, Heidelberg (2005)
Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS, vol. 2173, pp. 267–279. Springer, Heidelberg (2001)
Bonatti, P.A.: Reasoning with Infinite Stable Models. In: IJCAI 2001, pp. 603–610 (2001)
The Friend of a Friend (FOAF) Project, http://www.foaf-project.org/
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Lifschitz, V., Turner, H.: Splitting a Logic Program. In: ICLP 1994, pp. 23–37 (1994)
Dovier, A., Pontelli, E., Rossi, G.: Set unification. In: TPLP (to appear, 2006)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Semantic web reasoning with conceptual logic programs. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 113–127. Springer, Heidelberg (2004)
Cabibbo, L.: The Expressive Power of Stratified Logic Programs with Value Invention. Inf. and Comp. 147(1), 22–56 (1998)
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Nonmonotonic description logic programs: Implementation and experiments. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 511–527. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calimeri, F., Cozza, S., Ianni, G. (2006). Decidable Fragments of Logic Programming with Value Invention. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds) Logics in Artificial Intelligence. JELIA 2006. Lecture Notes in Computer Science(), vol 4160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853886_10
Download citation
DOI: https://doi.org/10.1007/11853886_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39625-3
Online ISBN: 978-3-540-39627-7
eBook Packages: Computer ScienceComputer Science (R0)