Backjumping

Known as: Conflict-based backjumping, Graph-based backjumping

In backtracking algorithms, backjumping is a technique that reduces search space, therefore increasing efficiency. While backtracking always goes up…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

The available tools and support for building planning and scheduling systems and applications have been steadily improving for…

2016

Reasoning with bit-vectors arises in a variety of applications in verification and cryptography. Michel and Van Hentenryck have…

2011

In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis…

2008

Effectively Propositional Logic (EPR), also known as the Bernays-Schonfinkel class, allows encoding problems that are…

2007

Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates…

2002

Heavily optimized decision procedures for propositional modal satisfiability are now becoming available. Two systems…

1997

The binary version of the school timetabling (STT) problem is a real‐world example of a constraint network that includes only…

1997

Constraints satisfaction problems (CSP) is a well studied example of the NP-complete family which is usually solved by…

1994

Abstract. The Conﬂict directed Backjumping (CBJ) algorithm at-tempts to reduce the number of nodes visited within the…

1993

Constraint satisfaction has received great attention in recent years and a large number of algorithms have been developed…