Backjumping is Exception Handling

08/11/2020
by   Ed Robbins, et al.
0

ISO Prolog provides catch and throw to realise the control flow of exception handling. This pearl demonstrates that catch and throw are inconspicuously amenable to the implementation of backjumping. In fact, they have precisely the semantics required: rewinding the search to a specific point, and carrying of a preserved term to that point. The utility of these properties is demonstrated through an implementation of graph colouring with backjumping and a backjumping SAT solver that applies Conflict Driven Clause Learning.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

10/07/2009

Integrating Conflict Driven Clause Learning to Local Search

This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid appro...
07/27/2021

On Improving the Backjump Level in PB Solvers

Current PB solvers implement many techniques inspired by the CDCL archit...
02/18/2014

Concurrent Cube-and-Conquer

Recent work introduced the cube-and-conquer technique to solve hard SAT ...
03/04/2020

Towards a Complexity-theoretic Understanding of Restarts in SAT solvers

Restarts are a widely-used class of techniques integral to the efficienc...
02/06/2019

Semantics-Preserving DPO-Based Term Graph Rewriting

Term graph rewriting is important as "conceptual implementation" of the ...
05/14/2014

Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R

In computational cognitive science, the cognitive architecture ACT-R is ...
10/31/2018

Exceptionally Monadic Error Handling

We notice that the type of src_haskellcatch :: c a -> (e -> c a) -> c a ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.