Reasoning about temporal relations
From MaRDI portal
Publication:4369856
DOI10.1145/200836.200848zbMath0886.68077OpenAlexW1996011776MaRDI QIDQ4369856
Bernhard Nebel, Hans-Jürgen Bürckert
Publication date: 2 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/200836.200848
Related Items (68)
Solving multi-granularity temporal constraint networks ⋮ Disjunctions, independence, refinements ⋮ On point-based temporal disjointness ⋮ The phase transition in random horn satisfiability and its algorithmic implications ⋮ Temporal reasoning about fuzzy intervals ⋮ Modelling and solving temporal reasoning as propositional satisfiability ⋮ Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra ⋮ A tableau algorithm for description logics with concrete domains and general TBoxes ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results. ⋮ On redundant topological constraints ⋮ Processing disjunctions in temporal constraint networks ⋮ Twenty-one large tractable subclasses of Allen's algebra ⋮ Reasoning about causality between distributed nonatomic events ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ A condensed semantics for qualitative spatial reasoning about oriented straight line segments ⋮ Reasoning about cardinal directions between extended objects: the NP-hardness result ⋮ Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata ⋮ Non-dichotomies in Constraint Satisfaction Complexity ⋮ PTIME parametric verification of safety properties for reasonable linear hybrid automata ⋮ A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems ⋮ Unnamed Item ⋮ Integer programming ensemble of temporal relations classifiers ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ The complexity of equality constraint languages ⋮ Quantified Constraints in Twenty Seventeen ⋮ The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning ⋮ RCC8 binary constraint network can be consistently extended ⋮ Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class ⋮ On the consistency of cardinal direction constraints ⋮ Qualitative constraint satisfaction problems: an extended framework with landmarks ⋮ Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class ⋮ Constants and finite unary relations in qualitative constraint reasoning ⋮ Dynamic Branching in Qualitative Constraint Networks via Counting Local Models ⋮ GNet: a generalized network model and its applications in qualitative spatial reasoning ⋮ Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure ⋮ On the consistency problem for the \(\mathcal {INDU}\) calculus ⋮ Relation algebras and their application in temporal and spatial reasoning ⋮ Complexity studies of a temporal constraint propagation algorithm: a statistical analysis ⋮ Handling contingency in temporal constraint networks: from consistency to controllabilities ⋮ Reasoning about cardinal directions between extended objects ⋮ Unnamed Item ⋮ Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning ⋮ Maximal infinite-valued constraint languages ⋮ Dynamic branching in qualitative constraint-based reasoning via counting local models ⋮ Branching interval algebra: an almost complete picture ⋮ A unifying approach to temporal constraint reasoning ⋮ A Correspondence between Temporal Description Logics ⋮ Determining the consistency of partial tree descriptions ⋮ A complete classification of tractability in Allen's algebra relative to subsets of basic relations ⋮ On-line algorithms for networks of temporal constraints ⋮ A Road Map of Interval Temporal Logics and Duration Calculi ⋮ A Road Map of Interval Temporal Logics and Duration Calculi ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ A new approach to cyclic ordering of 2D orientations using ternary relation algebras ⋮ Constraint Satisfaction Problems with Infinite Templates ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ EXPtime tableaux for ALC ⋮ REASONING WITH TOPOLOGICAL AND DIRECTIONAL SPATIAL INFORMATION ⋮ Satisfying constraint sets through convex envelopes ⋮ Efficient algorithms for qualitative reasoning about time ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction ⋮ Point algebras for temporal reasoning: Algorithms and complexity ⋮ Composing cardinal direction relations ⋮ Combining interval-based temporal reasoning with general TBoxes ⋮ The complexity of constraint satisfaction problems for small relation algebras ⋮ Complexity classification in qualitative temporal constraint reasoning ⋮ Optimization in temporal qualitative constraint networks
This page was built for publication: Reasoning about temporal relations
