Reasoning about operations on sets

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The present paper is about a framework of formal topological reasoning originating from the fundamental work of Moss and Parikh relating to this. We add a set of unary operators involving sets to that system. This new means of expression gives us considerably more expressive power with regard to spatial operations, but the accompanying logic remains sound and semantically complete with respect to the class of all subset spaces that are enriched accordingly. Moreover, the new logic turns out to be decidable. We prove these results by relying heavily on a particular extension of the common modal formalism, viz hybrid logic. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Heinemann, B. (2007). Reasoning about operations on sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4509 LNAI, pp. 308–319). Springer Verlag. https://doi.org/10.1007/978-3-540-72665-4_27

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