Algebraic foundations for qualitative calculi and networks
DOI10.1016/j.tcs.2019.02.033zbMath1417.68160arXiv1606.09140OpenAlexW2962936384WikidataQ128265980 ScholiaQ128265980MaRDI QIDQ1733063
Tomasz Kowalski, Marcel Jackson, Robin Hirschl
Publication date: 26 March 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.09140
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Relation algebras by games
- Necessary subalgebras of simple nonintegral semiassociative relation algebras
- Combinatorial aspects of relations
- Relation algebras
- Relation algebras of intervals
- RCC8 binary constraint network can be consistently extended
- Representations of integral relation algebras
- Combining qualitative and quantitative constraints in temporal reasoning
- Representability is not decidable for finite relation algebras
- A finer reduction of constraint problems to digraphs
- Weak Composition for Qualitative Spatial and Temporal Reasoning
- Some Recent Results in Metric Temporal Logic
- A Canonical Model of the Region Connection Calculus
- Some Varieties Containing Relation Algebras
- On binary constraint problems
- A finite relation algebra with undecidable network satisfaction problem
- On the calculus of relations
- Boolean Algebras with Operators. Part I
- A relation-algebraic approach to the region connection calculus
This page was built for publication: Algebraic foundations for qualitative calculi and networks