![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Gabriel M. Kuper
Person information
- affiliation: University of Trento, Italy
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i4]Simone Bocca
, Alessio Zamboni, Gábor Bella, Yamini Chandrashekar, Mayukh Bagchi, Gabriel M. Kuper, Paolo Bouquet, Fausto Giunchiglia:
Building Interoperable Electronic Health Records as Purpose-Driven Knowledge Graphs. CoRR abs/2305.06088 (2023)
2010 – 2019
- 2016
- [j17]Mathew Joseph, Gabriel M. Kuper, Till Mossakowski
, Luciano Serafini:
Query answering over contextualized RDF/OWL knowledge with forall-existential bridge rules: Decidable finite extension classes. Semantic Web 7(1): 25-61 (2016) - 2015
- [i3]Mathew Joseph, Gabriel M. Kuper, Till Mossakowski, Luciano Serafini:
Query Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Decidable Finite Extension Classes (Post Print). CoRR abs/1512.03899 (2015) - 2014
- [c35]Mathew Joseph, Gabriel M. Kuper, Luciano Serafini:
Query Answering over Contextualized RDF Knowledge with Forall-Existential Bridge Rules: Attaining Decidability Using Acyclicity. CILC 2014: 210-224 - [c34]Mathew Joseph, Gabriel M. Kuper, Luciano Serafini:
Query Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Attaining Decidability Using Acyclicity. RR 2014: 60-75 - [i2]Mathew Joseph, Gabriel M. Kuper, Luciano Serafini:
Query Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Attaining Decidability using Acyclicity (full version). CoRR abs/1406.0893 (2014) - 2011
- [j16]Foto N. Afrati, Sara Cohen
, Gabriel M. Kuper:
On the complexity of tree pattern containment with arithmetic comparisons. Inf. Process. Lett. 111(15): 754-760 (2011)
2000 – 2009
- 2009
- [j15]Gabriel M. Kuper, Fabio Massacci
, Nataliya Rassadko:
Generalized XML security views. Int. J. Inf. Sec. 8(3): 173-203 (2009) - 2007
- [j14]Gabriel M. Kuper, Jianwen Su:
A representation independent language for planar spatial databases with Euclidean distance. J. Comput. Syst. Sci. 73(6): 845-874 (2007) - [j13]Bart Kuijpers
, Gabriel M. Kuper, Jan Paredaens, Luc Vandeurzen:
First-Order Languages Expressing Constructible Spatial Database Queries. SIAM J. Comput. 36(6): 1570-1599 (2007) - 2005
- [j12]Michael Benedikt
, Wenfei Fan
, Gabriel M. Kuper:
Structural properties of XPath fragments. Theor. Comput. Sci. 336(1): 3-31 (2005) - [c33]Gabriel M. Kuper, Fabio Massacci
, Nataliya Rassadko:
Generalized XML security views. SACMAT 2005: 77-84 - [c32]Paolo Bouquet, Gabriel M. Kuper, Stefano Zanobini:
Asking and Answering Queries Semantically. WOA 2005: 22-27 - 2004
- [c31]Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenko, Ilya Zaihrayeu:
A Distributed Algorithm for Robust Data Sharing and Updates in P2P Database Networks. EDBT Workshops 2004: 446-455 - [c30]Ashwin Gumaste, Gabriel M. Kuper, Imrich Chlamtac:
Optimizing light-trail assignment to WDM networks for dynamic IP centric traffic. LANMAN 2004: 113-118 - [c29]Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenko, Ilya Zaihrayeu:
The coDB Robust Peer-to-Peer Database System. SEBD 2004: 382-393 - [c28]Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenko, Ilya Zaihrayeu:
Queries and Updates in the coDB Peer to Peer Database System. VLDB 2004: 1277-1280 - 2003
- [j11]Jan Chomicki, Dina Q. Goldin, Gabriel M. Kuper, David Toman:
Variable Independence in Constraint Databases. IEEE Trans. Knowl. Data Eng. 15(6): 1422-1436 (2003) - [c27]Serge Abiteboul, Gabriel M. Kuper, Alexander A. Shvartsman, Moshe Y. Vardi:
In Memoriam: Paris C. Kanellakis. PCK50 2003: 1-8 - [c26]Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenko, Luciano Serafini:
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems. DBISP2P 2003: 64-76 - [c25]Michael Benedikt, Wenfei Fan
, Gabriel M. Kuper:
Structural Properties of XPath Fragments. ICDT 2003: 79-95 - [i1]Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenko, Luciano Serafini:
A Robust and Computational Characterisation of Peer-to-Peer Database Systems. CoRR cs.DC/0308013 (2003) - 2002
- [j10]Wenfei Fan
, Gabriel M. Kuper, Jérôme Siméon:
A unified constraint model for XML. Comput. Networks 39(5): 489-505 (2002) - 2001
- [j9]Stavros S. Cosmadakis
, Gabriel M. Kuper, Leonid Libkin:
On the orthographic dimension of definable sets. Inf. Process. Lett. 79(3): 141-145 (2001) - [c24]Gabriel M. Kuper, Jérôme Siméon:
Subsumption for XML types. ICDT 2001: 331-345 - [c23]Wenfei Fan
, Gabriel M. Kuper, Jérôme Siméon:
A unified constraint model for XML. WWW 2001: 179-190 - 2000
- [p4]Gabriel M. Kuper, Leonid Libkin, Jan Paredaens:
Introduction. Constraint Databases 2000: 1-16 - [p3]Stéphane Grumbach, Gabriel M. Kuper, Jianwen Su:
Expressive Power: The Infinite Case. Constraint Databases 2000: 89-107 - [p2]Gabriel M. Kuper, Michel Scholl:
Geographic Information Systems. Constraint Databases 2000: 175-198 - [p1]Bart Kuijpers, Gabriel M. Kuper, Jan Paredaens:
Euclidean Query Languages. Constraint Databases 2000: 275-291 - [e2]Gabriel M. Kuper, Leonid Libkin, Jan Paredaens:
Constraint Databases. Springer 2000, ISBN 3-540-66151-4 [contents]
1990 – 1999
- 1999
- [c22]Gabriel M. Kuper, Jianwen Su:
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance. DBPL 1999: 239-251 - 1998
- [c21]Gabriel M. Kuper, Sridhar Ramaswamy, Kyuseok Shim, Jianwen Su:
A Constraint-Based Spatial Extension to SQL. ACM-GIS 1998: 112-117 - 1997
- [c20]Peter Haunold, Stéphane Grumbach, Gabriel M. Kuper, Zoé Lacroix:
Linear Constraints: Geometric Objects Represented by Inequalities. COSIT 1997: 429-440 - [c19]Stéphane Grumbach, Gabriel M. Kuper:
Tractable Recursion over Geometric Data. CP 1997: 450-462 - [c18]Jan Paredaens, Bart Kuijpers
, Gabriel M. Kuper, Luc Vandeurzen:
Eucil, Tarski, and Engler Encompassed (Preliminary Report). DBPL 1997: 1-24 - 1996
- [j8]Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi:
In Memoriam Paris C. Kanellakis. ACM Comput. Surv. 28(1): 3-15 (1996) - [c17]Jan Chomicki, Dina Q. Goldin, Gabriel M. Kuper:
Variable Independence and Aggregation Closure. PODS 1996: 40-48 - [c16]Serge Abiteboul, Gabriel M. Kuper, Christos H. Papadimitriou, Moshe Y. Vardi:
In Memoriam: Paris C. Kanellakis. PODS 1996: 79 - [e1]Gabriel M. Kuper, Mark Wallace:
Constraint Databases and Applications, ESPRIT WG CONTESSA Workshop, Friedrichshafen, Germany, September 8-9, 1995, Proceedings. Lecture Notes in Computer Science 1034, Springer 1996, ISBN 3-540-60794-3 [contents] - 1995
- [j7]Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
:
Constraint Query Languages. J. Comput. Syst. Sci. 51(1): 26-52 (1995) - [c15]Luis Hermosilla, Gabriel M. Kuper:
Towards the Definition of a Spatial Object-Oriented Data Model with Constraints. CDB 1995: 120-131 - [c14]Jan Chomicki, Gabriel M. Kuper:
Measuring Infinite Relations. PODS 1995: 78-85 - 1994
- [c13]Foto N. Afrati, Stavros S. Cosmadakis
, Stéphane Grumbach, Gabriel M. Kuper:
Linear vs Polynomial Constraints in Database Query Languages. PPCP 1994: 181-192 - [c12]Jan Chomicki, Gabriel M. Kuper:
Measuring Infinite Relations. ILPS Workshop: Constraints and Databases 1994 - 1993
- [j6]Gabriel M. Kuper, Moshe Y. Vardi:
On the Complexity of Queries in the Logical Data Model. Theor. Comput. Sci. 116(1): 33-57 (1993) - [j5]Gabriel M. Kuper, Moshe Y. Vardi:
The Logical Data Model. ACM Trans. Database Syst. 18(3): 379-413 (1993) - [c11]Gabriel M. Kuper:
Aggregation in Constraint Databases. PPCP 1993: 166-173 - 1992
- [j4]Gabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry:
A Note on the Parallel Complexity of Anti-Unification. J. Autom. Reason. 9(3): 381-389 (1992) - 1990
- [j3]Gabriel M. Kuper:
Logic Programming with Sets. J. Comput. Syst. Sci. 41(1): 44-64 (1990) - [c10]Gabriel M. Kuper:
On The Expressive Power of the Relational Calculus with Arithmetic Constraints. ICDT 1990: 202-211 - [c9]Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
:
Constraint Query Languages. PODS 1990: 299-313
1980 – 1989
- 1988
- [c8]Gabriel M. Kuper, Moshe Y. Vardi:
On the Complexity of Queries in the Logical Data Model (Extended Abstract). ICDT 1988: 267-280 - [c7]Gabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry:
Efficient Parallel Algorithms for Anti-Unification and Relative Complement. LICS 1988: 112-120 - [c6]Gabriel M. Kuper:
On the Expressive Power of Logic Programming Languages with Sets. PODS 1988: 10-14 - 1987
- [c5]Gabriel M. Kuper:
Logic Programming With Sets. PODS 1987: 11-20 - 1986
- [j2]Ronald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi:
Updating Logical Databases. Adv. Comput. Res. 3: 1-18 (1986) - [c4]Gabriel M. Kuper:
Logic Programming with Sets. XP7.52 Workshop on Database Theory 1986 - 1985
- [b1]Gabriel M. Kuper:
The logical data model: a new approach to database logic. Stanford University, USA, 1985 - [c3]Gabriel M. Kuper, Moshe Y. Vardi:
On the Expressive Power of the Logical Data Model (Preliminary Report). SIGMOD Conference 1985: 180-187 - 1984
- [j1]Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman:
System/U: A Database System Based on the Universal Relation Assumption. ACM Trans. Database Syst. 9(3): 331-347 (1984) - [c2]Gabriel M. Kuper, Moshe Y. Vardi:
A New Approach to Database Logic. PODS 1984: 86-96 - [c1]Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi:
On the Equivalence of Logical Databases. PODS 1984: 221-228
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint