Abstract
The paper introduces Answer Set Programming with External Predicates (ASP-EX), a framework aimed at enabling ASP to deal with external sources of computation. This feature is realized by the introduction of “parametric” external predicates, whose extension is not specified by means of a logic program but computed through external code. With respect to existing approaches it is explicitly addressed the issue of invention of new information coming from external predicates, in form of new, and possibly infinite, constant symbols. Several decidable restrictions of the language are identified as well as suitable algorithms for evaluating Answer Set Programs with external predicates. The framework paves the way to Answer Set Programming in several directions such as pattern manipulation applications, as well as the possibility to exploit function symbols. ASP-EX has been successfully implemented in the DLV system, which is now enabled to make external program calls.
Work supported by the EC under projects INFOMIX (IST-2001-3357) and WASP (IST-2001-37004), and by FWF under project “Answer Set Programming for the Semantic Web” (P17212-N04)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Babovich, Y., Maratea, M.: Cmodels-2: Sat-based answer sets solver enhanced to non-tight programs (2003), http://www.cs.utexas.edu/users/tag/cmodels.html
Bonatti, P.A.: Reasoning with infinite stable models. AI 156(1), 75–111 (2004)
Cabibbo, L.: The Expressive Power of Stratified Logic Programs with Value Invention. Inf. Comput. 147(1), 22–56 (1998)
Cumbo, C., Iiritano, S., Rullo, P.: Reasoning-based knowledge extraction for text classification. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 380–387. Springer, Heidelberg (2004)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM CS 33(3), 374–425 (2001)
Eiter, T., Gottlob, G., Veith, H.: Modular Logic Programming and Generalized Quantifiers. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265. Springer, Heidelberg (1997)
Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-State Planning, II: the DLV\(^{\cal K}\) System. Artif. Intell. 144(1–2), 157–211 (2003)
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Nonmonotonic description logic programs: Implementation and experiments. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 511–527. Springer, Heidelberg (2005)
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming. In: IJCAI 2005, Edinburgh, UK (2005) (to appear)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP 1988, pp. 1070–1080. MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9, 365–385 (1991)
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)
Hull, R., Yoshikawa, M.: On the equivalence of database restructurings involving object identifiers. In: PODS 1991, pp. 328–340. ACM Press, New York (1991)
Leone, N., Perri, S., Scarcello, F.: Improving ASP Instantiators by Join-Ordering Methods. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, p. 280. Springer, Heidelberg (2001)
Leone, N., Gottlob, G., Rosati, R., Eiter, T., et al.: The INFOMIX System for Advanced Integration of Incomplete and Inconsistent Data. In: SIGMOD 2005. ACM, New York (2005) (to appear)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL (2005) (to appear)
Lifschitz, V., Turner, H.: Splitting a Logic Program. In: ICLP 1994, pp. 23–37. MIT Press, Cambridge (1994)
Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: AAAI 2002. AAAI Press/MIT Press (2002)
Osorio, M., Corona, E.: The A-Pol system. In: ASP (2003)
Palopoli, L., Rombo, S., Terracina, G.: Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 504–513. Springer, Heidelberg (2005)
Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artif. Intell. 138, 181–234 (2002)
Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, p. 267. Springer, Heidelberg (2001)
Syrjänen, T.: Lparse 1.0 User’s Manual (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calimeri, F., Ianni, G. (2005). External Sources of Computation for Answer Set Solvers. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_9
Download citation
DOI: https://doi.org/10.1007/11546207_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28538-0
Online ISBN: 978-3-540-31827-9
eBook Packages: Computer ScienceComputer Science (R0)