#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1995

2011

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos
- ACM Trans. Comput. Log.
- 2005

The relation between Datalog programs and homomorphism problems and between Datalog programs and bounded treewidth structures has been recognized for some time and given much attention recently. Additionally, the essential role of persistent variables (of program expansions) in solving several relevant problems has also started to be observed. It turns out… (More)

- Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati
- Theor. Comput. Sci.
- 2003

- Eugénie Foustoucos, Labrini Kalantzi
- Fundam. Inform.
- 2009

We propose automata-theoretic and datalog-based solutions for the Monadic Second Order (MSO) evaluation problem over finite structures of bounded treewidth, and then extend this approach to MSO-definable optimization problems. More precisely, we introduce decomposition-automata which can be thought as a generalization of assignment automata defined in [14];… (More)

- Eugénie Foustoucos, Irène Guessarian
- ArXiv
- 2006

In [] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CT L, alternation-free Modal µ-calculus and Modal µ-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model… (More)

- Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos
- ACM Trans. Comput. Log.
- 2010

The relation between Datalog programs and homomorphism problems, and, between Datalog programs and bounded treewidth structures has been recognized for some time and given much attention recently. Additionally, the essential role of persistent variables (in program expansions) for solving several relevant problems has also started to be observed. In Afrati… (More)

- Eugénie Foustoucos, S. Kazem Lellahi, Nicolas Spyratos
- JFPLC
- 1995

- Eugénie Foustoucos, Irène Guessarian
- ITA
- 2009

The MSO evaluation problem on trees is the problem of computing , for any MSO formula φ and any finite tree T , the set of satisfying assignments of φ(X1,. .. , X k) over T. In [3] we considered the MSO evaluation problem on full binary trees as a Datalog query evaluation problem, and gave a Datalog-theoretic solution to it for any MSO formula φ; we thus… (More)