Tony Tan

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 24

Top Topics

Guarded Fragment

Binary Relations

Regular Expressions

Predicate Logic

Top Venues

ACM Trans. Comput. Log.

Publications

Michael Benedikt, Egor V. Kostylev, Tony Tan
Two Variable Logic with Ultimately Periodic Counting. SIAM J. Comput. 53 (4) (2024)
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
Decidability of Graph Neural Networks via Logical Characterizations. ICALP (2024)
Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev
Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract). Description Logics (2024)
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
Decidability of Graph Neural Networks via Logical Characterizations. CoRR (2024)
Long-Hin Fung, Tony Tan
On the Complexity of k-DQBF. SAT (2023)
Chia-Hsuan Lu, Tony Tan
On two-variable guarded fragment logic with expressive local Presburger constraints. CoRR (2022)
Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan
Reducing NEXP-complete problems to DQBF. CoRR (2022)
Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan
Reducing NEXP-complete problems to DQBF. FMCAD (2022)
Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan
Towards a more efficient approach for the satisfiability of two-variable logic. LICS (2021)
Steven Engels, Tony Tan, Jan Van den Bussche
Subsequence versus substring constraints in sequence pattern languages. Acta Informatica 58 (1-2) (2021)
Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan
Towards a more efficient approach for the satisfiability of two-variable logic. CoRR (2021)
Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. FSTTCS (2021)
Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics. CoRR (2021)
Yanger Ma, Tony Tan
A simple combinatorial proof for the small model property of two-variable logic. Inf. Process. Lett. 170 (2021)
Michael Benedikt, Egor V. Kostylev, Tony Tan
Two Variable Logic with Ultimately Periodic Counting. ICALP (2020)
Michael Benedikt, Egor V. Kostylev, Tony Tan
Two variable logic with ultimately periodic counting. CoRR (2020)
Yanger Ma, Tony Tan
Two-variable logic revisited. CoRR (2019)
Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan
Finite-State Map-Reduce Computation and Relational Algebra Queries. ACM Trans. Comput. Log. 19 (2) (2018)
Eryk Kopczynski, Tony Tan
A note on first-order spectra with binary relations. Log. Methods Comput. Sci. 14 (2) (2018)
Eryk Kopczynski, Tony Tan
A note on first-order spectra with binary relations. CoRR (2017)
Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
Register automata with linear arithmetic. LICS (2017)
Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
Register automata with linear arithmetic. CoRR (2017)
Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren
Parallel Evaluation of Multi-Semi-Joins. Proc. VLDB Endow. 9 (10) (2016)
Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren
Parallel Evaluation of Multi-Semi-Joins. CoRR (2016)
Eryk Kopczynski, Tony Tan
Regular Graphs and the Spectra of Two-Variable Logic with Counting. SIAM J. Comput. 44 (3) (2015)
Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan
Distributed Streaming with Finite Memory. ICDT (2015)
Jonny Daenen, Frank Neven, Tony Tan
Gumbo: Guarded Fragment Queries over Big Data. EDBT (2015)
Leonid Libkin, Tony Tan, Domagoj Vrgoc
Regular expressions for data words. J. Comput. Syst. Sci. 81 (7) (2015)
Eryk Kopczynski, Tony Tan
On the Variable Hierarchy of First-Order Spectra. ACM Trans. Comput. Log. 16 (2) (2015)
Tony Tan
Extending two-variable logic on data trees with order on data values and its automata. ACM Trans. Comput. Log. 15 (1) (2014)
Eryk Kopczynski, Tony Tan
A note on the variable hierarchy of first-order spectra. CoRR (2014)
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. CoRR (2014)
Tony Tan, Domagoj Vrgoc
Regular Expressions for Querying Data graphs. Int. J. Found. Comput. Sci. 25 (8) (2014)
Tony Tan
Graph Reachability and Pebble Automata over Infinite Alphabets. ACM Trans. Comput. Log. 14 (3) (2013)
Leonid Libkin, Tony Tan, Domagoj Vrgoc
Regular Expressions with Binding over Data Words for Querying Graph Databases. Developments in Language Theory (2013)
Eryk Kopczynski, Tony Tan
Regular graphs and the spectra of two-variable logic with counting CoRR (2013)
Amélie Gheerbrant, Leonid Libkin, Tony Tan
On the complexity of query answering over incomplete XML documents. ICDT (2012)
Tony Tan
An Automata Model for Trees with Ordered Data Values. LICS (2012)
Claire David, Leonid Libkin, Tony Tan
Efficient reasoning about data trees via integer linear programming. ACM Trans. Database Syst. 37 (3) (2012)
Tony Tan
Automata for two-variable logic over trees with ordered data values CoRR (2012)
Ahmet Kara, Thomas Schwentick, Tony Tan
Feasible Automata for Two-Variable Logic with Successor on Data Words. LATA (2012)
Ahmet Kara, Thomas Schwentick, Tony Tan
Feasible Automata for Two-Variable Logic with Successor on Data Words CoRR (2011)
Tony Tan
Graph Reachability and Pebble Automata over Infinite Alphabets CoRR (2011)
Juan L. Reutter, Tony Tan
A Formalism for Graph Databases and its Model of Computation. AMW (2011)
Claire David, Leonid Libkin, Tony Tan
Efficient reasoning about data trees via integer linear programming. ICDT (2011)
Claire David, Leonid Libkin, Tony Tan
On the Satisfiability of Two-Variable Logic over Data Words. LPAR (Yogyakarta) (2010)
Michael Kaminski, Tony Tan
A Note on Two-pebble Automata Over Infinite Alphabets. Fundam. Informaticae 98 (4) (2010)
Ahmet Kara, Tony Tan
Extending Büchi Automata with Constraints on Data Values CoRR (2010)
Tony Tan
On pebble automata for data languages with decidable emptiness problem. J. Comput. Syst. Sci. 76 (8) (2010)
Tony Tan
Graph Reachability and Pebble Automata over Infinite Alphabets. LICS (2009)
Tony Tan
On Pebble Automata for Data Languages with Decidable Emptiness Problem. MFCS (2009)
Tony Tan
On Pebble Automata for Data Languages with Decidable Emptiness Problem. CoRR (2009)
Michael Kaminski, Tony Tan
Tree Automata over Infinite Alphabets. Pillars of Computer Science (2008)
Ho-Lun Cheng, Tony Tan
Approximating polyhedral objects with deformable smooth surfaces. Comput. Geom. 39 (2) (2008)
Michael Kaminski, Tony Tan
Regular Expressions for Languages over Infinite Alphabets. Fundam. Informaticae 69 (3) (2006)
Ho-Lun Cheng, Tony Tan
Approximating Polygonal Objects by Deformable Smooth Surfaces. MFCS (2005)
Michael Kaminski, Tony Tan
Regular Expressions for Languages over Infinite Alphabets. COCOON (2004)
Ho-Lun Cheng, Tony Tan
Subdividing Alpha Complex. FSTTCS (2004)