#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1995

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

Query patterns enable effective information tools and provide guidance to users interested in posing complex questions about objects. Semantically, query patterns represent important questions, while syntactically they impose the correct formulation of queries. In this paper we address the development of query patterns at successive representation layers so… (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. CTL, 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)

- 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)

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

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

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) infDatalog. We deduce a unified and… (More)

CTL is the dominant temporal specification language in practice mainly due to the fact that it admits model checking in linear time. Logic programming and the database query language Datalog are often used as an implementation platform for logic languages. In this paper we present the exact relation between CTL and Datalog and moreover we build on this… (More)

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

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, . . . ,Xk) 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)

- 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)

- ‹
- 1
- ›