pith. sign in

arxiv: 1405.3694 · v1 · pith:F63E533Enew · submitted 2014-05-14 · 💻 cs.PL

Clingo = ASP + Control: Preliminary Report

classification 💻 cs.PL
keywords clingoreasoningsolvingcontrolprocessprocessesprogramssolver
0
0 comments X
read the original abstract

We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinations of the grounder gringo with the solver clasp, the new clingo 4 series offers high-level constructs for realizing complex reasoning processes. Among others, such processes feature advanced forms of search, as in optimization or theory solving, or even interact 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. In fact, clingo 4 carries out such complex reasoning within a single integrated ASP grounding and solving process. This avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo 4 accomplishes this by complementing ASP's declarative input language by control capacities expressed via the embedded scripting languages lua and python. On the declarative side, clingo 4 offers a new directive that 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, viz. the scripting languages. By strictly separating logic and control programs, clingo 4 also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Honey, I shrunk the hypothesis space (through logical preprocessing)

    cs.AI 2025-06 unverdicted novelty 7.0

    A logical preprocessing step using answer set programming removes impossible rules from the ILP hypothesis space, reducing learning times from hours to seconds while preserving accuracy in visual reasoning and game domains.

  2. Inductive general game playing

    cs.AI 2019-06 unverdicted novelty 7.0

    Introduces the IGGP problem and dataset from 50 GGP games, showing existing ILP systems solve at most 40% of tasks perfectly.