moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming

Sabuncu, Orkunt; Leite, João

doi:10.1007/978-3-319-61660-5_30

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, it is interesting future work to investigate how dedicated change operations that were so far only of theoretic interest, like updating (Alferes et al 2002), forgetting (Zhang and Foo 2006), revising (Delgrande et al 2008), or merging (Delgrande et al 2009) etc., can be put into practice within this framework. A first attempt at capturing the update of logic programs was made by Sabuncu and Leite (2017).…”

Section: Resultsmentioning

confidence: 99%

Multi-shot ASP solving with clingo

Gebser

Kaminski

Kaufmann

et al. 2018

Theory and Practice of Logic Programming

234

198

View full text Add to dashboard Cite

We 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.

show abstract