I. Guessarian, P. Cegielski, Y. Matiyasevich, Tree Inclusion Problems , The original publication will be available at http://www.edpsciences.org/ita Copyright EDP Sciences.
I. Guessarian, E. Foustoucos, Inf-Datalog, Modal logic and Complexities, , The original publication will be available at http://www.edpsciences.org/ita Copyright EDP Sciences.
I. Guessarian, P. Cegielski, Y. Matiyasevich, Experimental results for Multiple serial episodes matching .
I. Guessarian, P. Cegielski, Y. Matiyasevich, Multiple serial episodes matching , to appear in IPL.
I. Guessarian, E. Foustoucos, Complexity of Monadic inf-Datalog. Application to temporal logic, Report LIAFA 2003-017, Full version of the paper in 4th Panhellenic Logic Symposium, 2003, 95-99.
I. Guessarian, E. Foustoucos, T. Andonikos, F. Afrati, Datalog versus temporal logics , TCS 303, 2003, 103-133.
I. Guessarian, Les points fixes en Informatique, Pour la Science, Février 2003, 70-71, version pdf.
I. Guessarian, L. Boasson, P. Cegielski, Y. Matiyasevich, Window-Accumulated Subsequence matching Problem is linear, PODS'99 Proceedings, 1999, 327-336.
I. Guessarian, J.E. Pin, Linearizing some recursive logic programs, IEEE Trans. on Knowledge and data engineering, 1995, 137-149.
I. Guessarian, M. Veloso, About Boundedness for some DATALOG and DATALOGneg programs, Journal of Logic and Computation, 4, 1994, 375-403.
I. Guessarian, N. Bensaou, Transforming constraint logic programs, TCS 206,1998, 81-125.
I. Guessarian, J. Gruska, Fixpoint semantics of synchronous systems and correctness of their basic transformations, Journal of Automata, Languages and combinatorics 2 (1997), 93-133.
I. Guessarian, J.-E. Pin, Linearizing some recursive logic programs, IEEE Transactions on Knowledge and Data Engineering 7 (1995), 137--149. Abstract, PostScript gzipped file, PDF file
I. Guessarian, F. Afrati, M. de Rougemont, The expressiveness of DAC, TCS 286 (2002), 3-32.