On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Perspectives on database theory
ACM SIGACT News
Constraint tightness and looseness versus local and global consistency
Journal of the ACM (JACM)
Qualitative simulation as a temporally-extended constraint satisfaction problem
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Solution Techniques for Constraint Satisfaction Problems: Foundations
Artificial Intelligence Review
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
STCSP – structured temporal constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Binary vs. non-binary constraints
Artificial Intelligence
On point-duration networks for temporal reasoning
Artificial Intelligence
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Distributed Configuration as Distributed Dynamic Constraint Satisfaction
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
A Constraint Directed Model for Partial Constraint Satisfaction Problems
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Boosting Search with Variable Elimination
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
On Dual Encodings for Non-binary Constraint Satisfaction Problems
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
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Dual Graph Translation of a Problem in 'Life'
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Theta-Subsumption in a Constraint Satisfaction Perspective
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
A hybrid AI approach for nurse rostering problem
Proceedings of the 2003 ACM symposium on Applied computing
Optimum tolerance design for complex assemblies using hierarchical interval constraint networks
Computers and Industrial Engineering
Interval constraint networks for tolerance analysis and synthesis
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Hard, flexible and dynamic constraint satisfaction
The Knowledge Engineering Review
Fast Theta-Subsumption with Constraint Satisfaction Algorithms
Machine Learning
A Comparison between SAT and CSP Techniques
Constraints
First results of a French linguistic development environment
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Constraint Models for the Covering Test Problem
Constraints
AND/OR search spaces for graphical models
Artificial Intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
International Journal of Computational Science and Engineering
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Search Space Reduction for Constraint Optimization Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
What Is a Real-World SAT Instance?
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Tractable reasoning in first-order knowledge bases with disjunctive information
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Search space reduction and Russian Doll search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Measuring the hardness of SAT instances
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The parameterized complexity of global constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Model-based diagnosis using structured system descriptions
Journal of Artificial Intelligence Research
Using pivot consistency to decompose and solve functional CSPS
Journal of Artificial Intelligence Research
When functional and bijective constraints make a CSP polynomial
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Dynamic heuristics for backtrack search on tree-decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the space-time trade-off in solving constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Amalgams of constraint satisfaction problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On a generalization of triangulated graphs for domains decomposition of CSPs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Coupling CSP decomposition methods and diagnosis algorithms for tree-structured systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Directed constraint networks: a relational framework for causal modeling
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Improving tree decomposition methods with function filtering
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Diagnosing tree-decomposable circuits
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Dynamic management of heuristics for solving structured CSPs
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
Efficient recognition of acyclic clustered constraint satisfaction problems
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
The polytope of tree-structured binary constraint satisfaction problems
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Concurrently decomposable constraint systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Optimal temporal decoupling in multiagent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
The Knowledge Engineering Review
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Default logic, propositional logic and constraints
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
On the consistency of general constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Towards parallel non serial dynamic programming for solving hard weighted CSP
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Utilizing knowledge-base semantics in graph-based algorithms
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Grammar factorization by tree decomposition
Computational Linguistics
Learning cluster-based structure to solve constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Topological parameters for time-space tradeoff
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
A multi-level memetic/exact hybrid algorithm for the still life problem
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
General symmetry breaking constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Conflict-Directed a* search for soft constraints
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
New structural decomposition techniques for constraint satisfaction problems
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A REVIEW OF TREE CONVEX SETS TEST
Computational Intelligence
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
The inclusion-exclusion rule and its application to the junction tree algorithm
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Expert Systems with Applications: An International Journal
Theoretical Computer Science
On rule systems whose consistency can be locally maintained
AI Communications - Intelligent Engineering Techniques for Knowledge Bases
| Hi-index | 0.00 |