On the public citation graph

Qualitative Temporal and Spatial Reasoning Revisited

https://doi.org/10.1093/logcom/exp025
0 signed · 52 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/1-4020-3817-8_8openalex-snapshot
The complexity of constraint satisfaction: an algebraic approach
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/978-1-4020-5587-4_4openalex-snapshot
Qualitative Spatial Reasoning Using Constraint Calculi
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_9openalex-snapshot
The Core of a Countably Categorical Structure
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_8openalex-snapshot
Constraint Satisfaction Problems with Infinite Templates
inferredcites →https://doi.org/10.1007/bf01187059openalex-snapshot
Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems
inferredcites →https://doi.org/10.1007/bf02120830openalex-snapshot
Categoricity of denumerable atomless Boolean rings
inferredcites →https://doi.org/10.1007/s00012-007-2026-0openalex-snapshot
Oligomorphic clones
inferredcites →https://doi.org/10.1007/s10462-004-5899-8openalex-snapshot
Relation Algebras and their Application in Temporal and Spatial Reasoning
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(92)90043-wopenalex-snapshot
From local to global consistency
inferredcites →https://doi.org/10.1016/0004-3702(95)00009-7openalex-snapshot
Measures of uncertainty in expert systems
inferredcites →https://doi.org/10.1016/0004-3702(95)00042-9openalex-snapshot
Relation algebras of intervals
inferredcites →https://doi.org/10.1016/0004-3702(96)80451-6openalex-snapshot
P.P. Nayak and L. Joskowicz, Efficient compositional modeling for generating causal explations
inferredcites →https://doi.org/10.1016/0012-365x(92)90282-kopenalex-snapshot
The core of a graph
inferredcites →https://doi.org/10.1016/b978-1-4832-1447-4.50034-1openalex-snapshot
Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50102-0openalex-snapshot
Spatial Reasoning with Propositional Logics
inferredcites →https://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferredcites →https://doi.org/10.1016/s0004-3702(99)00002-8openalex-snapshot
On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
inferredcites →https://doi.org/10.1016/s0304-3975(00)00177-8openalex-snapshot
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
inferredcites →https://doi.org/10.1016/s0304-3975(96)00192-2openalex-snapshot
From local to global consistency in temporal constraint networks
inferredcites →https://doi.org/10.1016/s0304-3975(97)86737-0openalex-snapshot
Local and global relational consistency
inferredcites →https://doi.org/10.1016/s1574-6526(06)80012-xopenalex-snapshot
The Complexity of Constraint Languages
inferredcites →https://doi.org/10.1093/logcom/exi083openalex-snapshot
Constraint Satisfaction with Countable Homogeneous Templates
inferredcites →https://doi.org/10.1109/lics.2007.38openalex-snapshot
Quantified Equality Constraints
inferredcites →https://doi.org/10.1111/j.1467-8640.1990.tb00130.xopenalex-snapshot
Exact and approximate reasoning about temporal relations1
inferredcites →https://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/176584.176585openalex-snapshot
On binary constraint problems
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1145/275487.275511openalex-snapshot
Conjunctive-query containment and constraint satisfaction
inferredcites →https://doi.org/10.1145/322290.322292openalex-snapshot
A Sufficient Condition for Backtrack-Free Search
inferredcites →https://doi.org/10.1613/jair.379openalex-snapshot
A Complete Classification of Tractability in RCC-5

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118601457.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-319-11206-0_20openalex-snapshot
On the Scope of Qualitative Constraint Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-22546-8_19openalex-snapshot
SOWL: A Framework for Handling Spatio-temporal Information in OWL 2.0
inferred← citeshttps://doi.org/10.1007/s13740-016-0064-5openalex-snapshot
SOWL QL: Querying Spatio-Temporal Ontologies in OWL
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.003openalex-snapshot
Constants and finite unary relations in qualitative constraint reasoning
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100604openalex-snapshot
Relation algebras of Sugihara, Belnap, Meyer, and Church
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/ictai.2012.84openalex-snapshot
An Automatic Decomposition Method for Qualitative Spatial and Temporal Reasoning
inferred← citeshttps://doi.org/10.1109/ictai.2013.18openalex-snapshot
On the Propagation Strength of SAT Encodings for Qualitative Temporal Reasoning
inferred← citeshttps://doi.org/10.1109/ieir56323.2022.10050075openalex-snapshot
The Spatio-temporal Hybrid Development Methodology for Smart IoT: A Review based Study
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470683openalex-snapshot
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property
inferred← citeshttps://doi.org/10.1137/140957378openalex-snapshot
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
inferred← citeshttps://doi.org/10.1145/3134757openalex-snapshot
Asking the Metaquestions in Constraint Tractability
inferred← citeshttps://doi.org/10.1145/3649445openalex-snapshot
A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8861openalex-snapshot
Local-to-Global Consistency Implies Tractability of Abduction
inferred← citeshttps://doi.org/10.1613/jair.5260openalex-snapshot
A Model-Theoretic View on Qualitative Constraint Reasoning
inferred← citeshttps://doi.org/10.2168/lmcs-11(4:18)2015openalex-snapshot
A finer reduction of constraint problems to digraphs
inferred← citeshttps://doi.org/10.32920/21482265openalex-snapshot
A Finer Reduction of Constraint Problems to Digraphs
inferred← citeshttps://doi.org/10.32920/21482265.v1openalex-snapshot
A Finer Reduction of Constraint Problems to Digraphs
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.