REVIEW 15 cited by
Clingo = ASP + Control: Preliminary Report
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 15 Pith papers
-
Honey, I shrunk the hypothesis space (through logical preprocessing)
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.
-
Inductive general game playing
Introduces the IGGP problem and dataset from 50 GGP games, showing existing ILP systems solve at most 40% of tasks perfectly.
-
Policy-as-logic for robust reasoning over rules
A policy-as-logic pipeline, where an LLM extracts facts and an answer-set solver reasons over them, beats prompt-only and code-only baselines on objective policy benchmarks while using fewer tokens.
-
Reasonable Motion: A General ASP Foundation for Environment Constrained Movement Trajectory Computation
An ASP-based hybrid method enumerates geometrically admissible motion behaviors as stable models for environment-constrained trajectory computation in dynamic domains such as autonomous driving.
-
Visual Commonsense Driven Knowledge Refinements for Scene Graph Generation
A framework mines spatial, functional, and qualitative commonsense constraints from SGG training data and uses them to correct ranked predictions at inference, yielding consistent gains on three benchmarks.
-
Table-based Quantifier Elimination
A relational-algebra grounder called xmt-lib uses x-generators to finitely expand guarded quantified formulas over infinite domains, making Z3 competitive with ASP solvers on the DIRT benchmark.
-
Can LLMs Generate Good Stories? Insights and Challenges from a Narrative Planning Perspective
A new automatically verified benchmark shows GPT-4 tier LLMs can do small-scale causal story planning, but character intentionality and dramatic conflict remain hard except for reasoning models like o1.
-
ReasoningFlow: Semantic Structure of Complex Reasoning Traces
ReasoningFlow is a schema that labels the semantic roles and relationships in LLM reasoning traces as directed graphs, plus a small hand-annotated dataset and a pattern-query tool.
-
Counting and Reasoning with Plans
Bounded-length planning is extended from finding one plan to counting all plans and answering probabilistic and facet queries, with new complexity results and a practical tool.
-
Answer Set Programming Energised! End-to-End Neurosymbolic Reasoning and Learning with ASP and Energy Based Models
ASPEn integrates ASP stable-model semantics with energy-based models for joint discrete-continuous optimisation and end-to-end training on visual reasoning and multi-object tracking.
-
IDEA: Augmenting Design Intelligence through Design Space Exploration
IDEA combines LLM-generated constraints with Monte Carlo Tree Search over a formal design space to automate design decision-making in data storytelling and pictorial visualization.
-
Design and Results of the Second International Competition on Computational Models of Argumentation
ICCMA'17 was won by pyglaf in three tracks, argmat-sat in two, and ArgSemSAT, CoQuiAAS, and argmat-dvisat in one each.
-
Autonomous Task Completion Based on Goal-directed Answer Set Programming
An early-stage logic-programming planner using s(CASP) and dependency graph pruning is reported to cut task planning time from hours to under a second in a small simulated environment.
-
Exploring Answer Set Programming for Provenance Graph-Based Cyber Threat Detection: A Novel Approach
An ASP-based encoding of provenance graphs for cyber threat detection is proposed, but the evaluation is incomplete and the scalability claims are contradicted by the reported timing table.
-
SEF-CLGC at SemEval-2026 Task 11: Logical Notation Impact on Language Model Performance
SEF-CLGC with SLMs trained on natural and symbolic languages achieves 27.80% content score while lowering content bias on SemEval-2026 Task 11 Subtask 1.
Discussion (0). Continue with ORCID to comment.