A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions
In this paper we propose an extension of Answer Set Programming (ASP) by non-Herbrand functions, i.e. functions over non-Herbrand domains. Introducing support for such functions allows for an economic and natural representation of certain kinds of knowledge that are comparatively cumbersome to represent in ASP. The key difference between our approach and other techniques for the support of non-Herbrand functions is that our extension is more “conservative” from a knowledge representation perspective. In fact, we purposefully designed the new language so that (1) the representation of relations is fully retained; (2) the representation of knowledge using non-Herbrand functions follows in a natural way from the typical ASP strategies; (3) the semantics is an extension of the the semantics of ASP from , allowing for a comparatively simple incorporation of various extensions of ASP such as weak constraints, probabilistic constructs and consistency-restoring rules.
KeywordsLogic Program Knowledge Representation Strong Negation Graph Coloring Problem Positive Program
Unable to display preview. Download preview PDF.
- 2.Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press (January 2003)Google Scholar
- 5.Buccafurri, F., Leone, N., Rullo, P.: Adding Weak Constraints to Disjunctive Datalog. In: Proceedings of the 1997 Joint Conference on Declarative Programming APPIA-GULP-PRODE (1997)Google Scholar
- 7.Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Enhancing ASP by Functions: Decidable Classes and Implementation Techniques. In: Proceedings of the Twenty-Fourth Conference on Artificial Intelligence, pp. 1666–1670 (2010)Google Scholar
- 10.Lifschitz, V.: Logic Programs with Intensional Functions (Preliminary Report). In: ICLP11 Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2011 (July 2011)Google Scholar
- 11.Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming (ICLP 1994), pp. 23–38 (1994)Google Scholar
- 12.Lin, F., Wang, Y.: Answer Set Programming with Functions. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 454–465 (2008)Google Scholar
- 14.Syrjänen, T.: Omega-Restricted Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 267–279. Springer, Heidelberg (2001)Google Scholar