Abstract
AbstractWe introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP systemclingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities.clingoaccomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end,clingooffers a new application programming interface that is conveniently accessible via scripting languages. By strictly separating logic and control,clingoalso abolishes the need for dedicated systems for incremental and reactive reasoning, likeiclingoandoclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference61 articles.
1. Gebser M. , Kaufmann B. , Otero R. , Romero J. , Schaub T. and Wanko P. 2013. Domain-specific heuristics in answer set programming. In Proc. of the 27th National Conference on Artificial Intelligence (AAAI'13), M. desJardins and M. Littman , Eds. AAAI Press, 350–356.
2. Gebser M. , Kaminski R. , Obermeier P. and Schaub T. 2015. Ricochet robots reloaded: A case-study in multi-shot ASP solving. In Proc. of Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation: Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, T. Eiter , H. Strass , M. Truszczyński , and S. Woltran , Eds. Lecture Notes in Artificial Intelligence, vol. 9060. Springer-Verlag, 17–32.
3. Delgrande J. , Schaub T. , Tompits H. and Woltran S. 2009. Merging logic programs under answer set semantics. In Proc. of the 25th International Conference on Logic Programming (ICLP'09), P. Hill and D. Warren , Eds. Lecture Notes in Computer Science, vol. 5649. Springer-Verlag, 160–174.
4. Gebser M. , Kaminski R. , Kaufmann B. , Ostrowski M. , Schaub T. and Wanko P. 2016. Theory solving made easy with clingo 5. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP'16), M. Carro and A. King , Eds., Open Access Series in Informatics (OASIcs), vol. 52, 2:1–2:15.
5. Gebser M. , Jost H. , Kaminski R. , Obermeier P. , Sabuncu O. , Schaub T. and Schneider M. 2013. Ricochet robots: A transverse ASP benchmark. In. Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13). Cabalar P. and Son T. , Eds. Lecture Notes in Artificial Intelligence, vol. 8148. Springer-Verlag, 348–360.
Cited by
134 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献