Остановите войну!
for scientists:
default search action
Dirk Van Gucht
- > Home > Persons > Dirk Van Gucht
Publications
- 2023
- [c77]Jelle Hellings, Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. LICS 2023: 1-13 - 2020
- [j50]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89: 101467 (2020) - [c75]Georg Gottlob, Jan Van den Bussche, Dirk Van Gucht:
2020 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2020: 17 - 2019
- [j48]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
A framework for comparing query languages in their ability to express boolean queries. Ann. Math. Artif. Intell. 87(1-2): 157-184 (2019) - 2018
- [c71]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries. FoIKS 2018: 360-378 - [i7]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees. CoRR abs/1803.01390 (2018) - 2017
- [c69]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
The primitivity of operators in the algebra of binary relations under conjunctions of containments. LICS 2017: 1-10 - 2015
- [j45]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs. Ann. Math. Artif. Intell. 73(1-2): 167-203 (2015) - [j44]Dimitri Surinx, George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative expressive power of navigational querying on graphs using transitive closure. Log. J. IGPL 23(5): 759-788 (2015) - [j43]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative expressive power of navigational querying on graphs. Inf. Sci. 298: 390-406 (2015) - [j42]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. J. Log. Comput. 25(3): 549-580 (2015) - [c68]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Relative expressive power of downward fragments of navigational query languages on trees and chains. DBPL 2015: 59-68 - 2014
- [i5]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative Expressive Power of Navigational Querying on Graphs. CoRR abs/1401.8201 (2014) - 2012
- [c65]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs. FoIKS 2012: 124-143 - [i3]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. CoRR abs/1210.2688 (2012) - 2011
- [c63]George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu:
Relative expressive power of navigational querying on graphs. ICDT 2011: 197-207 - 2010
- [j35]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ACM Trans. Database Syst. 35(4): 28:1-28:33 (2010) - 2009
- [c61]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ICDT 2009: 201-211 - 2007
- [j30]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-definedness and semantic type-checking for the nested relational calculus. Theor. Comput. Sci. 371(3): 183-199 (2007) - [c55]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
A crash course on database queries. PODS 2007: 143-154 - 2005
- [c51]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract. ICDT 2005: 99-113 - 2004
- [i1]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery. CoRR cs.DB/0406060 (2004) - 1999
- [j24]Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Typed Query Languages for Databases Containing Queries. Inf. Syst. 24(7): 569-595 (1999) - [j23]Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Complete Geometric Query Languages. J. Comput. Syst. Sci. 58(3): 483-511 (1999) - 1998
- [j20]Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
First-Order Queries on Finite Structures Over the Reals. SIAM J. Comput. 27(6): 1747-1763 (1998) - [c44]Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Typed Query Languages for Databases Containing Queries. PODS 1998: 189-196 - 1997
- [j19]Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens:
On the completeness of object-creating database transformation languages. J. ACM 44(2): 272-319 (1997) - [j18]Jan Van den Bussche, Dirk Van Gucht:
A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries. J. Comput. Syst. Sci. 54(1): 34-47 (1997) - [c42]Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Complete Geometrical Query Languages. PODS 1997: 62-67 - 1996
- [j17]Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Reflective Programming in the Relational Algebra. J. Comput. Syst. Sci. 52(3): 537-549 (1996) - 1995
- [j16]Jan Van den Bussche, Dirk Van Gucht:
The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models. Theor. Comput. Sci. 149(1): 49-66 (1995) - [c35]Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
First-order Queries on Finite Structures over the Reals. LICS 1995: 79-87 - 1994
- [j13]Marc Gyssens, Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
A Graph-Oriented Object Database Model. IEEE Trans. Knowl. Data Eng. 6(4): 572-586 (1994) - [c32]Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Expressiveness of Efficient Semi-Deterministic Choice Constructs. ICALP 1994: 106-117 - [c30]Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
Towards a Theory of Spatial Database Queries. PODS 1994: 279-288 - 1993
- [c26]Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen:
Reflective Programming in the Relational Algebra. PODS 1993: 17-25 - 1992
- [j11]Jan Paredaens, Jan Van den Bussche, Marc Andries, Marc Gemis, Marc Gyssens, Inge Thyssens, Dirk Van Gucht, Vijay M. Sarathy, Lawrence V. Saxton:
An Overview of GOOD. SIGMOD Rec. 21(1): 25-31 (1992) - [c25]Jan Van den Bussche, Dirk Van Gucht:
Non-Deterministic Aspects of Object-Creating Database Transformations. FMLDO 1992: 3-16 - [c24]Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens:
On the Completeness of Object-Creating Query Languages (Extended Abstract). FOCS 1992: 372-379 - [c23]Jan Van den Bussche, Dirk Van Gucht:
A Hierarchy of Faithful Set Creation in Pure OODB's. ICDT 1992: 326-340 - [c22]Jan Van den Bussche, Dirk Van Gucht:
Semi-determinism. PODS 1992: 191-201
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-04-25 02:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint