Skip to main content
Conference ProceedingsOPEN ACCESS

Looking at separation algebras with Boolean BI-eyes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8705 LNCS 326-340
DOI: 10.1007/978-3-662-44602-7_25
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we show that the formulæ of Boolean BI cannot distinguish between some of the different notions of separation algebra found in the literature: partial commutative monoids, either cancellative or not, with a single unit or not, all define the same notion of validity. We obtain this result by the careful study of the specific properties of the counter-models that are generated by tableaux proof-search in Boolean BI. © 2014 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Larchey-Wendling, D., & Galmiche, D. (2014). Looking at separation algebras with Boolean BI-eyes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8705 LNCS, pp. 326–340). Springer Verlag. https://doi.org/10.1007/978-3-662-44602-7_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free