Gabriel M. Kuper - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2016

Query answering over contextualized RDF/OWL knowledge with forall-existential bridge rules: Decidable finite extension classesMathew Joseph, Gabriel M. Kuper, Till Mossakowski, Luciano Serafini. semweb, 7(1):25-61, 2016. [doi]

2014

Query Answering over Contextualized RDF Knowledge with Forall-Existential Bridge Rules: Attaining Decidability Using AcyclicityMathew Joseph, Gabriel M. Kuper, Luciano Serafini. cilc 2014: 210-224 [doi]

Query Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Attaining Decidability Using AcyclicityMathew Joseph, Gabriel M. Kuper, Luciano Serafini. rr 2014: 60-75 [doi]

2011

On the complexity of tree pattern containment with arithmetic comparisonsFoto N. Afrati, Sara Cohen, Gabriel M. Kuper. ipl, 111(15):754-760, 2011. [doi]

2009

Generalized XML security viewsGabriel M. Kuper, Fabio Massacci, Nataliya Rassadko. ijisec, 8(3):173-203, 2009. [doi]

2007

First-Order Languages Expressing Constructible Spatial Database QueriesBart Kuijpers, Gabriel M. Kuper, Jan Paredaens, Luc Vandeurzen. SICOMP, 36(6):1570-1599, 2007. [doi]

A representation independent language for planar spatial databases with Euclidean distanceGabriel M. Kuper, Jianwen Su. jcss, 73(6):845-874, 2007. [doi]

2005

Structural properties of XPath fragmentsMichael Benedikt, Wenfei Fan, Gabriel M. Kuper. TCS, 336(1):3-31, 2005. [doi]

Asking and Answering Queries SemanticallyPaolo Bouquet, Gabriel M. Kuper, Stefano Zanobini. woa 2005: 22-27 [doi]

Generalized XML security viewsGabriel M. Kuper, Fabio Massacci, Nataliya Rassadko. SACMAT 2005: 77-84 [doi]

2004

2003

2002

A unified constraint model for XMLWenfei Fan, Gabriel M. Kuper, Jérôme Siméon. cn, 39(5):489-505, 2002. [doi]

2001

On the orthographic dimension of definable setsStavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin. ipl, 79(3):141-145, 2001. [doi]

A unified constraint model for XMLWenfei Fan, Gabriel M. Kuper, Jérôme Siméon. WWW 2001: 179-190 [doi]

Subsumption for XML typesGabriel M. Kuper, Jérôme Siméon. icdt 2001: 331-345 [doi]

2000

Expressive Power: The Infinite CaseStéphane Grumbach, Gabriel M. Kuper, Jianwen Su. cdb 2000: 89-107

Euclidean Query LanguagesBart Kuijpers, Gabriel M. Kuper, Jan Paredaens. cdb 2000: 275-291

Geographic Information SystemsGabriel M. Kuper, Michel Scholl. cdb 2000: 175-198

IntroductionGabriel M. Kuper, Leonid Libkin, Jan Paredaens. cdb 2000: 1-16

1999

A Representation Independent Language for Planar Spatial Databases with Euclidean DistanceGabriel M. Kuper, Jianwen Su. DBPL 2000: 239-251 [doi]

1998

A Constraint-Based Spatial Extension to SQLGabriel M. Kuper, Sridhar Ramaswamy, Kyuseok Shim, Jianwen Su. gis 1998: 112-117 [doi]

1997

Tractable Recursion over Geometric DataStéphane Grumbach, Gabriel M. Kuper. cp 1997: 450-462

Linear Constraints: Geometric Objects Represented by InequalitiesPeter Haunold, Stéphane Grumbach, Gabriel M. Kuper, Zoé Lacroix. cosit 1997: 429-440

Eucil, Tarski, and Engler Encompassed (Preliminary Report)Jan Paredaens, Bart Kuijpers, Gabriel M. Kuper, Luc Vandeurzen. DBPL 1998: 1-24 [doi]

1996

1995

Measuring Infinite RelationsJan Chomicki, Gabriel M. Kuper. PODS 1995: 78-85 [doi]

Towards the Definition of a Spatial Object-Oriented Data Model with ConstraintsLuis Hermosilla, Gabriel M. Kuper. cdb 1996: 120-131

Constraint Query LanguagesParis C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. jcss, 51(1):26-52, 1995.

1994

Linear vs Polynomial Constraints in Database Query LanguagesFoto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper. ppcp 1994: 181-192

Measuring Infinite RelationsJan Chomicki, Gabriel M. Kuper. SLP 1994:

1993

Aggregation in Constraint DatabasesGabriel M. Kuper. ppcp 1993: 166-173

The Logical Data ModelGabriel M. Kuper, Moshe Y. Vardi. TODS, 18(3):379-413, 1993. [doi]

1992

A Note on the Parallel Complexity of Anti-UnificationGabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry. JAR, 9(3):381-389, 1992.

1990

Constraint Query LanguagesParis C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. PODS 1990: 299-313 [doi]

Logic Programming with SetsGabriel M. Kuper. jcss, 41(1):44-64, 1990.

On The Expressive Power of the Relational Calculus with Arithmetic ConstraintsGabriel M. Kuper. icdt 1990: 202-211 [doi]

1988

Efficient Parallel Algorithms for Anti-Unification and Relative ComplementGabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry. lics 1988: 112-120

On the Expressive Power of Logic Programming Languages with SetsGabriel M. Kuper. PODS 1988: 10-14 [doi]

On the Complexity of Queries in the Logical Data Model (Extended Abstract)Gabriel M. Kuper, Moshe Y. Vardi. icdt 1988: 267-280 [doi]

1987

Logic Programming With SetsGabriel M. Kuper. PODS 1987: 11-20 [doi]

1986

Updating Logical DatabasesRonald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi. acr, 3:1-18, 1986.

Logic Programming with SetsGabriel M. Kuper. xp 1986: [doi]

1985

The logical data model: a new approach to database logicGabriel M. Kuper. PhD thesis, Stanford University, USA, 1985. [doi]

On the Expressive Power of the Logical Data Model (Preliminary Report)Gabriel M. Kuper, Moshe Y. Vardi. SIGMOD 1985: 180-187 [doi]

1984

System/U: A Database System Based on the Universal Relation AssumptionHenry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman. TODS, 9(3):331-347, 1984. [doi]

On the Equivalence of Logical DatabasesGabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi. PODS 1984: 221-228 [doi]

A New Approach to Database LogicGabriel M. Kuper, Moshe Y. Vardi. PODS 1984: 86-96 [doi]

Sign in or sign up to see more results.

runs on WebDSL