Marc Gyssens
Orcid: 0000-0002-5197-2817Affiliations:
- Hasselt University
According to our database1,
Marc Gyssens
authored at least 93 papers
between 1982 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
2022
J. Log. Algebraic Methods Program., 2022
Proceedings of the Foundations of Information and Knowledge Systems, 2022
2021
Comput. J., 2021
2020
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees.
Inf. Syst., 2020
2019
2018
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018
Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees.
CoRR, 2018
2017
From relation algebra to semi-join algebra: an approach for graph query optimization.
Proceedings of The 16th International Symposium on Database Programming Languages, 2017
2016
Structural characterizations of the navigational expressiveness of relation algebras on a tree.
J. Comput. Syst. Sci., 2016
Ann. Math. Artif. Intell., 2016
2015
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations.
J. Log. Comput., 2015
Relative expressive power of navigational querying on graphs using transitive closure.
Log. J. IGPL, 2015
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs.
Ann. Math. Artif. Intell., 2015
Relative expressive power of downward fragments of navigational query languages on trees and chains.
Proceedings of the 15th Symposium on Database Programming Languages, 2015
2014
On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements.
Inf. Process. Lett., 2014
Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model.
Proceedings of the Foundations of Information and Knowledge Systems, 2014
2013
Artif. Intell., 2013
2012
SIAM J. Comput., 2012
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs.
Proceedings of the Foundations of Information and Knowledge Systems, 2012
2011
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form and Minimization.
Comput. J., 2011
Proceedings of the Database Theory, 2011
2010
Int. J. Approx. Reason., 2010
2009
IEEE Trans. Knowl. Data Eng., 2009
A methodology for coupling fragments of XPath with structural indexes for XML documents.
Inf. Syst., 2009
2008
J. Comput. Syst. Sci., 2008
Inf. Comput., 2008
Proceedings of the UAI 2008, 2008
2007
Proceedings of the 1st Workshop on Emerging Research Opportunities for Web Data Management (EROW 2007) Collocated with the 11th International Conference on Database Theory (ICDT 2007), 2007
Proceedings of the Machine Learning: ECML 2007, 2007
2006
CoRR, 2006
Structural characterizations of the semantics of XPath as navigation tool on a document.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006
Proceedings of the Knowledge Discovery and Emergent Complexity in Bioinformatics, 2006
A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems.
Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006
2005
A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
2004
J. Comput. Syst. Sci., 2004
2001
Theor. Comput. Sci., 2001
Equivalence and Normal Forms for the Restricted and Bounded Fixpoint in the Nested Algebra.
Inf. Comput., 2001
2000
Linear-Constraint Databases.
Proceedings of the Constraint Databases, 2000
1999
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases - CORRIGENDUM.
J. Comput. Syst. Sci., 1999
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases.
J. Comput. Syst. Sci., 1999
1997
J. ACM, 1997
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997
On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases.
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997
1996
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
1995
Proceedings of the Advances in Spatial Databases, 1995
The Restricted and Bounded Fixpoint Closures of the Nested Relational Algebra are Equivalent.
Proceedings of the Database Programming Languages (DBPL-5), 1995
Proceedings of the Principles and Practice of Constraint Programming, 1995
1994
SIAM J. Comput., 1994
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., 1994
Artif. Intell., 1994
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994
1993
Querying with Generalized Quantifiers.
Proceedings of the Applications of Logic Databases, 1993
1992
J. Comput. Syst. Sci., 1992
Proceedings of the Database Theory, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
Theor. Comput. Sci., 1991
A Categorial Approach to Object-Oriented Data Modeling.
Proceedings of the Third Workshop on Foundations of Models and Languages for Data and Objects, 1991
Tagging as an Alternative to Object Creation.
Proceedings of the Query Processing for Advanced Database Systems, 1991
1990
Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990
1989
A uniform approach toward handling atomic and structured information in the nested relational database model.
J. ACM, 1989
An Alternative Way to Represent the Cogroup of a Relation in the Context of Nested Databases.
Inf. Process. Lett., 1989
A Grammar-Based Approach Towards Unifying Hierarchical Data Models (Extended Abstract).
Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, USA, May 31, 1989
EATCS Monographs on Theoretical Computer Science 17, Springer, ISBN: 978-3-642-69956-6, 1989
1988
IEEE Data Eng. Bull., 1988
The Powerset Algebra as a Result of Adding Programming Constructs to the Nested Relational Algebra.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988
1987
An Introduction to the Completeness of Languages for Complex Objects and Nested Relations.
Proceedings of the Nested Relations and Complex Objects, 1987
1986
On the Decomposition of Join Dependencies.
Adv. Comput. Res., 1986
1985
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985
1983
Another view of functional and multivalued dependencies in the relational database model.
Int. J. Parallel Program., 1983
1982
A Decomposition Methodology for Cyclic Databases.
Proceedings of the Advances in Data Base Theory, 1982