Efficient Incremental Modelling and Solving

09/23/2020
by   Gökberk Koçak, et al.
0

In various scenarios, a single phase of modelling and solving is either not sufficient or not feasible to solve the problem at hand. A standard approach to solving AI planning problems, for example, is to incrementally extend the planning horizon and solve the problem of trying to find a plan of a particular length. Indeed, any optimization problem can be solved as a sequence of decision problems in which the objective value is incrementally updated. Another example is constraint dominance programming (CDP), in which search is organized into a sequence of levels. The contribution of this work is to enable a native interaction between SAT solvers and the automated modelling system Savile Row to support efficient incremental modelling and solving. This allows adding new decision variables, posting new constraints and removing existing constraints (via assumptions) between incremental steps. Two additional benefits of the native coupling of modelling and solving are the ability to retain learned information between SAT solver calls and to enable SAT assumptions, further improving flexibility and efficiency. Experiments on one optimisation problem and five pattern mining tasks demonstrate that the native interaction between the modelling system and SAT solver consistently improves performance significantly.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2011

Solving Rubik's Cube Using SAT Solvers

Rubik's Cube is an easily-understood puzzle, which is originally called ...
research
05/28/2014

Conformant Planning as a Case Study of Incremental QBF Solving

We consider planning with uncertainty in the initial state as a case stu...
research
03/06/2019

Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution)

Many modern-day solvers offer functionality for incremental SAT solving,...
research
10/22/2021

REACH: Refining Alloy Scenarios by Scope

Writing declarative models has numerous benefits, ranging from automated...
research
02/12/2018

Unbounded Software Model Checking with Incremental SAT-Solving

This paper describes a novel unbounded software model checking approach ...
research
08/18/2021

Analogical Learning in Tactical Decision Games

Tactical Decision Games (TDGs) are military conflict scenarios presented...
research
12/04/2012

An Empirical Evaluation of Portfolios Approaches for solving CSPs

Recent research in areas such as SAT solving and Integer Linear Programm...

Please sign up or login with your details

Forgot password? Click here to reset