default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrène Guessarian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1981
[b1]Irène Guessarian:
Algebraic Semantics. Lecture Notes in Computer Science 99, Springer 1981, ISBN 3-540-10284-1
Journal Articles
- 2022
- [j33]André Arnold, Patrick Cégielski, Irène Guessarian:
Affine Completeness of Some Free Binary Algebras. Fundam. Informaticae 186(1-4): 27-44 (2022) - 2021
- [j32]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) - 2016
- [j31]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials. Integers 16: A50 (2016) - 2014
- [j30]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
On lattices of regular sets of natural integers closed under decrementation. Inf. Process. Lett. 114(4): 197-202 (2014) - 2009
- [j29]Eugénie Foustoucos, Irène Guessarian:
Inf-datalog, Modal Logic and Complexities. RAIRO Theor. Informatics Appl. 43(1): 1-21 (2009) - 2008
- [j28]Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
:
Tree inclusion problems. RAIRO Theor. Informatics Appl. 42(1): 5-20 (2008) - 2006
- [j27]Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Multiple serial episodes matching. Inf. Process. Lett. 98(6): 211-218 (2006) - 2003
- [j26]Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati:
On temporal logic versus datalog. Theor. Comput. Sci. 303(1): 103-133 (2003) - 2002
- [j25]Irène Guessarian:
Editorial. J. Log. Comput. 12(2): 215 (2002) - [j24]Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
The expressiveness of DAC. Theor. Comput. Sci. 286(1): 3-32 (2002) - 2001
- [j23]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): 59-80 (2001) - 1998
- [j22]Nacéra Bensaou, Irène Guessarian:
Transforming Constraint Logic Programs. Theor. Comput. Sci. 206(1-2): 81-125 (1998) - 1997
- [j21]Jozef Gruska, Irène Guessarian:
Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations. J. Autom. Lang. Comb. 2(2): 93-133 (1997) - 1995
- [j20]Irène Guessarian, Jean-Eric Pin:
Linearizing Some Recursive Logic Programs. IEEE Trans. Knowl. Data Eng. 7(1): 137-149 (1995) - 1994
- [j19]Irène Guessarian, Marcos Veloso Peixoto:
About Boundedness for Some Datalog and Datalogneg Programs. J. Log. Comput. 4(4): 375-403 (1994) - 1989
- [j18]Irène Guessarian:
Fixpoint strategies for deductive databases. Discret. Appl. Math. 24(1-3): 121-131 (1989) - [j17]Irène Guessarian, Wafaa Niar-Dinedane:
Fairness and Regularity for Sccs Processes. RAIRO Theor. Informatics Appl. 23(1): 59-86 (1989) - [j16]Irène Guessarian, D. Perrin:
LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity. SIGACT News 20(4): 50-53 (1989) - [j15]Georges Gardarin, Irène Guessarian, Christophe de Maindreville:
Translation of Logic Programs into Functional Fixpoint Equations. Theor. Comput. Sci. 63(3): 253-274 (1989) - 1988
- [j14]Irène Guessarian:
Fixpoint strategies for deductive databases. Bull. EATCS 35: 128-136 (1988) - [j13]Irène Guessarian, Lutz Priese:
On the Minimal Number of * Operators to Model Regularity in Fair SCCS. Inf. Process. Lett. 29(6): 297-300 (1988) - [j12]Irène Guessarian:
A Note On Fixpoint Techniques in Data Base Recursive Logic Programs. RAIRO Theor. Informatics Appl. 22(1): 49-56 (1988) - 1987
- [j11]Hajnal Andréka, Irène Guessarian, István Németi:
A Unifying Theorem for Algebraic Semantics and Dynamic Logics. Inf. Comput. 72(1): 31-45 (1987) - [j10]David B. Benson, Irène Guessarian:
Algebraic Solutions to Recursion Schemes. J. Comput. Syst. Sci. 35(3): 365-400 (1987) - [j9]Irène Guessarian, José Meseguer:
On the Axiomatization of "If-Then-Else". SIAM J. Comput. 16(2): 332-357 (1987) - 1986
- [j8]Irène Guessarian:
Fixpoint techniques in data base recursive logic programs. Bull. EATCS 29: 32-34 (1986) - 1983
- [j7]Irène Guessarian:
Pushdown Tree Automata. Math. Syst. Theory 16(4): 237-263 (1983) - [j6]Irène Guessarian, Francesco Parisi-Presicce:
Iterative vs. regular factor algebras. SIGACT News 15(2): 32-44 (1983) - [j5]Irène Guessarian:
Survey on classes of interpretations and some of their applications. SIGACT News 15(3): 45-71 (1983) - 1979
- [j4]Irène Guessarian:
Program Transformations and Algebraic Semantics. Theor. Comput. Sci. 9: 39-65 (1979) - 1978
- [j3]Irène Guessarian:
A propos de la sémantique de l'appel par valeur selon A. Arnold. RAIRO Theor. Informatics Appl. 12(4): 287-289 (1978) - [j2]Bruno Courcelle, Irène Guessarian:
On Some Classes of Interpretations. J. Comput. Syst. Sci. 17(3): 406-431 (1978) - 1977
- [j1]Irène Guessarian:
Tests et leur Caractérisation Syntaxique. RAIRO Theor. Informatics Appl. 11(2): 133-156 (1977)
Conference and Workshop Papers
- 2015
- [c27]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Arithmetical Congruence Preservation: From Finite to Infinite. Fields of Logic and Computation II 2015: 210-225 - 2014
- [c26]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Integral Difference Ratio Functions on Integers. Computing with New Resources 2014: 277-291 - 2010
- [c25]Patrick Cégielski, Irène Guessarian:
Normalization of Some Extended Abstract State Machines. Fields of Logic and Computation 2010: 165-180 - 2006
- [c24]Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich:
Window Subsequence Problems for Compressed Texts. CSR 2006: 127-136 - 2003
- [c23]Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian:
From CTL to Datalog. PCK50 2003: 72-85 - 1999
- [c22]Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Window-Accumulated Subsequence Matching Problem is Linear. PODS 1999: 327-336 - 1997
- [c21]Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
The Expressiveness of Datalog Circuits (DAC). MFCS 1997: 119-128 - 1994
- [c20]Jozef Gruska, Irène Guessarian:
Correctness of Basic Systolic Systems Transformations. IFIP Congress (1) 1994: 315-321 - [c19]Nacéra Bensaou, Irène Guessarian:
An Extended Transformation System for CLP Programs. LOPSTR 1994: 17-35 - [c18]Nacéra Bensaou, Irène Guessarian:
Transforming Constraint Logic Programs. STACS 1994: 33-46 - 1992
- [c17]Irène Guessarian, Marcos Veloso Peixoto:
About Boundedness for some DATALOG and DATALOG_neg Programs. MFCS 1992: 284-297 - 1991
- [c16]Irène Guessarian:
About Algebras, Fixpoints and Semantics. AMAST 1991: 497-528 - 1990
- [c15]Irène Guessarian:
Deciding Boundedness for Uniformly Connected Datalog Programs. ICDT 1990: 395-405 - [c14]Irène Guessarian:
About Fixpoints for Concurrency. Semantics of Systems of Concurrent Processes 1990: 358-374 - 1989
- [c13]Irène Guessarian:
Improving Fixpoint Toole for Computer Science. IFIP Congress 1989: 1109-1114 - 1988
- [c12]Irène Guessarian:
A characterization of fair computations of finite state SCCS processes. Formal Properties of Finite Automata and Applications 1988: 234-248 - [c11]Irène Guessarian, Wafaa Niar-Dinedane:
An Automaton Characterization of Fairness in SCCS. STACS 1988: 356-372 - 1987
- [c10]Irène Guessarian:
Equational Axiomatizations of If-Then-Else. CTRS 1987: 98-110 - [c9]M. Chadili, Irène Guessarian:
Notions of fairness for synchronous fork join nets. Formal Description of Programming Concepts 1987: 325-346 - 1985
- [c8]Hajnal Andréka, Irène Guessarian, István Németi:
A unifying theorem for algebraic semantics and dynamic logics. FCT 1985: 8-17 - 1981
- [c7]Irène Guessarian:
On Pushdown Tree Automata. CAAP 1981: 211-223 - [c6]Werner Damm, Irène Guessarian:
Combining T and level-N. MFCS 1981: 262-270 - 1980
- [c5]F. Ermine, Irène Guessarian:
About Program Termination and Simplification. Symposium on Programming 1980: 123-135 - 1979
- [c4]Irène Guessarian:
On Continuous Completions. Theoretical Computer Science 1979: 142-152 - 1978
- [c3]Irène Guessarian:
Some Applications of Algebraic Semantics. MFCS 1978: 257-266 - 1976
- [c2]Irène Guessarian:
Semantic Equivalence of Program Schemes and its Syntactic Characterization. ICALP 1976: 189-200 - 1974
- [c1]Irène Guessarian:
Equivalence dans l'algèbre ds schémas de programmes. Symposium on Programming 1974: 204-220
Parts in Books or Collections
- 1992
- [p1]Irène Guessarian:
Trees and algebraic semantics. Tree Automata and Languages 1992: 291-310
Editorship
- 1990
- [e1]Irène Guessarian:
Semantics of Systems of Concurrent Processes, LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, Proceedings. Lecture Notes in Computer Science 469, Springer 1990, ISBN 3-540-53479-2 [contents]
Informal and Other Publications
- 2021
- [i10]André Arnold, Patrick Cégielski, Irène Guessarian:
Affine completeness of some free binary algebras. CoRR abs/2106.12846 (2021) - 2020
- [i9]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Congruence Preservation, Lattices and Recognizability. CoRR abs/2004.05943 (2020) - [i8]André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
The algebra of binary trees is affine complete. CoRR abs/2011.03925 (2020) - 2015
- [i7]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials. CoRR abs/1506.00133 (2015) - 2013
- [i6]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
On Lattices of Regular Sets of Natural Integers Closed under Decrementation. CoRR abs/1310.1378 (2013) - [i5]Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
Newton representation of functions over natural integers having integral difference ratios. CoRR abs/1310.1507 (2013) - 2006
- [i4]Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Multiple serial episode matching. CoRR abs/cs/0603050 (2006) - [i3]Ahmed Ait-Bouziad, Irène Guessarian, Laurent Vieille:
Automatic generation of simplified weakest preconditions for integrity constraint verification. CoRR abs/cs/0603053 (2006) - [i2]Eugénie Foustoucos, Irène Guessarian:
Complexity of Monadic inf-datalog. Application to temporal logic. CoRR abs/cs/0603122 (2006) - 2005
- [i1]Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian:
On relating CTL to Datalog. CoRR abs/cs/0510012 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
