Relation algebras and their application in temporal and spatial reasoning

DOI10.1007/s10462-004-5899-8zbMath1105.68099OpenAlexW152517204MaRDI QIDQ1781107

Ivo Duentsch

Publication date: 16 June 2005

Published in: Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10462-004-5899-8

zbMATH Keywords

relation algebraconstraint satisfactionqualitative temporal and spatial reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

Hardness of Network Satisfaction for Relation Algebras with Normal Representations ⋮ On redundant topological constraints ⋮ Unnamed Item ⋮ Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms ⋮ Representation, reasoning and similar matching for detailed topological relations with DTString ⋮ Schaefer's Theorem for Graphs ⋮ So, what exactly is a qualitative calculus? ⋮ Maximal infinite-valued constraint languages ⋮ Binary topological relations on the digital sphere ⋮ NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS ⋮ Determining the consistency of partial tree descriptions ⋮ Relational proof systems for spatial reasoning ★ ⋮ Constraint Satisfaction Problems with Infinite Templates ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom ⋮ Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals ⋮ On the complemented disk algebra

Uses Software

• RelView

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Relation algebras by games
• Relation algebras and projective geometries
• Varieties of relation algebras
• Region connection calculus: Its models and composition table
• Minimally generated Boolean algebras
• The logical systems of Lesniewski
• Small integral relation algebras generated by a partial order
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• Consistency in networks of relations
• A complete axiom system for polygonal mereotopology of the real plane
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Fast algebraic methods for interval constraint problems
• Comparing decision problems for various paradigms of algebraic logic.
• Networks of constraints: Fundamental properties and applications to picture processing
• Representations for small relation algebras
• Tractable approximations for temporal constraint handling
• On representable relation algebras
• Axiomatizability of geometry without points
• A representation theorem for Boolean contact algebras
• The representation of relational algebras
• On binary constraint problems
• Expressive power and complexity in algebraic logic
• Reasoning about temporal relations
• Expressivity in polygonal, plane mereotopology
• A finite relation algebra with undecidable network satisfaction problem
• Binary Relations and Permutation Groups
• On the calculus of relations
• Theory and Applications of Relational Structures as Knowledge Instruments
• A relation-algebraic approach to the region connection calculus
• Cylindric structures and dependencies in relational databases