On tree-preserving constraints
From MaRDI portal
Publication:1688715
DOI10.1007/s10472-017-9552-zzbMath1423.68456DBLPjournals/amai/KongLLL17OpenAlexW2617557301WikidataQ62038071 ScholiaQ62038071MaRDI QIDQ1688715
Zhiguo Long, Sanjiang Li, Shufeng Kong, Yong-Ming Li
Publication date: 11 January 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/120473
Cites Work
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- Temporal constraint networks
- From local to global consistency
- Consistency in networks of relations
- Constraints, consistency and closure
- Linear-time algorithms for testing the realisability of line drawings of curved objects
- Constraint satisfaction over connected row-convex constraints
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Theoretical analysis of singleton arc consistency and its extensions
- Properties of tree convex constraints
- Efficient algorithms for singleton arc consistency
- An optimal coarse-grained arc consistency algorithm
- Second-Order Consistencies
- Path Consistency by Dual Consistency
- A Sufficient Condition for Backtrack-Free Search
- Synthesizing constraint expressions
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- On the minimality and global consistency of row-convex constraint networks
- Closure properties of constraints
- Arc consistency and friends
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: On tree-preserving constraints
