Backjump-based backtracking for constraint satisfaction problems
type: Item
instance of: scholarly article
title: Backjump-based backtracking for constraint satisfaction problems
zbMATH Open document ID: 0995.68102
DOI: 10.1016/S0004-3702(02)00120-0
author: Daniel Frost
author: Rina Dechter
published in: Artificial Intelligence
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1768253
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: backtracking
zbMATH Keywords: backjumping
zbMATH Keywords: learning
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Using constraint metaknowledge to reduce arc consistency computation
cites work: Backtrack programming techniques
cites work: Q4012216
cites work: Conflict-directed backjumping revisited
cites work: An optimal k-consistency algorithm
cites work: A machine program for theorem-proving
cites work: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Tree clustering for constraint networks
cites work: Local and global relational consistency
cites work: Q3883524
cites work: Synthesizing constraint expressions
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Q4198056
cites work: Q4386920
cites work: Backtrack Programming
cites work: Q5687246
cites work: A theoretical evaluation of selected backtracking algorithms.
cites work: A language and a program for stating and solving combinatorial problems
cites work: Consistency in networks of relations
cites work: GRASP: a search algorithm for propositional satisfiability
cites work: Q4254883
cites work: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
cites work: Solution techniques for constraint satisfaction problems: Advanced approaches
cites work: Solution techniques for constraint satisfaction problems: Foundations
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q3856120
cites work: Arc consistency for factorable relations.
cites work: Q4473036
cites work: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
cites work: A generic arc-consistency algorithm and its specializations
full work available at URL: s0004-3702(02)00120-0
OpenAlex ID: W2021700650
description: scientific article; zbMATH DE number 1768253