Finitariness of elementary unification in Boolean region connection calculus

DOI10.1007/978-3-319-66167-4_16MaRDI QIDQ1687563zbMATH OpenOpenAlexFDO

Authors Philippe Balbiani, Çiğdem Gencer

Publication date 4 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66167-4_16

zbMATH Keywords

Boolean termscomputabilityregion connection calculusunifiability problemunification type

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational aspects of digital topology (68U03)

Recommendations

• On the complexity of Boolean unification
• Contact logic is finitary for unification with constants
• Boolean connection algebras: A new approach to the Region-Connection Calculus
• Unification in Boolean rings
• A relation-algebraic approach to the region connection calculus

Cited in

(2)

• Contact logic is finitary for unification with constants
• scientific article; zbMATH DE number 5033878 (Why is no real title available?)

This page was built for publication: Finitariness of elementary unification in Boolean region connection calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687563)