Marc Gyssens

Orcid: 0000-0002-5197-2817

Affiliations:
  • Hasselt University


According to our database1, Marc Gyssens authored at least 93 papers between 1982 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

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
The power of Tarski's relation algebra on trees.
J. Log. Algebraic Methods Program., 2022

On matrices and K-relations.
Ann. Math. Artif. Intell., 2022

Optimizing Multiset Relational Algebra Queries Using Weak-Equivalent Rewrite Rules.
Proceedings of the Foundations of Information and Knowledge Systems, 2022

2021
From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization.
Comput. J., 2021

2020
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees.
Inf. Syst., 2020

2019
Calculi for symmetric queries.
J. Comput. Syst. Sci., 2019

First-order definable counting-only queries.
Ann. Math. Artif. Intell., 2019

2018
Database Dependencies.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees.
CoRR, 2018

Preface.
Ann. Math. Artif. Intell., 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

Implication and axiomatization of functional and constant constraints.
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.
Inf. Sci., 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
An Approach towards the Study of Symmetric Queries.
Proc. VLDB Endow., 2013

On the conditional independence implication problem: A lattice-theoretic approach.
Artif. Intell., 2013

2012
Regular Expressions with Counting: Weak versus Strong Determinism.
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

Relative expressive power of navigational querying on graphs.
Proceedings of the Database Theory, 2011

2010
Logical and algorithmic properties of stable conditional independence.
Int. J. Approx. Reason., 2010

2009
Database Dependencies.
Proceedings of the Encyclopedia of Database Systems, 2009

On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs.
IEEE Trans. Knowl. Data Eng., 2009

A methodology for coupling fragments of XPath with structural indexes for XML documents.
Inf. Syst., 2009

2008
A unified theory of structural tractability for constraint satisfaction problems.
J. Comput. Syst. Sci., 2008

The implication problem for measure-based constraints.
Inf. Syst., 2008

Typechecking top-down XML transformations: Fixed input or output schemas.
Inf. Comput., 2008

On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach.
Proceedings of the UAI 2008, 2008

2007
The pattern memory of gene-protein networks.
AI Commun., 2007

Coupling Fragments of XPath with XML Indexing and Query Decomposition.
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

On Phase Transitions in Learning Sparse Networks.
Proceedings of the Machine Learning: ECML 2007, 2007

2006
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
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

The Identification of Dynamic Gene-Protein Networks.
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
An expressive language for linear spatial database queries.
J. Comput. Syst. Sci., 2004

2001
On the expressiveness of linear-constraint query languages for spatial databases.
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
Complete Geometric Query Languages.
J. Comput. Syst. Sci., 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

How to Determine the Expressive Power of Constraints.
Constraints An Int. J., 1999

1997
Closure properties of constraints.
J. ACM, 1997

On the completeness of object-creating database transformation languages.
J. ACM, 1997

A Foundation for Multi-dimensional Databases.
Proceedings of the VLDB'97, 1997

Complete Geometrical Query Languages.
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
CGOOD, a Categorical Graph-Oriented Object Data Model.
Theor. Comput. Sci., 1996

Tables as a Paradigm for Querying and Restructuring.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

On Query Languages for Linear Queries Definable with Polynomial Constraints.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

A test for Tractability.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Derivation of Constraints and Database Relations.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995
On the Desirability and Limitations of Linear Spatial Database Models.
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

A Unifying Framework for Tractable Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
A Graph-Oriented Object Database Model.
IEEE Trans. Knowl. Data Eng., 1994

A Grammar-Based Approach Towards Unifying Hierarchical Data Models.
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

Decomposing Constraint Satisfaction Problems Using Database Techniques.
Artif. Intell., 1994

Expressiveness of Efficient Semi-Deterministic Choice Constructs.
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
An Overview of GOOD.
SIGMOD Rec., 1992

The Powerset Algebra as a Natural Tool to Handle Nested Database Relations.
J. Comput. Syst. Sci., 1992

Views and Decompositions of Databases from a Categorical Perspective.
Proceedings of the Database Theory, 1992

On the Completeness of Object-Creating Query Languages (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
A Comparison between Algebraic Query Languages for Flat and Nested Databases.
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
On a Hierarchy of Classes for Nested Databases.
Inf. Process. Lett., 1990

A Graph-Oriented Object Model for Database End-User Interfaces.
Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990

A Graph-Oriented Object Database Model.
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

The Structure of the Relational Database Model
EATCS Monographs on Theoretical Computer Science 17, Springer, ISBN: 978-3-642-69956-6, 1989

1988
The Expressiveness of Query Languages for Nested Relations.
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
Object Histories Which Avoid Certain Subsequences
Inf. Comput., May, 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 Complexity of Join Dependencies.
ACM Trans. Database Syst., 1986

On the Decomposition of Join Dependencies.
Adv. Comput. Res., 1986

1985
Embedded Join Dependencies as a Tool for Decomposing Full Join Dependencies.
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


  Loading...