|
9
|
On Computational Complexity of Basic Decision Problems of Finite Tree Automata
– Margus Veanes
- 1997
|
|
3
|
A Generalized Approach to Equational Unification
– Katherine Anne Yelick
- 1985
|
|
11
|
Foundations of rule-based query answering
– François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei
- 2007
|
|
1
|
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
– Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
- 1998
|
|
25
|
Xpath leashed
– Michael Benedikt, Christoph Koch
- 2007
|
|
2
|
Knowledge Representation and Classical Logic
– Vladimir Lifschitz, Leora Morgenstern
|
|
3
|
A Strict Border for the Decidability of E-Unification for Recursive Functions
– Sebastian Maneth, Heinz Faßbender
- 1998
|
|
1
|
Ambiguity, Valuedness and Costs
– Helmut Seidl
- 1992
|
|
9
|
Processing Queries on Tree-Structured Data Efficiently
– Christoph Koch
- 2006
|
|
240
|
Complexity and Expressive Power of Logic Programming
– Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
- 1997
|
|
2
|
Rewriting Systems
– Johan Boye, Jan Maluszynski, Ulf Nilsson
- 1999
|
|
11
|
The Decidability of Simultaneous Rigid E-Unification with One Variable
– Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
- 1997
|
|
27
|
Bi-rewrite systems
– Jordi Levy, Jaume Agusti
- 1996
|
|
6
|
Trips on Trees
– Joost Engelfriet , Hendrik Jan Hoogeboom, Jan-Pascal Van Best
- 1999
|
|
15
|
MSO definable string transductions and two-way finite state transducers
– Joost Engelfriet, Hendrik Jan Hoogeboom
- 1998
|
|
8
|
Model Theoretic Syntax
– Thomas Cornell, James Rogers
- 1998
|
|
7
|
Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic
– Martin Müller, Joachim Niehren
- 1998
|
|
44
|
A Descriptive Approach to Language-Theoretic Complexity
– James Rogers
- 1996
|
|
5
|
Algorithmic Meta-Theorems
– Stephan Kreutzer
- 2008
|
