Constraint tightness and looseness versus local and global consistency

DOI10.1145/263867.263499zbMath0890.68075OpenAlexW1967597280MaRDI QIDQ4376982

Peter J. L. van Beek, Rina Dechter

Publication date: 17 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

relational consistencyconstraint loosenessconstraint tightness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (8)

Tractability in constraint satisfaction problems: a survey ⋮ The state of SAT ⋮ Discovering implied constraints in precedence graphs with alternatives ⋮ Iterative restart technique for solving timetabling problems. ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination ⋮ Constraints, consistency and closure ⋮ A Logical Approach to Constraint Satisfaction

This page was built for publication: Constraint tightness and looseness versus local and global consistency