Implementing backjumping by throw/1 and catch/3 of Prolog

08/21/2020
by   Włodzimierz Drabent, et al.
0

We discuss how to implement backjumping (or intelligent backtracking) in Prolog programs by means of exception handling. This seems impossible in a general case. We provide a solution, which works in certain cases, in particular for binary programs. We also provide an approximate solution, for arbitrary programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2023

Implementing backjumping by means of exception handling

We discuss how to implement backjumping (or intelligent backtracking) in...
research
12/02/2014

Expressiveness of Logic Programs under General Stable Model Semantics

The stable model semantics had been recently generalized to non-Herbrand...
research
02/24/2020

Superoptimization of WebAssembly Bytecode

Motivated by the fast adoption of WebAssembly, we propose the first func...
research
05/01/2019

Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements

We describe our experience with designing and running a matching market ...
research
06/04/2017

Visualization of Constraint Handling Rules: Semantics and Applications

The work in the paper presents an animation extension (CHR^vis) to Const...
research
07/16/2023

Deduplicating and Ranking Solution Programs for Suggesting Reference Solutions

Referring to solution programs written by other users is helpful for lea...
research
05/22/2019

Scientific Programs Imply Uncertainty. Results Expected and Unexpected

Science and engineering have requests for a wide variety of programs, bu...

Please sign up or login with your details

Forgot password? Click here to reset