Pushing the Limits of Clingo’s Incremental Grounding and Solving Capabilities in Practical Applications

Author:

Balduccini Marcello12,Barborak Michael1,Ferrucci David1

Affiliation:

1. Elemental Cognition, Inc., New York, NY 10169, USA

2. Department of Decision & System Sciences, Erivan K. Haub School of Business, Saint Joseph’s University, Philadelphia, PA 19131, USA

Abstract

Incremental techniques aim at making it possible to improve the performance of the grounding and solving processes by reusing the results of previous executions. Clingo supports both incremental grounding and incremental solving computations. In order to leverage incremental computations in clingo, the incremental fragments of ASP programs must satisfy certain safety-related conditions. In a number of problem domains and reasoning tasks, these conditions can be satisfied in a fairly straightforward way. However, we have observed that in certain practical applications, satisfying the conditions becomes more challenging, to the point that it is sometimes unclear how or even if it is possible to leverage incremental computations. In this paper, we report our findings, and ultimate success, with the use of incremental grounding and solving techniques in one of these challenging cases. We describe the domain, which is linked to a large practical application, discuss the challenges we faced in attempting to leverage incremental computations, and then describe the techniques that we developed, in particular at the level of methods for encoding the domain knowledge and of algorithms supporting the intended interleaving of grounding and solving. We believe that our findings may provide valuable information to practitioners facing similar challenges and ultimately increase the adoption of clingo’s incremental capabilities for complex practical applications.

Publisher

MDPI AG

Subject

Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science

Reference31 articles.

1. Classical Negation in Logic Programs and Disjunctive Databases;Gelfond;New Gener. Comput.,1991

2. Marek, V.W., and Truszczynski, M. (1999). The Logic Programming Paradigm: A 25-Year Perspective, Springer.

3. Industrial Applications of Answer Set Programming;Falkner;KI–Kunstl. Intell.,2018

4. Answer Set Based Design of Knowledge Systems;Balduccini;Ann. Math. Artif. Intell.,2006

5. Gebser, M., Kaufmann, B., Neumann, A., and Schaub, T. (2007, January 6–12). Conflict-Driven Answer Set Solving. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI’07), Hyderabad, India.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3