| Publication | Date of Publication | Type |
|---|
Uniform Restricted Chase Termination
SIAM Journal on Computing | 2023-06-09 | Paper |
| scientific article; zbMATH DE number 7650980 (Why is no real title available?) | 2023-02-07 | Paper |
The first-order truth behind undecidability of regular path queries determinacy
(available as arXiv preprint) | 2022-07-21 | Paper |
Can One Escape Red Chains?
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Undecidability of the first order theory of one-step right ground rewriting
Rewriting Techniques and Applications | 2017-11-17 | Paper |
The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
STACS 96 | 2017-11-16 | Paper |
Converging to the chase -- a tool for finite controllability
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Converging to the chase -- a tool for finite controllability
Journal of Computer and System Sciences | 2016-09-16 | Paper |
All-instances termination of chase is undecidable
Automata, Languages, and Programming | 2014-07-01 | Paper |
The undecidability of the logic of subintervals
Fundamenta Informaticae | 2014-05-12 | Paper |
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence | 2012-10-01 | Paper |
B and D are enough to make the Halpern-Shoham logic undecidable
Automata, Languages and Programming | 2010-09-07 | Paper |
Disjunctive databases for representing repairs
Annals of Mathematics and Artificial Intelligence | 2010-08-13 | Paper |
Modulo constraints and the complexity of typechecking XML views
Theory of Computing Systems | 2009-08-06 | Paper |
On the Expressive Power of Graph Logic
Computer Science Logic | 2009-03-12 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Inconsistency Tolerance
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Minimal-change integrity maintenance using tuple deletions
Information and Computation | 2005-05-12 | Paper |
Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 1948167 (Why is no real title available?) | 2003-07-10 | Paper |
Thue trees
Annals of Pure and Applied Logic | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1688376 (Why is no real title available?) | 2002-01-09 | Paper |
The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
Information and Computation | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1424045 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1405661 (Why is no real title available?) | 2000-08-02 | Paper |
| scientific article; zbMATH DE number 1405620 (Why is no real title available?) | 2000-02-23 | Paper |
Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256672 (Why is no real title available?) | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1051701 (Why is no real title available?) | 1998-01-25 | Paper |
