Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/25325
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | SURINX, Dimitri | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | Van Gucht, Dirk | - |
dc.date.accessioned | 2017-12-13T10:52:48Z | - |
dc.date.available | 2017-12-13T10:52:48Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, IEEE, | - |
dc.identifier.isbn | 9781509030194 | - |
dc.identifier.issn | 1043-6871 | - |
dc.identifier.uri | http://hdl.handle.net/1942/25325 | - |
dc.description.abstract | The algebra of binary relations provides union and composition as basic operators, with the empty set as neutral element for union and the identity relation as neutral element for composition. The basic algebra can be enriched with additional features. We consider the diversity relation, the full relation, intersection, set difference, projection, coprojection, converse, and transitive closure. It is customary to express boolean queries on binary relational structures as finite conjunctions of containments. We investigate which features are primitive in this setting, in the sense that omitting the feature would allow strictly less boolean queries to be expressible. Our main result is that, modulo a finite list of elementary interdependencies among the features, every feature is indeed primitive. | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.relation.ispartofseries | IEEE Symposium on Logic in Computer Science | - |
dc.rights | (c) 2017 IEEE | - |
dc.title | The primitivity of operators in the algebra of binary relations under conjunctions of containments | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | 20-23/06/2017 | - |
local.bibliographicCitation.conferencename | 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) | - |
local.bibliographicCitation.conferenceplace | Reykjavik, Iceland | - |
local.format.pages | 10 | - |
local.bibliographicCitation.jcat | C1 | - |
dc.description.notes | Surinx, D (reprint author), Hasselt Univ, Hasselt, Belgium. dimitri.surinx@uhasselt.be; jan.vandenbussche@uhasselt.be; vgucht@cs.indiana.edu | - |
local.publisher.place | New York, NY, USA | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.identifier.doi | 10.1109/LICS.2017.8005122 | - |
dc.identifier.isi | 000425849500060 | - |
local.bibliographicCitation.btitle | 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017 | - |
item.fulltext | With Fulltext | - |
item.fullcitation | SURINX, Dimitri; VAN DEN BUSSCHE, Jan & Van Gucht, Dirk (2017) The primitivity of operators in the algebra of binary relations under conjunctions of containments. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, IEEE,. | - |
item.accessRights | Open Access | - |
item.validation | ecoom 2019 | - |
item.contributor | SURINX, Dimitri | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | Van Gucht, Dirk | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
containment.pdf | Published version | 284.98 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
4
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
1
checked on May 8, 2024
Page view(s)
114
checked on Sep 7, 2022
Download(s)
218
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.