default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançoise Gire
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j9]Hicham Idabal, Françoise Gire:
Requêtes arbres régulières pour l'analyse de dépendances entre vues et mises à jour de documents XML. Ingénierie des Systèmes d Inf. 15(1): 113-138 (2010)- [c9]Françoise Gire, Hicham Idabal:
Regular tree patterns: a uniform formalism for update queries and functional dependencies in XML. EDBT/ICDT Workshops 2010
2000 – 2009
- 2009
- [j8]Françoise Gire, Jean-Marc Talbot:
Nested Sibling Tree Automata. RAIRO Theor. Informatics Appl. 43(2): 379-402 (2009) - 2008
- [c8]Françoise Gire, Hicham Idabal:
Updates and views dependencies in semi-structured databases. IDEAS 2008: 159-168 - 2005
- [j7]Françoise Gire, Corinne Plourde:
A New Partial Semantics for Disjunctive Deductive Databases. Fundam. Informaticae 67(4): 323-342 (2005)
1990 – 1999
- 1999
- [c7]Françoise Gire, Catherine Plourde:
A Partial Semantics for Disjunctive Deductive Databases. Proc. 15èmes Journées Bases de Données Avancées, BDA 1999: 159-178 - 1998
- [j6]Françoise Gire, H. Khanh Hoang:
An Extension of Fixpoint Logic with a Symmetry-Based Choice Construct. Inf. Comput. 144(1): 40-65 (1998) - 1996
- [c6]Françoise Gire, H. Khanh Hoang:
A More Expressive Deterministic Query Language with Efficient Symmetry-Based Choice Construct. Logic in Databases 1996: 475-495 - 1995
- [c5]Françoise Gire, H. Khanh Hoang:
On Relations between the Dynamic Choice Constructs and the Stable Semantics. BDA 1995: 283-302 - 1994
- [j5]Françoise Gire:
Equivalence of Well-Founded and Stable Semantics. J. Log. Program. 21(2): 95-111 (1994) - 1992
- [c4]Françoise Gire:
Well Founded Semantics and Stable Semantics of Semi-Strict Programs. ICDT 1992: 261-275 - 1991
- [j4]Françoise Gire, Maurice Nivat:
Langages algébriques de mots biinfinis. Theor. Comput. Sci. 86(2): 277-323 (1991) - 1990
- [c3]Françoise Gire:
Modèles par défaut des programmes effectivement déterministes. BDA 1990: 71-
1980 – 1989
- 1987
- [j3]Joffroy Beauquier, Françoise Gire:
Une Note sur le Théorème de Caractérisation des Générateurs Algébriques. Theor. Comput. Sci. 51: 117-127 (1987) - 1986
- [b1]Françoise Gire:
Contribution a l'etude des relations et langages infinitaires. Univ. Paris, 1986, pp. I-XVIII, 1-188 - [j2]Françoise Gire:
Two Decidability Problems for Infinite Words. Inf. Process. Lett. 22(3): 135-140 (1986) - 1984
- [j1]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire:
Bicentres de langages algébriques. Acta Informatica 21: 209-227 (1984) - 1983
- [c2]Joffroy Beauquier, Françoise Gire:
On Context-Free Generators. FOCS 1983: 215 - [c1]Françoise Gire:
Une extension aux mots infinis de la notion de transduction rationelle. Theoretical Computer Science 1983: 123-139
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 22:48 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:
