Tony Tan

72 papers A* 8A 5B 6C 2Misc 1Journal 41Unranked 7
YearRankTypeTitle / Venue / Authors
2026 B conf
Analysis of Logics with Arithmetic.
CSL
Michael Benedikt, Chia-Hsuan Lu, Tony Tan
2026 A* conf
Model Counting for Dependency Quantified Boolean Formulas.
AAAI
Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan
2026 — conf
Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing.
TACAS (1)
Chia-Hsuan Lu, Tony Tan, Michael Benedikt
2025 J jnl
Analysis of logics with arithmetic.
CoRR
Michael Benedikt, Chia-Hsuan Lu, Tony Tan
2025 J jnl
Extracting Robust Register Automata from Neural Networks over Data Sequences.
CoRR
Chih-Duo Hong, Hongjian Jiang, Anthony W. Lin, Oliver Markgraf, Julian Parsert, Tony Tan
2025 A conf
Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas.
SAT
Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan
2025 — book
Future Human - Consciousness, Cognition and the Role of Human Insight in an AI Future
Future Human
Tony Tan
2025 J jnl
Model Counting for Dependency Quantified Boolean Formulas.
CoRR
Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan
2025 J jnl
Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing.
CoRR
Chia-Hsuan Lu, Tony Tan, Michael Benedikt
2025 A* conf
Separation and Definability in Fragments of Two-Variable First-Order Logic with Counting.
LICS
Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev
2025 J jnl
Separation and Definability in Fragments of Two-Variable First-Order Logic with Counting.
CoRR
Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev
2024 B conf
2-DQBF Solving and Certification via Property-Directed Reachability Analysis.
FMCAD
Long-Hin Fung, Che Cheng, Yu-Wei Fan, Tony Tan, Jie-Hong Roland Jiang
2024 A* conf
Decidability of Graph Neural Networks via Logical Characterizations.
ICALP
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
2024 J jnl
Decidability of Graph Neural Networks via Logical Characterizations.
CoRR
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan
2024 J jnl
On two-variable guarded fragment logic with expressive local Presburger constraints.
Log. Methods Comput. Sci.
Chia-Hsuan Lu, Tony Tan
2024 — conf
Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract).
Description Logics
Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev
2024 J jnl
Two Variable Logic with Ultimately Periodic Counting.
SIAM J. Comput.
Michael Benedikt, Egor V. Kostylev, Tony Tan
2023 A conf
On the Complexity of k-DQBF.
SAT
Long-Hin Fung, Tony Tan
2022 J jnl
On two-variable guarded fragment logic with expressive local Presburger constraints.
CoRR
Chia-Hsuan Lu, Tony Tan
2022 B conf
Reducing NEXP-complete problems to DQBF.
FMCAD
Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan
2022 J jnl
Reducing NEXP-complete problems to DQBF.
CoRR
Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan
2021 J jnl
A simple combinatorial proof for the small model property of two-variable logic.
Inf. Process. Lett.
Yanger Ma, Tony Tan
2021 — conf
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics.
FSTTCS
Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan
2021 J jnl
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics.
CoRR
Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan
2021 J jnl
Subsequence versus substring constraints in sequence pattern languages.
Acta Informatica
Steven Engels, Tony Tan, Jan Van den Bussche
2021 A* conf
Towards a more efficient approach for the satisfiability of two-variable logic.
LICS
Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan
2021 J jnl
Towards a more efficient approach for the satisfiability of two-variable logic.
CoRR
Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan
2020 A* conf
Two Variable Logic with Ultimately Periodic Counting.
ICALP
Michael Benedikt, Egor V. Kostylev, Tony Tan
2020 J jnl
Two variable logic with ultimately periodic counting.
CoRR
Michael Benedikt, Egor V. Kostylev, Tony Tan
2019 J jnl
Two-variable logic revisited.
CoRR
Yanger Ma, Tony Tan
2018 J jnl
A note on first-order spectra with binary relations.
Log. Methods Comput. Sci.
Eryk Kopczynski, Tony Tan
2018 J jnl
Finite-State Map-Reduce Computation and Relational Algebra Queries.
ACM Trans. Comput. Log.
Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan
2017 J jnl
A note on first-order spectra with binary relations.
CoRR
Eryk Kopczynski, Tony Tan
2017 A* conf
Register automata with linear arithmetic.
LICS
Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
2017 J jnl
Register automata with linear arithmetic.
CoRR
Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
2016 J jnl
Parallel Evaluation of Multi-Semi-Joins.
CoRR
Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren
2016 J jnl
Parallel Evaluation of Multi-Semi-Joins.
Proc. VLDB Endow.
Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren
2015 A conf
Distributed Streaming with Finite Memory.
ICDT
Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan
2015 B conf
Gumbo: Guarded Fragment Queries over Big Data.
EDBT
Jonny Daenen, Frank Neven, Tony Tan
2015 J jnl
On the Variable Hierarchy of First-Order Spectra.
ACM Trans. Comput. Log.
Eryk Kopczynski, Tony Tan
2015 J jnl
Regular Graphs and the Spectra of Two-Variable Logic with Counting.
SIAM J. Comput.
Eryk Kopczynski, Tony Tan
2015 J jnl
Regular expressions for data words.
J. Comput. Syst. Sci.
Leonid Libkin, Tony Tan, Domagoj Vrgoc
2014 J jnl
A note on the variable hierarchy of first-order spectra.
CoRR
Eryk Kopczynski, Tony Tan
2014 J jnl
Extending two-variable logic on data trees with order on data values and its automata.
ACM Trans. Comput. Log.
Tony Tan
2014 J jnl
Regular Expressions for Querying Data graphs.
Int. J. Found. Comput. Sci.
Tony Tan, Domagoj Vrgoc
2014 J jnl
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference.
CoRR
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
2013 J jnl
Graph Reachability and Pebble Automata over Infinite Alphabets.
ACM Trans. Comput. Log.
Tony Tan
2013 C conf
Regular Expressions with Binding over Data Words for Querying Graph Databases.
Developments in Language Theory
Leonid Libkin, Tony Tan, Domagoj Vrgoc
2013 J jnl
Regular graphs and the spectra of two-variable logic with counting
CoRR
Eryk Kopczynski, Tony Tan
2012 A* conf
An Automata Model for Trees with Ordered Data Values.
LICS
Tony Tan
2012 J jnl
Automata for two-variable logic over trees with ordered data values
CoRR
Tony Tan
2012 J jnl
Efficient reasoning about data trees via integer linear programming.
ACM Trans. Database Syst.
Claire David, Leonid Libkin, Tony Tan
2012 C conf
Feasible Automata for Two-Variable Logic with Successor on Data Words.
LATA
Ahmet Kara, Thomas Schwentick, Tony Tan
2012 A conf
On the complexity of query answering over incomplete XML documents.
ICDT
Amélie Gheerbrant, Leonid Libkin, Tony Tan
2011 — conf
A Formalism for Graph Databases and its Model of Computation.
AMW
Juan L. Reutter, Tony Tan
2011 A conf
Efficient reasoning about data trees via integer linear programming.
ICDT
Claire David, Leonid Libkin, Tony Tan
2011 J jnl
Feasible Automata for Two-Variable Logic with Successor on Data Words
CoRR
Ahmet Kara, Thomas Schwentick, Tony Tan
2011 J jnl
Graph Reachability and Pebble Automata over Infinite Alphabets
CoRR
Tony Tan
2010 J jnl
A Note on Two-pebble Automata Over Infinite Alphabets.
Fundam. Informaticae
Michael Kaminski, Tony Tan
2010 J jnl
Extending Büchi Automata with Constraints on Data Values
CoRR
Ahmet Kara, Tony Tan
2010 J jnl
On pebble automata for data languages with decidable emptiness problem.
J. Comput. Syst. Sci.
Tony Tan
2010 — conf
On the Satisfiability of Two-Variable Logic over Data Words.
LPAR (Yogyakarta)
Claire David, Leonid Libkin, Tony Tan
2009 A* conf
Graph Reachability and Pebble Automata over Infinite Alphabets.
LICS
Tony Tan
2009 B conf
On Pebble Automata for Data Languages with Decidable Emptiness Problem.
MFCS
Tony Tan
2009 J jnl
On Pebble Automata for Data Languages with Decidable Emptiness Problem.
CoRR
Tony Tan
2009 — —
Pebble automata for data languages: separation, decidability, and undecidability.
Tony Tan
2008 J jnl
Approximating polyhedral objects with deformable smooth surfaces.
Comput. Geom.
Ho-Lun Cheng, Tony Tan
2008 — conf
Tree Automata over Infinite Alphabets.
Pillars of Computer Science
Michael Kaminski, Tony Tan
2006 J jnl
Regular Expressions for Languages over Infinite Alphabets.
Fundam. Informaticae
Michael Kaminski, Tony Tan
2005 B conf
Approximating Polygonal Objects by Deformable Smooth Surfaces.
MFCS
Ho-Lun Cheng, Tony Tan
2004 Misc conf
Regular Expressions for Languages over Infinite Alphabets.
COCOON
Michael Kaminski, Tony Tan
2004 — conf
Subdividing Alpha Complex.
FSTTCS
Ho-Lun Cheng, Tony Tan