On the public citation graph
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-61551-2_82openalex-snapshot
Tractable disjunctions of linear constraints
inferredcites →https://doi.org/10.1007/3-540-64575-6_62openalex-snapshot
Distance constraint arrays: A model for reasoning on intervals with qualitative and quantitative distances
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(87)90061-0openalex-snapshot
Temporal data base management
inferredcites →https://doi.org/10.1016/0004-3702(89)90080-5openalex-snapshot
An optimal k-consistency algorithm
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(92)90043-wopenalex-snapshot
From local to global consistency
inferredcites →https://doi.org/10.1016/0004-3702(94)00016-topenalex-snapshot
Efficient algorithms for qualitative reasoning about time
inferredcites →https://doi.org/10.1016/0020-0255(74)90008-5openalex-snapshot
Networks of constraints: Fundamental properties and applications to picture processing
inferredcites →https://doi.org/10.1016/0933-3657(91)90004-uopenalex-snapshot
Temporal query processing with indefinite information
inferredcites →https://doi.org/10.1016/s0004-3702(00)00019-9openalex-snapshot
Backtracking algorithms for disjunctions of temporal constraints
inferredcites →https://doi.org/10.1016/s0004-3702(97)00009-xopenalex-snapshot
Processing disjunctions in temporal constraint networks
inferredcites →https://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferredcites →https://doi.org/10.1016/s0004-3702(98)00031-9openalex-snapshot
A unifying approach to temporal constraint reasoning
inferredcites →https://doi.org/10.1016/s0004-3702(99)00007-7openalex-snapshot
Computational complexity of relating time points with intervals
inferredcites →https://doi.org/10.1023/a:1009890709297openalex-snapshot
How to Determine the Expressive Power of Constraints
inferredcites →https://doi.org/10.1109/64.608197openalex-snapshot
Later: managing temporal information efficiently
inferredcites →https://doi.org/10.1109/time.1996.555674openalex-snapshot
Hybrid temporal reasoning for planning and scheduling
inferredcites →https://doi.org/10.1145/152947.152954openalex-snapshot
Performance of temporal reasoning systems
inferredcites →https://doi.org/10.1145/152947.152955openalex-snapshot
A metric time-point and duration-based temporal model
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1145/200836.200848openalex-snapshot
Reasoning about temporal relations
inferredcites →https://doi.org/10.1145/210346.210347openalex-snapshot
On the minimality and global consistency of row-convex constraint networks
inferredcites →https://doi.org/10.1145/263867.263499openalex-snapshot
Constraint tightness and looseness versus local and global consistency
inferredcites →https://doi.org/10.1145/322290.322292openalex-snapshot
A Sufficient Condition for Backtrack-Free Search
inferredcites →https://doi.org/10.1145/359642.359654openalex-snapshot
Synthesizing constraint expressions
inferredcites →https://doi.org/10.1613/jair.340openalex-snapshot
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time
inferredcites →https://doi.org/10.22028/d291-25003openalex-snapshot
Reasoning about temporal relations : a maximal tractable subclass of Allen's interval algebra
inferredcites →https://doi.org/10.3233/aic-1994-73-403openalex-snapshot
Temporal Reasoning in REAKT: An Environment for Real-Time Knowledge-Based Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45517-5_63openalex-snapshot
A Mixed Closure-CSP Method to Solve Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-75855-4_9openalex-snapshot
A Survey on Deep Learning Methodologies of Recent Applications
inferred← citeshttps://doi.org/10.1007/s10115-014-0778-3openalex-snapshot
Robustness, stability, recoverability, and reliability in constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.artint.2004.05.010openalex-snapshot
Complexity classification in qualitative temporal constraint reasoning
inferred← citeshttps://doi.org/10.1016/j.artint.2012.10.001openalex-snapshot
Computational complexity of linear constraints over the integers
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103780openalex-snapshot
Algorithms and complexity of difference logic
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00113-9openalex-snapshot
Efficient solution techniques for disjunctive temporal reasoning problems
inferred← citeshttps://doi.org/10.1023/a:1025894003623openalex-snapshot
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning
inferred← citeshttps://doi.org/10.1023/b:apin.0000033636.14272.95openalex-snapshot
A Mixed Closure-CSP Method for Solving Scheduling Problems
inferred← citeshttps://doi.org/10.1080/09528130600926082openalex-snapshot
Satisfying constraint sets through convex envelopes
inferred← citeshttps://doi.org/10.1093/comjnl/bxh151openalex-snapshot
Primitive Intervals versus Point-Based Intervals: Rivals or Allies?
inferred← citeshttps://doi.org/10.1109/fuzzy.2007.4295641openalex-snapshot
Fuzzy Disjunctive Temporal Problems with Classes
inferred← citeshttps://doi.org/10.1109/time.2002.1027469openalex-snapshot
Extending the point algebra into the qualitative algebra
inferred← citeshttps://doi.org/10.1109/time.2002.1027471openalex-snapshot
Representation and reasoning with disjunctive temporal constraints
inferred← citeshttps://doi.org/10.1137/s0895480102410201openalex-snapshot
Constraint Satisfaction Problems on Intervals and Lengths
inferred← citeshttps://doi.org/10.15837/ijccc.2006.2.2285openalex-snapshot
Importance of Flexibility in Manufacturing Systems
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16489openalex-snapshot
Disjunctive Temporal Problems under Structural Restrictions
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20286openalex-snapshot
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach
inferred← citeshttps://doi.org/10.21236/ada424483openalex-snapshot
Development of a Formal Theory of Agent-Based Computing for System Evaluation and System-Design Guidance
inferred← citeshttps://doi.org/10.21275/sr24315003002openalex-snapshot
The Impact of Artificial Intelligence on Medicinal Applications
inferred← citeshttps://doi.org/10.24963/kr.2020/29openalex-snapshot
Fine-Grained Complexity of Temporal Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1412.3908openalex-snapshot
Belief revision in the propositional closure of a qualitative algebra
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.