Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Tractable constraints on ordered domains
Artificial Intelligence
A shorter model theory
Closure properties of constraints
Journal of the ACM (JACM)
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
Tractability and learnability arising from algebras with few subpowers
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The Complexity of Equality Constraint Languages
Theory of Computing Systems
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Quantified Positive Temporal Constraints
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Semilinear Program Feasibility
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On Random Ordering Constraints
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
On random betweenness constraints
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Distance constraint satisfaction problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On random betweenness constraints
Combinatorics, Probability and Computing
Hi-index | 0.00 |
A temporal constraint language is a set of relations that has a first-order definition in (b Q,