default search action
Marc Gyssens
Person information
- affiliation: Hasselt University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c43]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 - 2022
- [j50]Robert Brijder, Marc Gyssens
, Jan Van den Bussche
On matrices and K-relations. Ann. Math. Artif. Intell. 90(2-3): 181-210 (2022) - [j49]Jelle Hellings, Yuqing Wu, Marc Gyssens
The power of Tarski's relation algebra on trees. J. Log. Algebraic Methods Program. 126: 100748 (2022) - [c42]Jelle Hellings, Yuqing Wu, Dirk Van Gucht, Marc Gyssens:
Optimizing Multiset Relational Algebra Queries Using Weak-Equivalent Rewrite Rules. FoIKS 2022: 187-205 - 2021
- [j48]Jelle Hellings, Catherine L. Pilachowski, Dirk Van Gucht, Marc Gyssens
From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization. Comput. J. 64(5): 789-811 (2021) - 2020
- [j47]Jelle Hellings, Marc Gyssens
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89: 101467 (2020) - [c41]Robert Brijder, Marc Gyssens, Jan Van den Bussche:
On Matrices and K-Relations. FoIKS 2020: 42-57
2010 – 2019
- 2019
- [j46]Jelle Hellings, Marc Gyssens
First-order definable counting-only queries. Ann. Math. Artif. Intell. 87(1-2): 109-136 (2019) - [j45]Marc Gyssens
Calculi for symmetric queries. J. Comput. Syst. Sci. 105: 54-86 (2019) - [i9]Robert Brijder, Marc Gyssens, Jan Van den Bussche:
On matrices and K-relations. CoRR abs/1904.03934 (2019) - 2018
- [j44]Marc Gyssens
Preface. Ann. Math. Artif. Intell. 83(3-4): 209-212 (2018) - [c40]Jelle Hellings, Marc Gyssens
First-Order Definable Counting-Only Queries. FoIKS 2018: 225-243 - [c39]Jelle Hellings, Yuqing Wu, Marc Gyssens
The Power of Tarski's Relation Algebra on Trees. FoIKS 2018: 244-264 - [r2]Marc Gyssens
Database Dependencies. Encyclopedia of Database Systems (2nd ed.) 2018 - [i8]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
- [c38]Jelle Hellings, Catherine L. Pilachowski, Dirk Van Gucht, Marc Gyssens
From relation algebra to semi-join algebra: an approach for graph query optimization. DBPL 2017: 5:1-5:10 - 2016
- [j43]Jelle Hellings, Marc Gyssens
Implication and axiomatization of functional and constant constraints. Ann. Math. Artif. Intell. 76(3-4): 251-279 (2016) - [j42]George H. L. Fletcher, Marc Gyssens
Structural characterizations of the navigational expressiveness of relation algebras on a tree. J. Comput. Syst. Sci. 82(2): 229-259 (2016) - [e2]Marc Gyssens
Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings. Lecture Notes in Computer Science 9616, Springer 2016, ISBN 978-3-319-30023-8 [contents] - 2015
- [j41]George H. L. Fletcher, Marc Gyssens
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) - [j40]Dimitri Surinx, George H. L. Fletcher, Marc Gyssens
Relative expressive power of navigational querying on graphs using transitive closure. Log. J. IGPL 23(5): 759-788 (2015) - [j39]George H. L. Fletcher, Marc Gyssens
Relative expressive power of navigational querying on graphs. Inf. Sci. 298: 390-406 (2015) - [j38]George H. L. Fletcher, Marc Gyssens
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. J. Log. Comput. 25(3): 549-580 (2015) - [c37]Jelle Hellings, Marc Gyssens
Relative expressive power of downward fragments of navigational query languages on trees and chains. DBPL 2015: 59-68 - [i7]George H. L. Fletcher, Marc Gyssens, Jan Paredaens, Dirk Van Gucht, Yuqing Wu:
Structural characterizations of the navigational expressiveness of relation algebras on a tree. CoRR abs/1502.03258 (2015) - 2014
- [j37]Marc Gyssens
On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements. Inf. Process. Lett. 114(11): 628-633 (2014) - [c36]Jelle Hellings, Marc Gyssens
Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model. FoIKS 2014: 250-269 - [i6]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) - [i5]Mathias Niepert, Dirk Van Gucht, Marc Gyssens:
On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach. CoRR abs/1408.2030 (2014) - 2013
- [j36]Mathias Niepert
On the conditional independence implication problem: A lattice-theoretic approach. Artif. Intell. 202: 29-51 (2013) - [j35]Marc Gyssens
An Approach towards the Study of Symmetric Queries. Proc. VLDB Endow. 7(1): 25-36 (2013) - 2012
- [j34]Wouter Gelade, Marc Gyssens
Regular Expressions with Counting: Weak versus Strong Determinism. SIAM J. Comput. 41(1): 160-190 (2012) - [c35]George H. L. Fletcher, Marc Gyssens
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs. FoIKS 2012: 124-143 - [i4]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
- [j33]Yuqing Wu, Dirk Van Gucht, Marc Gyssens
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form and Minimization. Comput. J. 54(7): 1091-1118 (2011) - [c34]George H. L. Fletcher, Marc Gyssens
Relative expressive power of navigational querying on graphs. ICDT 2011: 197-207 - 2010
- [j32]Mathias Niepert
Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reason. 51(5): 531-543 (2010)
2000 – 2009
- 2009
- [j31]George H. L. Fletcher, Dirk Van Gucht, Yuqing Wu, Marc Gyssens
A methodology for coupling fragments of XPath with structural indexes for XML documents. Inf. Syst. 34(7): 657-670 (2009) - [j30]George H. L. Fletcher, Marc Gyssens
On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs. IEEE Trans. Knowl. Data Eng. 21(6): 939-942 (2009) - [c33]Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Paredaens:
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization. BNCOD 2009: 133-145 - [c32]Wouter Gelade, Marc Gyssens
Regular Expressions with Counting: Weak versus Strong Determinism. MFCS 2009: 369-381 - [r1]Marc Gyssens
Database Dependencies. Encyclopedia of Database Systems 2009: 704-708 - 2008
- [j29]Wim Martens, Frank Neven
Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7): 806-827 (2008) - [j28]Bassem Sayrafi, Dirk Van Gucht, Marc Gyssens
The implication problem for measure-based constraints. Inf. Syst. 33(2): 221-239 (2008) - [j27]David A. Cohen, Peter Jeavons, Marc Gyssens
A unified theory of structural tractability for constraint satisfaction problems. J. Comput. Syst. Sci. 74(5): 721-743 (2008) - [c31]Mathias Niepert, Dirk Van Gucht, Marc Gyssens:
On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach. UAI 2008: 435-443 - [i3]Mathias Niepert, Dirk Van Gucht, Marc Gyssens:
On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach. CoRR abs/0810.5717 (2008) - 2007
- [j26]Ronald L. Westra, Goele Hollanders, Geert Jan Bex, Marc Gyssens, Karl Tuyls:
The pattern memory of gene-protein networks. AI Commun. 20(4): 297-311 (2007) - [c30]George H. L. Fletcher, Dirk Van Gucht, Yuqing Wu, Marc Gyssens
A Methodology for Coupling Fragments of XPath with Structural Indexes for XML Documents. DBPL 2007: 48-65 - [c29]Goele Hollanders, Geert Jan Bex, Marc Gyssens
On Phase Transitions in Learning Sparse Networks. ECML 2007: 591-599 - [c28]George H. L. Fletcher, Dirk Van Gucht, Yuqing Wu, Marc Gyssens, Jan Paredaens:
Coupling Fragments of XPath with XML Indexing and Query Decomposition. EROW 2007 - 2006
- [c27]Ronald L. Westra, Goele Hollanders, Geert Jan Bex, Marc Gyssens
The Identification of Dynamic Gene-Protein Networks. KDECB 2006: 157-170 - [c26]Marc Gyssens
Structural characterizations of the semantics of XPath as navigation tool on a document. PODS 2006: 318-327 - [i2]David A. Cohen, Marc Gyssens
A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems. Complexity of Constraints 2006 - [i1]Wim Martens, Frank Neven, Marc Gyssens:
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. CoRR abs/cs/0606094 (2006) - 2005
- [c25]David A. Cohen, Peter Jeavons, Marc Gyssens:
A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. IJCAI 2005: 72-77 - 2004
- [j25]Luc Vandeurzen, Marc Gyssens
An expressive language for linear spatial database queries. J. Comput. Syst. Sci. 69(4): 617-655 (2004) - 2001
- [j24]Marc Gyssens
Equivalence and Normal Forms for the Restricted and Bounded Fixpoint in the Nested Algebra. Inf. Comput. 164(1): 85-117 (2001) - [j23]Luc Vandeurzen, Marc Gyssens
On the expressiveness of linear-constraint query languages for spatial databases. Theor. Comput. Sci. 254(1-2): 423-463 (2001) - 2000
- [p2]Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht:
Linear-Constraint Databases. Constraint Databases 2000: 199-229
1990 – 1999
- 1999
- [j22]Peter Jeavons, David A. Cohen, Marc Gyssens
How to Determine the Expressive Power of Constraints. Constraints An Int. J. 4(2): 113-131 (1999) - [j21]Marc Gyssens
Complete Geometric Query Languages. J. Comput. Syst. Sci. 58(3): 483-511 (1999) - [j20]Freddy Dumortier, Marc Gyssens
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases. J. Comput. Syst. Sci. 58(3): 535-571 (1999) - [j19]Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht:
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases - CORRIGENDUM. J. Comput. Syst. Sci. 59(3): 557-562 (1999) - 1998
- [c24]Luc Vandeurzen, Marc Gyssens
An Expressive Language for Linear Spatial Database Queries. PODS 1998: 109-118 - 1997
- [j18]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) - [j17]Peter Jeavons, David A. Cohen, Marc Gyssens
Closure properties of constraints. J. ACM 44(4): 527-548 (1997) - [c23]Marc Gyssens
Complete Geometrical Query Languages. PODS 1997: 62-67 - [c22]Freddy Dumortier, Marc Gyssens
On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases. PODS 1997: 68-77 - [c21]Marc Gyssens, Laks V. S. Lakshmanan:
A Foundation for Multi-dimensional Databases. VLDB 1997: 106-115 - 1996
- [j16]Chris Tuijn, Marc Gyssens
CGOOD, a Categorical Graph-Oriented Object Data Model. Theor. Comput. Sci. 160(1&2): 217-239 (1996) - [c20]David A. Cohen, Marc Gyssens
Derivation of Constraints and Database Relations. CP 1996: 134-148 - [c19]Peter Jeavons, David A. Cohen, Marc Gyssens
A test for Tractability. CP 1996: 267-281 - [c18]Luc Vandeurzen, Marc Gyssens
On Query Languages for Linear Queries Definable with Polynomial Constraints. CP 1996: 468-481 - [c17]Marc Gyssens
Tables as a Paradigm for Querying and Restructuring. PODS 1996: 93-103 - 1995
- [c16]Peter Jeavons, David A. Cohen, Marc Gyssens
A Unifying Framework for Tractable Constraints. CP 1995: 276-291 - [c15]Marc Gyssens, Dan Suciu, Dirk Van Gucht:
The Restricted and Bounded Fixpoint Closures of the Nested Relational Algebra are Equivalent. DBPL 1995: 5 - [c14]Luc Vandeurzen, Marc Gyssens
On the Desirability and Limitations of Linear Spatial Database Models. SSD 1995: 14-28 - 1994
- [j15]Marc Gyssens
Decomposing Constraint Satisfaction Problems Using Database Techniques. Artif. Intell. 66(1): 57-89 (1994) - [j14]Marc Gyssens
Database management with dBASE and SQL: A practical introduction : Hans Pruyt (translated by Mike Lewis) Chapman & Hall, London (1993) 232 pp £19.95 ISBN 0 412 47750 5. Inf. Softw. Technol. 36(6): 373-374 (1994) - [j13]Marc Gyssens
A Grammar-Based Approach Towards Unifying Hierarchical Data Models. SIAM J. Comput. 23(6): 1093-1137 (1994) - [j12]Marc Gyssens
A Graph-Oriented Object Database Model. IEEE Trans. Knowl. Data Eng. 6(4): 572-586 (1994) - [c13]Marc Gyssens
Expressiveness of Efficient Semi-Deterministic Choice Constructs. ICALP 1994: 106-117 - 1993
- [c12]Antonio Badia, Dirk Van Gucht, Marc Gyssens:
Querying with Generalized Quantifiers. Workshop on Programming with Logic Databases (Book), ILPS 1993: 235-258 - 1992
- [j11]Marc Gyssens
The Powerset Algebra as a Natural Tool to Handle Nested Database Relations. J. Comput. Syst. Sci. 45(1): 76-103 (1992) - [j10]Jan Paredaens, Jan Van den Bussche, Marc Andries, Marc Gemis, Marc Gyssens
An Overview of GOOD. SIGMOD Rec. 21(1): 25-31 (1992) - [c11]Jan Van den Bussche
On the Completeness of Object-Creating Query Languages (Extended Abstract). FOCS 1992: 372-379 - [c10]Chris Tuijn, Marc Gyssens:
Views and Decompositions of Databases from a Categorical Perspective. ICDT 1992: 99-112 - 1991
- [j9]Marc Gyssens
A Comparison between Algebraic Query Languages for Flat and Nested Databases. Theor. Comput. Sci. 87(2): 263-286 (1991) - [c9]Chris Tuijn, Marc Gyssens, Jan Paredaens:
A Categorial Approach to Object-Oriented Data Modeling. FMLDO 1991: 187-196 - [p1]Marc Gyssens, Lawrence V. Saxton, Dirk Van Gucht:
Tagging as an Alternative to Object Creation. Query Processing for Advanced Database Systems 1991: 201-242 - 1990
- [j8]Marc Gyssens
On a Hierarchy of Classes for Nested Databases. Inf. Process. Lett. 36(5): 259-266 (1990) - [c8]Marc Gyssens
A Graph-Oriented Object Database Model. PODS 1990: 417-424 - [c7]Marc Gyssens
A Graph-Oriented Object Model for Database End-User Interfaces. SIGMOD Conference 1990: 24-33
1980 – 1989
- 1989
- [b1]Jan Paredaens, Paul De Bra, Marc Gyssens
The Structure of the Relational Database Model. EATCS Monographs on Theoretical Computer Science 17, Springer 1989, ISBN 3-540-13714-9 - [j7]Serge Abiteboul, Marc Gyssens
An Alternative Way to Represent the Cogroup of a Relation in the Context of Nested Databases. Inf. Process. Lett. 32(6): 317-324 (1989) - [j6]Marc Gyssens
A uniform approach toward handling atomic and structured information in the nested relational database model. J. ACM 36(4): 790-825 (1989) - [c6]Marc Gyssens
A Grammar-Based Approach Towards Unifying Hierarchical Data Models (Extended Abstract). SIGMOD Conference 1989: 263-272 - 1988
- [j5]Marc Gyssens, Dirk Van Gucht:
The Expressiveness of Query Languages for Nested Relations. IEEE Data Eng. Bull. 11(3): 48-55 (1988) - [c5]Marc Gyssens
The Powerset Algebra as a Result of Adding Programming Constructs to the Nested Relational Algebra. SIGMOD Conference 1988: 225-232 - [e1]Marc Gyssens
ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31 - September 2, 1988, Proceedings. Lecture Notes in Computer Science 326, Springer 1988, ISBN 3-540-50171-1 [contents] - 1987
- [j4]Seymour Ginsburg, Marc Gyssens
Object Histories Which Avoid Certain Subsequences. Inf. Comput. 73(2): 174-206 (1987) - [c4]Serge Abiteboul, Catriel Beeri, Marc Gyssens, Dirk Van Gucht:
An Introduction to the Completeness of Languages for Complex Objects and Nested Relations. NF² 1987: 117-138 - 1986
- [j3]Marc Gyssens, Jan Paredaens:
On the Decomposition of Join Dependencies. Adv. Comput. Res. 3: 69-106 (1986) - [j2]Marc Gyssens
On the Complexity of Join Dependencies. ACM Trans. Database Syst. 11(1): 81-108 (1986) - 1985
- [c3]Marc Gyssens
Embedded Join Dependencies as a Tool for Decomposing Full Join Dependencies. PODS 1985: 205-214 - 1984
- [c2]Marc Gyssens
On the Decomposition of Join Dependencies. PODS 1984: 143-152 - 1983
- [j1]Marc Gyssens
Another view of functional and multivalued dependencies in the relational database model. Int. J. Parallel Program. 12(4): 247-267 (1983) - 1982
- [c1]Marc Gyssens, Jan Paredaens:
A Decomposition Methodology for Cyclic Databases. Advances in Data Base Theory 1982: 85-122
Coauthor Index
George Fletcher 0001
aka: George H. L. Fletcher
aka: George H. L. Fletcher
[c43] [j49] [c42] [j48] [j47] [j46] [j45] [c40] [c39] [i8] [c38] [j42] [j41] [j40] [j39] [j38] [c37] [i7] [j37] [i6] [i5] [j36] [j35] [c35] [i4] [j33] [c34] [j32] [j31] [j30] [c33] [j28] [c31] [i3] [c30] [c28] [c26] [j25] [j24] [j23] [p2] [j21] [j20] [j19] [c24] [j18] [c23] [c22] [c18] [c15] [c14] [j13] [j12] [c13] [c12] [j11] [j10] [c11] [j9] [p1] [j8] [c8] [c7] [b1] [j7] [j6] [c6] [j5] [c5] [e1] [c4]
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-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: