Value ordering for quantified CSPs
type: Item
instance of: scholarly article
title: Value ordering for quantified CSPs
zbMATH Open document ID: 1191.68642
author: David Stynes
author: Kenneth N. Brown
published in: Constraints
publication date: 2009-05-29T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5559833
zbMATH Keywords: value ordering
zbMATH Keywords: quantified CSPs
zbMATH Keywords: backtracking search
MaRDI profile type: Publication
full work available at URL: s10601-008-9052-1
OpenAlex ID: W2098817723
cites work: Reusing CSP Propagators for QCSPs
cites work: BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
cites work: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
cites work: Identifying and exploiting problem structures using explanation-based constraint programming
cites work: Backjumping for quantified Boolean logic satisfiability
cites work: The impact of search heuristics on heavy-tailed behaviour
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Consistency for Quantified Constraint Satisfaction Problems
cites work: Q5802493
DOI: 10.1007/S10601-008-9052-1
description: scientific article; zbMATH DE number 5559833