A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Comments on Mohr and Henderson's path consistency algorithm
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
From local to global consistency
Artificial Intelligence
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Fast parallel constraint satisfaction
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Constraint tightness and looseness versus local and global consistency
Journal of the ACM (JACM)
A generic customizable framework for inverse local consistency
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Functional elimination and 0/1/All constraints
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Solving multi-granularity temporal constraint networks
Artificial Intelligence
Disjunctions, independence, refinements
Artificial Intelligence
Combining Constraints and Consistency Techniques in Knowledge-Based Expert Systems
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Interactive Modeling for Batch Simulation of Engineering Systems: A Constraint Satisfaction Problem
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Arc Consistency on n-ary Monotonic and Linear Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
New Tractable Classes from Old
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Characterizing SAT Problems with the Row Convexity Property
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Consistency and set intersection
Eighteenth national conference on Artificial intelligence
Incrementally solving functional constraints
Eighteenth national conference on Artificial intelligence
New tractable constraint classes from old
Exploring artificial intelligence in the new millennium
New Tractable Classes From Old
Constraints
A Comparison between SAT and CSP Techniques
Constraints
Implementing a Test for Tractability
Constraints
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
An associate constraint network approach to extract multi-lingual information for crime analysis
Decision Support Systems
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Properties of tree convex constraints
Artificial Intelligence
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
Solving connected row convex constraints by variable elimination
Artificial Intelligence
Inverse Consistencies for Non-binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Tractable tree convex constraint networks
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Simple randomized algorithms for tractable row and tree convex constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
Set intersection and consistency in constraint networks
Journal of Artificial Intelligence Research
Fast algorithm for connected row convex constraints
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Consistency and set intersection
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Constraints, consistency and closure
Artificial Intelligence
Making bound consistency as effective as arc consistency
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A graph based backtracking algorithm for solving general CSPs
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Extracting microstructure in binary constraint networks
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Probabilistic logic with strong independence
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
On the tractability of smooth constraint satisfaction problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) find a solution that satisfies the constraints and (ii) find the corresponding minimal network where the constraints are as explicit as possible. Both tasks are known to be NP-complete in the general case. Task (1) is usually solved using a backtracking algorithm, and task (ii) is often solved only approximately by enforcing various levels of local consistency. In this paper, we identify a property of binary constraint called row convexity and show its usefulness in deciding when a form of local consistency called path consistency is sufficient to guarantee that a network is both minimal and globally consistent. Globally consistent networks have the property that a solution can be found without backtracking. We show that one can test for the row convexity property efficiently and we show, by examining applications of constraint networks discussed in the literature, that our results are useful in practice. Thus, we identify a class of binary constraint networks for which we can solve both tasks (i) and (ii) efficiently. Finally, we generalize the results for binary constraint networks to networks with nonbinary constraints.