Computation structures
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
A combinatorial approach to temporal reasoning
JCIT Proceedings of the fifth Jerusalem conference on Information technology
Temporally distributed symptoms in technical diagnosis
Temporally distributed symptoms in technical diagnosis
Temporal reasoning and planning
Reasoning about plans
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Journal of Algorithms
Relation algebras of intervals
Artificial Intelligence
Combining qualitative and quantitative constraints in temporal reasoning
Artificial Intelligence
Satisfiability problems on intervals and unit intervals
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
The complexity of query evaluation in indefinite temporal constraint databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Twenty-one large tractable subclasses of Allen's algebra
Artificial Intelligence
A unifying approach to temporal constraint reasoning
Artificial Intelligence
Computational complexity of relating time points with interval
Artificial Intelligence
Backtracking algorithms for disjunctions of temporal constraints
Artificial Intelligence
Temporal logics for real-time system specification
ACM Computing Surveys (CSUR)
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Querying temporal and spatial constraint networks in PTIME
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast algebraic methods for interval constraint problems
Annals of Mathematics and Artificial Intelligence
Temporal Constraints: A Survey
Constraints
’’Corner‘‘ Relations in Allen‘s algebra
Constraints
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Effective Scheduling of Tasks under Weak Temporal Interval Constraints
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Extending the Point Algebra into the Qualitative Algebra
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
Eight maximal tractable subclasses of Allen's algebra with metric time
Journal of Artificial Intelligence Research
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
Determining the consistency of partial tree descriptions
Artificial Intelligence
Temporal reasoning about fuzzy intervals
Artificial Intelligence
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Maximal infinite-valued constraint languages
Theoretical Computer Science
Qualitative temporal reasoning about vague events
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Incremental tractable reasoning about qualitative temporal constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Quantifying the discord: order discrepancies in message sequence charts
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Customizing qualitative spatial and temporal calculi
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Reasoning about cardinal directions between extended objects
Artificial Intelligence
Extending partial representations of interval graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Reasoning about cardinal directions between extended objects: The NP-hardness result
Artificial Intelligence
Allen linear (interval) temporal logic – translation to LTL and monitor synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Spatiotemporal reasoning for smart homes
Designing Smart Homes
Planning temporal events using point-interval logic
Mathematical and Computer Modelling: An International Journal
Maximal infinite-valued constraint languages
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
From path-consistency to global consistency in temporal qualitative constraint networks
AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Describing disease processes using a probabilistic logic of qualitative time
Artificial Intelligence in Medicine
Hi-index | 0.01 |
Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in this algebra. When the constraints are chosen from the full Allen's algebra, this form of satisfiability problem is known to be NP-complete. However, eighteen tractable subalgebras have previously been identified; we show here that these subalgebras include all possible tractable subsets of Allen's algebra. In other words, we show that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalgebras is NP-complete. We obtain this dichotomy result by giving a new uniform description of the known maximal tractable subalgebras, and then systematically using a general algebraic technique for identifying maximal subalgebras with a given property.