Closure properties of constraints
Journal of the ACM (JACM)
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Engineering Dynamic Scheduler for Work Manager
BT Technology Journal
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 and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
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
New Tractable Classes from Old
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Inferring Constraint Types in Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
New tractable constraint classes from old
Exploring artificial intelligence in the new millennium
New Tractable Classes From Old
Constraints
Learnability of quantified formulas
Theoretical Computer Science
Implementing a Test for Tractability
Constraints
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
Introduction to the Maximum Solution Problem
Complexity of Constraints
A note on some collapse results of valued constraints
Information Processing Letters
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The ultrametric constraint and its application to phylogenetics
Journal of Artificial Intelligence Research
Constraints, consistency and closure
Artificial Intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Soft arc consistency revisited
Artificial 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
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
On-demand conversation customization for services in large smart environments
IBM Journal of Research and Development
A new algorithm for linear and integer feasibility in horn constraints
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
The order encoding: from tractable CSP to tractable SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Typed guarded decompositions for constraint satisfaction
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Approximability of integer programming with generalised constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A simple insight into iterative belief propagation's success
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Generalised integer programming based on logically defined relations
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An efficient algorithm for a class of constraint satisfaction problems
Operations Research Letters
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
Representing and solving finite-domain constraint problems using systems of polynomials
Annals of Mathematics and Artificial Intelligence
On rule systems whose consistency can be locally maintained
AI Communications - Intelligent Engineering Techniques for Knowledge Bases
Hi-index | 0.00 |