# Relation Algebras and their Application in Temporal and Spatial Reasoning

@article{Dntsch2004RelationAA, title={Relation Algebras and their Application in Temporal and Spatial Reasoning}, author={Ivo D{\"u}ntsch}, journal={Artificial Intelligence Review}, year={2004}, volume={23}, pages={315-357} }

Qualitative temporal and spatial reasoning is in many cases based on binary relations such as before, after, starts, contains, contact, part of, and others derived from these by relational operators. The calculus of relation algebras is an equational formalism; it tells us which relations must exist, given several basic operations, such as Boolean operations on relations, relational composition and converse. Each equation in the calculus corresponds to a theorem, and, for a situation where… Expand

#### Figures, Tables, and Topics from this paper

#### 75 Citations

On the complemented disk algebra

- Computer Science, Mathematics
- J. Log. Algebraic Methods Program.
- 2006

This paper will provide a general method for generating representations of this complemented disk algebra in the framework of Region Connection Calculus, in particular, connected regions bounded by Jordan curves and their complements is also such a representation. Expand

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

- Mathematics
- 2013

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of… Expand

Qualitative Temporal and Spatial Reasoning Revisited

- Mathematics, Computer Science
- CSL
- 2007

This paper studies the "local-to-global" property by making use of a recently established connection of this property with universal algebra and shows that this property is equivalent to the presence of a so-called quasi near-unanimity polymorphism of the constraint language. Expand

Qualitative Temporal and Spatial Reasoning Revisited

- Mathematics, Computer Science
- J. Log. Comput.
- 2009

This article studies the ‘local-to-global’ property by making use of a recently established connection of this property with universal algebra and shows that this property is equivalent to the presence of a so-called quasi near-unanimity (QNU) polymorphism of the constraint language. Expand

So, what exactly is a qualitative calculus?

- Computer Science, Mathematics
- Artif. Intell.
- 2020

The relation-type qualitative calculus unifying the intensional and extensional approaches is defined by introducing the notions of weak identity, inference completeness and Q-homomorphism, and it is shown that “algebras generated by JEPD relations” and “qualitatively representable NAs” are embedded into the class of relation- type qualitative algebra. Expand

On redundant topological constraints

- Mathematics, Computer Science
- Artif. Intell.
- 2015

If S is a tractable subclass in which weak composition distributes over non-empty intersections, then Γ has a unique prime network, which is obtained by removing all redundant constraints from Γ, and this paper identifies a sufficient condition for a path-consistent network being minimal. Expand

Qualitative Spatial Reasoning about Relative Orientation - A Question of Consistency

- Computer Science, Mathematics
- 2012

A new approach is introduced for calculating the composition table for DRAf using condensed semantics, that performs far better than algebraic closure, and investigates morphisms between qualitative spatial calculi. Expand

Relations Between Spatial Calculi About Directions and Orientations (Extended Abstract)

- Geology, Computer Science
- IJCAI
- 2017

This work considers notions of qualitative constraint calculus, of homomorphism between calculi, and of quotient of calculi and derives important properties for spatial calculi from corresponding properties of related calculi. Expand

An Algebra of Qualitative Taxonomical Relations for Ontology Alignments

- Computer Science
- SEMWEB
- 2015

A new algebra of relations is introduced, which, first, solves the limitation of the previous one, and second, incorporates all qualitative taxonomical relations that occur between individuals and concepts, including the relations "is a" and "is not". Expand

An algebra of qualitative taxonomical relations for ontology alignments

- 2019

Algebras of relations were shown useful in managing ontology alignments. They make it possible to aggregate alignments disjunctively or conjunctively and to propagate alignments within a network of… Expand

#### References

SHOWING 1-10 OF 131 REFERENCES

Relational reasoning in the region connection calculus

- Computer Science, Mathematics
- ArXiv
- 2005

It is shown that the contact relation algebra (CRA) of certain RCC model is not atomic complete and hence infinite, so in general an extensional composition table for the RCC cannot be obtained by simply refining the R CC8 relations. Expand

Decision problems for equational theories of relation algebras

- Computer Science, Mathematics
- Memoirs of the American Mathematical Society
- 1997

In 1942, Tarski proved that all of classical mathematics could be developed within the framework of the equational theory of relation algebras first-order theories that are strong enough to form a basis for the development of mathematics, in particular, set theories and number theories. Expand

Relation Algebras for Reasoning about Time and Space

- Mathematics, Computer Science
- AMAST
- 1993

It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras. Expand

Relation algebras over containers and surfaces: An ontological study of a room space

- Mathematics, Computer Science
- Spatial Cogn. Comput.
- 1999

This work derives an algebra related to the fundamentals of containers and surfaces and shows that this container-surface algebra holds all properties of Tarski's relation algebra, except for the associativity. Expand

THE REPRESENTATION OF RELATIONAL ALGEBRAS

- Mathematics
- 1950

?1. Summary A family of binary relations, or sets of ordered pairs, which is a boolean algebra, which is closed under the operations of forming converses and relative products, and which contains an… Expand

Qualitative Spatial Reasoning: Cardinal Directions as an Example

- Mathematics, Computer Science
- Int. J. Geogr. Inf. Sci.
- 1996

Addressing a subset of the total problem, namely reasoning with cardinal directions, a completely qualitative method, without recourse to analytical procedures, is introduced and a method for its formal comparison with quantitative formula is defined. Expand

Algebraic approach to spatial reasoning

- Mathematics, Computer Science
- Int. J. Geogr. Inf. Sci.
- 1992

A relation algebra for these topological relations is developed and a computational implementation of this algebra is described, which could be usefully incorporated into geographical information systems and related systems. Expand

A relation - algebraic approach to the region connection calculus

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2001

It is proved that a refined version of the RCC5 table has as models all atomless Boolean algebras B with the natural ordering as the “part-of” relation, and that the table is closed under first-order definable relations iff B is homogeneous. Expand

Introductory course on relation algebras, finite-dimensional cylindric algebras, and their interc

- Mathematics
- 1990

These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections, delivered at the Conference on Alge-Relation algebras (RA's) are closely… Expand

Spatial Reasoning with Propositional Logics

- Computer Science
- KR
- 1994

By encoding spatial relationships in a propositional representation automated reasoning becomes more effective, and specifies representations in both classical and intuitionistic propositional logic, which provide for efficient reasoning about a large class of spatial relations. Expand