• Corpus ID: 7977544

Clingo = ASP + Control: Preliminary Report

  title={Clingo = ASP + Control: Preliminary Report},
  author={M. Gebser and Roland Kaminski and Benjamin Kaufmann and Torsten Schaub},
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… 

Figures from this paper

Multi-shot ASP solving with clingo

Clingo offers a new application programming interface that is conveniently accessible via scripting languages and abolishes the need for dedicated systems for incremental and reactive reasoning, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.

Clingcon: The next generation*

The third generation of the constraint answer set system clingcon is presented, combining Answer Set Programming (ASP) with finite domain constraint processing (CP) with a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp.

Theory Solving Made Easy with Clingo 5

This work addresses the challenge with the fifth generation of the ASP system clingo and its grounding and solving components by equipping them with well-defined generic interfaces facilitating the manifold integration efforts.

ASP Solving for Expanding Universes

This work introduces a simple approach to successively incorporating new information into ASP systems and proves its modularity as regards the addition of new information and shows its soundness and completeness.

Theory Solving made easy with Clingo 5 ( Extended Version ∗ )

This work addresses the challenge with the fifth generation of the ASP system clingo and its grounding and solving components by equipping them with well-defined generic interfaces facilitating the manifold integration efforts.

The External Interface for Extending WASP

The interface for extending the CDCL-based ASP solver wasp is presented and it is shown that it can be successfully used to extend wasp for solving effectively hard instances of both real-world and synthetic problems.

Modern constraint answer set solving

By extending CASP to reactive solving, this work opens up new application areas such as online planning with continuous domains and durations, and enhances the dedicated learning techniques of an ASP solver with the inferences of the translating approach in a lazy way.

Interactive Answer Set Programming - Preliminary Report

This work describes the interactive ASP shell aspic along with its basic functionalities, and begins with a formal characterization of interactive ASP in terms of states and operations on them.

Reasoning for Autonomous Agents in Dynamic Domains: Towards Automatic Satisfaction of the Module Property

This work developed an automatic satisfaction of the Module Property and chose topological path planning as the evaluation scenario and utilised the Region Connection Calculus as the underlying formalism of the evaluation and investigated the scalability of the implementation.

Clingo goes linear constraints over reals and integers*

This work introduces extensions to clingo with difference and linear constraints over integers and reals, respectively, and realizes them in complementary ways.



Engineering an Incremental ASP Solver

This work proposes an incremental approach to both grounding and solving in Answer Set Programming (ASP), and describes the first integrated incremental ASP system, iclingo, and provides an experimental evaluation.

ASP modulo CSP: The clingcon system

Abstract We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for

Answer Set Solving in Practice

This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems, and introduces ASP's solving technology, modeling language and methodology.

The DLV system for knowledge representation and reasoning

The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.

LUPS - A Language for Updating Logic Programs

This paper defines a language designed for specifying changes to logic programs (LUPS - "Language for dynamic updates"), and provides a translation of the sequence of update statements sets into a single generalized logic program written in a meta-language, so that the stable models of the resulting program correspond to the previously defined declarative semantics.

JASP: A Framework for Integrating Answer Set Programming with Java

A new programming framework blending ASP with Java, based on JASP, an hybrid language that transparently supports a bilateral interaction between ASP and Java, which is compliant with the JPA standard to perfectly fit extensively-adopted enterprise application technologies.

Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Extensive experimental evidence shows that DPLL(T) systems can significantly outperform the other state-of-the-art tools, frequently even in orders of magnitude, and have better scaling properties.

An Extensible SAT-solver

This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.

ActHEX: Implementing HEX Programs with Action Atoms

Besides yielding a significant increase in versatility of the framework, this paper presents illustrative application showcases and a short evaluation thereof exhibiting computational acthex strengths.