Efficiently Coupling the I-DLV Grounder with ASP Solvers

09/28/2018
by   Francesco Calimeri, et al.
0

We present I-DLV+MS , a new Answer Set Programming (ASP) system that integrates an efficient grounder, namely I-DLV, with an automatic selector that inductively chooses a solver: depending on some inherent features of the instantiation produced by I-DLV, machine learning techniques guide the selection of the most appropriate solver. The system participated in the latest (7th) ASP competition, winning the regular track, category SP (i.e., one processor allowed). Under consideration in Theory and Practice of Logic Programming (TPLP).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2013

A Multi-Engine Approach to Answer Set Programming

Answer Set Programming (ASP) is a truly-declarative programming paradigm...
research
05/07/2014

claspfolio 2: Advances in Algorithm Selection for Answer Set Programming

To appear in Theory and Practice of Logic Programming (TPLP). Building o...
research
07/20/2023

Bounded Combinatorial Reconfiguration with Answer Set Programming

We develop an approach called bounded combinatorial reconfiguration for ...
research
04/29/2018

Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP

Conventional processor architectures are restricted in exploiting instru...
research
12/16/2015

Solving stable matching problems using answer set programming

Since the introduction of the stable marriage problem (SMP) by Gale and ...
research
04/28/2014

Preliminary Report on WASP 2.0

Answer Set Programming (ASP) is a declarative programming paradigm. The ...
research
05/05/2014

The Multi-engine ASP Solver ME-ASP: Progress Report

MEASP is a multi-engine solver for ground ASP programs. It exploits algo...

Please sign up or login with your details

Forgot password? Click here to reset