Tony Tan

SIAM J. Comput., 2024

On two-variable guarded fragment logic with expressive local Presburger constraints.

[BibT_eX]

[DOI]

Chia-Hsuan Lu

Log. Methods Comput. Sci., 2024

Decidability of Graph Neural Networks via Logical Characterizations.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract).

[BibT_eX]

[DOI]

Louwe Kuijer

Frank Wolter

Michael Zakharyaschev

Proceedings of the 37th International Workshop on Description Logics (DL 2024), 2024

2023

On the Complexity of k-DQBF.

[BibT_eX]

[DOI]

Long-Hin Fung

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022

Reducing NEXP-complete problems to DQBF.

[BibT_eX]

[DOI]

Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

2021

A simple combinatorial proof for the small model property of two-variable logic.

[BibT_eX]

[DOI]

Yanger Ma

Inf. Process. Lett., 2021

Subsequence versus substring constraints in sequence pattern languages.

[BibT_eX]

[DOI]

Steven Engels

Jan Van den Bussche

Acta Informatica, 2021

Towards a more efficient approach for the satisfiability of two-variable logic.

[BibT_eX]

[DOI]

Ting-Wei Lin

Chia-Hsuan Lu

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2019

Two-variable logic revisited.

[BibT_eX]

[DOI]

Yanger Ma

CoRR, 2019

2018

Finite-State Map-Reduce Computation and Relational Algebra Queries.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2018

A note on first-order spectra with binary relations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

2017

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Parallel Evaluation of Multi-Semi-Joins.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

2015

On the Variable Hierarchy of First-Order Spectra.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2015

Regular Graphs and the Spectra of Two-Variable Logic with Counting.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Regular expressions for data words.

[BibT_eX]

[DOI]

Domagoj Vrgoc

J. Comput. Syst. Sci., 2015

Distributed Streaming with Finite Memory.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Database Theory, 2015

Gumbo: Guarded Fragment Queries over Big Data.

[BibT_eX]

[DOI]

Jonny Daenen

Frank Neven

Proceedings of the 18th International Conference on Extending Database Technology, 2015

2014

Extending two-variable logic on data trees with order on data values and its automata.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Regular Expressions for Querying Data graphs.

[BibT_eX]

[DOI]

Domagoj Vrgoc

Int. J. Found. Comput. Sci., 2014

Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference.

[BibT_eX]

[DOI]

Jan Van den Bussche

Xiaowang Zhang

CoRR, 2014

A note on the variable hierarchy of first-order spectra.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Graph Reachability and Pebble Automata over Infinite Alphabets.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2013

Regular Expressions with Binding over Data Words for Querying Graph Databases.

[BibT_eX]

[DOI]

Domagoj Vrgoc

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Efficient reasoning about data trees via integer linear programming.

[BibT_eX]

[DOI]

Claire David

ACM Trans. Database Syst., 2012

Automata for two-variable logic over trees with ordered data values

[BibT_eX]

[DOI]

CoRR, 2012

An Automata Model for Trees with Ordered Data Values.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Feasible Automata for Two-Variable Logic with Successor on Data Words.

[BibT_eX]

[DOI]

Ahmet Kara

Thomas Schwentick

Proceedings of the Language and Automata Theory and Applications, 2012

On the complexity of query answering over incomplete XML documents.

[BibT_eX]

[DOI]

Amélie Gheerbrant

Proceedings of the 15th International Conference on Database Theory, 2012

2011

A Formalism for Graph Databases and its Model of Computation.

[BibT_eX]

[DOI]

Juan L. Reutter

Proceedings of the 5th Alberto Mendelzon International Workshop on Foundations of Data Management, 2011

2010

On pebble automata for data languages with decidable emptiness problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

A Note on Two-pebble Automata Over Infinite Alphabets.

[BibT_eX]

[DOI]

Michael Kaminski

Fundam. Informaticae, 2010

Extending Büchi Automata with Constraints on Data Values

[BibT_eX]

[DOI]

Ahmet Kara

CoRR, 2010

On the Satisfiability of Two-Variable Logic over Data Words.

[BibT_eX]

[DOI]

Claire David

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Pebble automata for data languages: separation, decidability, and undecidability.

[BibT_eX]

[DOI]

PhD thesis, 2009

2008

Approximating polyhedral objects with deformable smooth surfaces.

[BibT_eX]

[DOI]

Ho-Lun Cheng

Comput. Geom., 2008

Tree Automata over Infinite Alphabets.

[BibT_eX]

[DOI]

Michael Kaminski

Proceedings of the Pillars of Computer Science, 2008

2006

Regular Expressions for Languages over Infinite Alphabets.

[BibT_eX]

[DOI]

Michael Kaminski

Fundam. Informaticae, 2006

2005

Approximating Polygonal Objects by Deformable Smooth Surfaces.

[BibT_eX]

[DOI]

Ho-Lun Cheng

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Subdividing Alpha Complex.

[BibT_eX]

[DOI]

Ho-Lun Cheng