Relation algebras of intervals

DOI10.1016/0004-3702(95)00042-9zbMath1506.68148OpenAlexW2055904049MaRDI QIDQ2171260

Robin Hirschl

Publication date: 23 September 2022

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

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00042-9

Mathematics Subject Classification ID

Knowledge representation (68T30) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (10)

Hardness of Network Satisfaction for Relation Algebras with Normal Representations ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Representable and diagonally representable weakening relation algebras ⋮ Algebraic foundations for qualitative calculi and networks ⋮ Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms ⋮ Constants and finite unary relations in qualitative constraint reasoning ⋮ So, what exactly is a qualitative calculus? ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Description logics with concrete domains and general concept inclusions revisited ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction

Cites Work

• Maintaining knowledge about temporal intervals
• The representation of relation algebras. II
• Varieties of relation algebras
• Temporal constraint networks
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• Algebraization of quantifier logics, an introductory overview
• On representable relation algebras
• The representation of relational algebras
• Nonfinite axiomatizability results for cylindric and relation algebras
• On binary constraint problems
• Step by step – Building representations in algebraic logic
• Boolean Algebras with Operators. Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relation algebras of intervals