Skip to main content Accessibility help

ASP with non-herbrand partial functions: a language and system for practical use



Dealing with domains involving substantial quantitative information in Answer Set Programming (ASP) often results in cumbersome and inefficient encodings. Hybrid “CASP” languages combining ASP and Constraint Programming aim to overcome this limitation, but also impose inconvenient constraints – first and foremost that quantitative information must be encoded by means of total functions. This goes against central knowledge representation principles that contribute to the power of ASP, and makes the formalization of certain domains difficult. ASP{f} is being developed with the ultimate goal of providing scientists and practitioners with an alternative to CASP languages that allows for the efficient representation of qualitative and quantitative information in ASP without restricting one's ability to deal with incompleteness or uncertainty. In this paper we present the latest outcome of such research: versions of the language and of the supporting system that allow for practical, industrial-size use and scalability. The applicability of ASP{f} is demonstrated by a case study on an actual industrial application.



Hide All
Balduccini, M. 2009. Representing constraint satisfaction problems in answer set programming. In ICLP09 Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP09).
Balduccini, M. 2012a. Answer set solving and non-herbrand functions. In Proceedings of the 14th International Workshop on Non-Monotonic Reasoning (NMR'2012), Rosati, R. and Woltran, S., Eds.
Balduccini, M. 2012b. Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz. Lecture Notes in Artificial Intelligence (LNCS). Springer Verlag, Berlin, Chapter 3. A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions, 2339.
Cabalar, P. 2011. Functional Answer Set Programming. Journal of Theory and Practice of Logic Programming (TPLP) 11, 203234.
Gebser, M., Kaminski, R., Ostrowski, M., Schaub, T. and Thiele, S. 2009. On the input language of ASP grounder gringo. In 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR09), Erdem, E., Lin, F. and Schaub, T., Eds. Lecture Notes in Artificial Intelligence (LNCS), vol. 5753. Springer Verlag, Berlin, 502508.
Gebser, M., Kaufmann, B., Neumann, A. and Schaub, T. 2007. Conflict-driven answer set solving. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), Veloso, M. M., Ed. 386392.
Gebser, M., Ostrowski, M. and Schaub, T. 2009. Constraint Answer Set Solving. In 25th International Conference on Logic Programming (ICLP09). Vol. 5649.
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365385.
Lierler, Y. 2012. On the relation of constraint answer set programming languages and algorithms. In Proceedings of the 26th Conference on Artificial Intelligence (AAAI'12). MIT Press.
Lifschitz, V. and Turner, H. 1994. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming (ICLP94). 23–38.
Lin, F. and Wang, Y. 2008. Answer set programming with functions. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR2008). 454–465.
Marek, V. W. and Truszczynski, M. 1999. The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag, Berlin, Chapter Stable Models and an Alternative Logic Programming Paradigm, 375398.
Syrjänen, T. 1998. Implementation of logical grounding for logic programs with stable model semantics. Tech. Rep. 18, Digital Systems Laboratory, Helsinki University of Technology.


Type Description Title
Supplementary materials

Balduccini supplementary material
Balduccini supplementary material

 PDF (48 KB)
48 KB

ASP with non-herbrand partial functions: a language and system for practical use



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed