Irène Guessarian

Publication Activity (10 Years)

Years Active: 1974-2022
Publications (10 Years): 6

Top Topics

Conceptual Spaces

Piecewise Affine

Weak Perspective

Top Venues

Computing with New Resources

Fundam. Informaticae

Publications

André Arnold, Patrick Cégielski, Irène Guessarian
Affine Completeness of Some Free Binary Algebras. Fundam. Informaticae 186 (1-4) (2022)
André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian
The algebra of binary trees is affine complete. Discret. Math. Theor. Comput. Sci. 23 (2) (2021)
André Arnold, Patrick Cégielski, Irène Guessarian
Affine completeness of some free binary algebras. CoRR (2021)
André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian
The algebra of binary trees is affine complete. CoRR (2020)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
Congruence Preservation, Lattices and Recognizability. CoRR (2020)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials. Integers 16 (2016)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
Arithmetical Congruence Preservation: From Finite to Infinite. Fields of Logic and Computation II (2015)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials. CoRR (2015)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
On lattices of regular sets of natural integers closed under decrementation. Inf. Process. Lett. 114 (4) (2014)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
Integral Difference Ratio Functions on Integers. Computing with New Resources (2014)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
Newton representation of functions over natural integers having integral difference ratios. CoRR (2013)
Patrick Cégielski, Serge Grigorieff, Irène Guessarian
On Lattices of Regular Sets of Natural Integers Closed under Decrementation. CoRR (2013)
Patrick Cégielski, Irène Guessarian
Normalization of Some Extended Abstract State Machines. Fields of Logic and Computation (2010)
Eugénie Foustoucos, Irène Guessarian
Inf-datalog, Modal Logic and Complexities. RAIRO Theor. Informatics Appl. 43 (1) (2009)
Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
Tree inclusion problems. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Ahmed Ait-Bouziad, Irène Guessarian, Laurent Vieille
Automatic generation of simplified weakest preconditions for integrity constraint verification CoRR (2006)
Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
Multiple serial episodes matching. Inf. Process. Lett. 98 (6) (2006)
Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
Multiple serial episode matching CoRR (2006)
Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich
Window Subsequence Problems for Compressed Texts. CSR (2006)
Eugénie Foustoucos, Irène Guessarian
Complexity of Monadic inf-datalog. Application to temporal logic CoRR (2006)
Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian
On relating CTL to Datalog CoRR (2005)
Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati
On temporal logic versus datalog. Theor. Comput. Sci. 303 (1) (2003)
Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian
From CTL to Datalog. PCK50 (2003)
Foto N. Afrati, Irène Guessarian, Michel de Rougemont
The expressiveness of DAC. Theor. Comput. Sci. 286 (1) (2002)
Irène Guessarian
Editorial. J. Log. Comput. 12 (2) (2002)
Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
Window-accumulated subsequence matching problem is linear. Ann. Pure Appl. Log. 113 (1-3) (2001)
Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
Window-Accumulated Subsequence Matching Problem is Linear. PODS (1999)
Nacéra Bensaou, Irène Guessarian
Transforming Constraint Logic Programs. Theor. Comput. Sci. 206 (1-2) (1998)
Jozef Gruska, Irène Guessarian
Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations. J. Autom. Lang. Comb. 2 (2) (1997)
Foto N. Afrati, Irène Guessarian, Michel de Rougemont
The Expressiveness of Datalog Circuits (DAC). MFCS (1997)
Irène Guessarian, Jean-Eric Pin
Linearizing Some Recursive Logic Programs. IEEE Trans. Knowl. Data Eng. 7 (1) (1995)
Jozef Gruska, Irène Guessarian
Correctness of Basic Systolic Systems Transformations. IFIP Congress (1) (1994)
Irène Guessarian, Marcos Veloso Peixoto
Programs. J. Log. Comput. 4 (4) (1994)
Nacéra Bensaou, Irène Guessarian
Transforming Constraint Logic Programs. STACS (1994)
Nacéra Bensaou, Irène Guessarian
An Extended Transformation System for CLP Programs. LOPSTR (1994)
Irène Guessarian, Marcos Veloso Peixoto
About Boundedness for some DATALOG and DATALOG_neg Programs. MFCS (1992)
Irène Guessarian
About Algebras, Fixpoints and Semantics. AMAST (1991)
Irène Guessarian
Deciding Boundedness for Uniformly Connected Datalog Programs. ICDT (1990)
Irène Guessarian
About Fixpoints for Concurrency. Semantics of Systems of Concurrent Processes (1990)
Irène Guessarian
Fixpoint strategies for deductive databases. Discret. Appl. Math. 24 (1-3) (1989)
Irène Guessarian, D. Perrin
LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity. SIGACT News 20 (4) (1989)
Georges Gardarin, Irène Guessarian, Christophe de Maindreville
Translation of Logic Programs into Functional Fixpoint Equations. Theor. Comput. Sci. 63 (3) (1989)
Irène Guessarian
Improving Fixpoint Toole for Computer Science. IFIP Congress (1989)
Irène Guessarian, Wafaa Niar-Dinedane
Fairness and Regularity for Sccs Processes. RAIRO Theor. Informatics Appl. 23 (1) (1989)
Irène Guessarian
A characterization of fair computations of finite state SCCS processes. Formal Properties of Finite Automata and Applications (1988)
Irène Guessarian
A Note On Fixpoint Techniques in Data Base Recursive Logic Programs. RAIRO Theor. Informatics Appl. 22 (1) (1988)
Irène Guessarian, Lutz Priese
On the Minimal Number of * Operators to Model Regularity in Fair SCCS. Inf. Process. Lett. 29 (6) (1988)
Irène Guessarian
Fixpoint strategies for deductive databases. Bull. EATCS 35 (1988)
Irène Guessarian, Wafaa Niar-Dinedane
An Automaton Characterization of Fairness in SCCS. STACS (1988)
Irène Guessarian
Equational Axiomatizations of If-Then-Else. CTRS (1987)
M. Chadili, Irène Guessarian
Notions of fairness for synchronous fork join nets. Formal Description of Programming Concepts (1987)
Hajnal Andréka, Irène Guessarian, István Németi
A Unifying Theorem for Algebraic Semantics and Dynamic Logics Inf. Comput. 72 (1) (1987)
David B. Benson, Irène Guessarian
Algebraic Solutions to Recursion Schemes. J. Comput. Syst. Sci. 35 (3) (1987)
Irène Guessarian, José Meseguer
On the Axiomatization of "If-Then-Else". SIAM J. Comput. 16 (2) (1987)
Irène Guessarian
Fixpoint techniques in data base recursive logic programs. Bull. EATCS 29 (1986)
Hajnal Andréka, Irène Guessarian, István Németi
A unifying theorem for algebraic semantics and dynamic logics. FCT (1985)
Irène Guessarian
Pushdown Tree Automata. Math. Syst. Theory 16 (4) (1983)
Irène Guessarian
Survey on classes of interpretations and some of their applications. SIGACT News 15 (3) (1983)
Irène Guessarian, Francesco Parisi-Presicce
Iterative vs. regular factor algebras. SIGACT News 15 (2) (1983)
Irène Guessarian
On Pushdown Tree Automata. CAAP (1981)
Werner Damm, Irène Guessarian
Combining T and level-N. MFCS (1981)
F. Ermine, Irène Guessarian
About Program Termination and Simplification. Symposium on Programming (1980)
Irène Guessarian
Program Transformations and Algebraic Semantics. Theor. Comput. Sci. 9 (1979)
Irène Guessarian
On Continuous Completions. Theoretical Computer Science (1979)
Bruno Courcelle, Irène Guessarian
On Some Classes of Interpretations. J. Comput. Syst. Sci. 17 (3) (1978)
Irène Guessarian
A propos de la sémantique de l'appel par valeur selon A. Arnold. RAIRO Theor. Informatics Appl. 12 (4) (1978)
Irène Guessarian
Some Applications of Algebraic Semantics. MFCS (1978)
Irène Guessarian
Tests et leur Caractérisation Syntaxique. RAIRO Theor. Informatics Appl. 11 (2) (1977)
Irène Guessarian
Semantic Equivalence of Program Schemes and its Syntactic Characterization. ICALP (1976)
Irène Guessarian
Equivalence dans l'algèbre ds schémas de programmes. Symposium on Programming (1974)