Published on Fri Dec 20 2013

Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration

Marcello Balduccini, Yulia Lierler

CASP languages and systems proved to be largely successful at providing efficient solutions to problems involving hybrid reasoning tasks. Yet, the development of CASP systems is difficult, requiring non-trivial expertise in multiple areas.

0
0
0
Abstract

Recently, researchers in answer set programming and constraint programming spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming (CASP). CASP languages and systems proved to be largely successful at providing efficient solutions to problems involving hybrid reasoning tasks, such as scheduling problems with elements of planning. Yet, the development of CASP systems is difficult, requiring non-trivial expertise in multiple areas. This suggests a need for a study identifying general development principles of hybrid systems. Once these principles and their implications are well understood, the development of hybrid languages and systems may become a well-established and well-understood routine process. As a step in this direction, in this paper we conduct a case study aimed at evaluating various integration schemas of CASP methods.

Tue Feb 14 2017
Artificial Intelligence
Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter
This paper is the first comprehensive account of the constraint answer set language and solver EZCSP. We also develop an extension of the transition systems proposed by Nieuwenhuis et al. in 2006 to capture Boolean Satisfiability solvers.
0
0
0
Fri May 12 2017
Artificial Intelligence
Clingcon: The Next Generation
We present the third generation of the constraint answer set system clingcon. It combines Answer Set Programming (ASP) with finite domain constraint processing (CP) While its predecessors rely on a black-box approach to hybrid solving, the new clingcon system pursues a lazy approach.
0
0
0
Wed May 14 2014
Artificial Intelligence
The Design of the Fifth Answer Set Programming Competition
The Fifth ASP Competition will be held in Vienna, Austria. It will be the largest event of its kind in the history of logic programming. It features a completely re designed setup, with novelties involving the design of tracks.
0
0
0
Thu Jan 10 2013
Artificial Intelligence
Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary
This volume contains the papers presented at the fifth workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) held on September 4th, 2012 in Budapest.
0
0
0
Fri Oct 05 2012
Artificial Intelligence
Conflict-driven ASP Solving with External Sources
Question Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. HEX-programs extend programs with external atoms, which allow for a bidirectional communication between the logic program and external sources of computation.
0
0
0
Wed May 07 2014
Artificial Intelligence
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Claspfolio 2 is a modular and open solver architecture that integrates several different algorithm selection approaches and techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features.
0
0
0