A new tractable class of constraint satisfaction problems
type: Item
instance of: scholarly article
title: A new tractable class of constraint satisfaction problems
zbMATH Open document ID: 1075.68082
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2005-05-20T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 2170152
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: complexity
zbMATH Keywords: para-primal algebra
zbMATH Keywords: para-primal problems
author: Víctor Dalmau
MaRDI profile type: Publication
full work available at URL: s10472-005-1810-9
OpenAlex ID: W2155002729
cites work: Combinatorial problems raised from 2-semilattices
cites work: Q4407431
cites work: Q2754150
cites work: Para primal algebras
cites work: Plain para primal algebras
cites work: The complexity of theorem-proving procedures
cites work: Characterising tractable constraints
cites work: Learnability of quantified formulas.
cites work: Q4495111
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: A sufficient condition for backtrack-bounded search
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: On the complexity of H-coloring
cites work: On the algebraic structure of combinatorial problems
cites work: Constraints, consistency and closure
cites work: Closure properties of constraints
cites work: Tractable constraints on ordered domains
cites work: Fast parallel constraint satisfaction
cites work: Consistency in networks of relations
cites work: Q3666906
cites work: Homogeneous operations and homogeneous algebras
cites work: Q3751631
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Constraint relaxation may be perfect
cites work: The complexity of satisfiability problems
cites work: Q3739181
cites work: On the minimality and global consistency of row-convex constraint networks
cites work: A generic arc-consistency algorithm and its specializations
DOI: 10.1007/S10472-005-1810-9
description: scientific article; zbMATH DE number 2170152