Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,210,369 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Algorithm
Backtracking
Boolean satisfiability problem
Constraint learning
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Bit-Vector Solver with Word-Level Propagation
Wenxi Wang
,
H. Søndergaard
,
Peter James Stuckey
Integration of AI and OR Techniques in Constraint…
2016
Corpus ID: 2491998
Reasoning with bit-vectors arises in a variety of applications in verification and cryptography. Michel and Van Hentenryck have…
Expand
2012
2012
A One-Pass Tableau-Based Workflow Verification Framework
M. Islam
,
W. MacCaull
PAAR@IJCAR
2012
Corpus ID: 17830419
Workflow management systems (WfMSs) are useful tools for supporting enterprise information systems. Such systems must ensure…
Expand
2008
2008
Deciding Effectively Propositional Logic with Equality
R. Piskac
,
L. D. de Moura
,
Nikolaj S. Bjørner
2008
Corpus ID: 14893306
Effectively Propositional Logic (EPR), also known as the Bernays-Schonfinkel class, allows encoding problems that are…
Expand
2007
2007
Climbing Depth-bounded Discrepancy Search for Solving Flexible Job Shop Scheduling Problems
Abir ben Hmida
,
Marie-José Huguet
,
P. Lopez
,
M. Haouari
2007
Corpus ID: 59870619
The Flexible Job Shop Scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation…
Expand
2007
2007
Techniques algorithmiques pour l'extraction de formules minimales inconsistantes
Cédric Piette
2007
Corpus ID: 170059355
Les travaux presentes dans cette these concernent l'extraction de formules minimales inconsistantes. Quand des formules de grande…
Expand
2006
2006
Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis
Ulrich Junker
,
Olivier Lhomme
European Conference on Artificial Intelligence
2006
Corpus ID: 2193767
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two…
Expand
2006
2006
Discussion on the Three Backjumping Schemes Existing in ADOPT-ng
M. Silaghi
,
M. Yokoo
2006
Corpus ID: 5943789
The original ADOPT-ng has three major versions, corresponding to three different classes of feedback possibilities. The first…
Expand
2004
2004
Development of a Formal Theory of Agent-Based Computing for System Evaluation and System-Design Guidance
M. Pollack
2004
Corpus ID: 108130718
Abstract : This report summarizes the research done on the DARPA-sponsored project on the Development of a Formal Theory 0 Agent…
Expand
1995
1995
Minimal Forward Checking with Backmarking
A. Kwan
,
E. Tsang
1995
Corpus ID: 17148364
The idea behind forward checking is to check forward so that a wrong decision can be detected in early stage during search and…
Expand
1992
1992
Generalised Backjumping
Peter Clark
,
R. Holte
1992
Corpus ID: 15087973
Gaschnig's backjumping algorithm has become one of the standard methods for constraint satisfaction, performing dependency…
Expand