Filtrer vos résultats
- 31
- 23
- 36
- 11
- 4
- 2
- 1
- 2
- 54
- 1
- 3
- 1
- 1
- 1
- 3
- 3
- 3
- 4
- 4
- 1
- 3
- 1
- 1
- 1
- 1
- 3
- 4
- 2
- 1
- 1
- 2
- 1
- 2
- 2
- 2
- 1
- 1
- 51
- 3
- 43
- 32
- 10
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 54
- 9
- 8
- 8
- 8
- 8
- 7
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
54 résultats
|
|
|
triés par
|
|
|
Polynomial Time Fragments of XPath with Variables26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2007, Beijing, China. pp.205-214
Communication dans un congrès
inria-00135678v1
|
||
Equality and disequality constraints on direct subterms in tree automataSTACS 1992, 1992, Cachan, France. pp.159-171
Communication dans un congrès
hal-02193917v1
|
|||
Homomorphisms and concurrent term rewritingFCT 1999 - International Symposium on Fundamentals of Computation Theory, Aug 1999, Iasi, Romania. pp.475-487, ⟨10.1007/3-540-48321-7_40⟩
Communication dans un congrès
istex
hal-02193779v1
|
|||
The Recognizability Problem for Tree Automata with Comparisons between BrothersFoundations of Software Science and Computation Structure, FoSSaCS'99,, 1999, Amsterdam, Netherlands. pp.150-164
Communication dans un congrès
hal-02193786v1
|
|||
|
|
Tree Automata With Global ConstraintsInternational Journal of Foundations of Computer Science, 2010, 21 (4), pp.571-596. ⟨10.1142/S012905411000743X⟩
Article dans une revue
hal-00526987v1
|
||
Theoretical Computer Science: Computational ComplexityA Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, 2020
Chapitre d'ouvrage
hal-02995771v1
|
|||
|
|
Complexity of Earliest Query Answering with Streaming Tree AutomataACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States
Communication dans un congrès
inria-00336169v1
|
||
Decidability of the Confluence of Ground Term Rewriting Systems.LICS 1987 - Second Annual IEEE Symposium on Logic in Computer Science, Jun 1987, Ithaca, New York, United States
Communication dans un congrès
hal-02193998v1
|
|||
|
|
Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphismsTheoretical Computer Science, 2002, 281 (1-2), pp.219-233. ⟨10.1016/S0304-3975(02)00014-2⟩
Article dans une revue
hal-02193763v1
|
||
|
|
Grid structures and undecidable constraint theoriesTheoretical Computer Science, 2001, 258 (1-2), pp.453-490. ⟨10.1016/S0304-3975(00)00032-3⟩
Article dans une revue
hal-02193758v1
|
||
Décidabilité et ComplexitéIA Handbook, Cépaduès, pp.1-63, 2010
Chapitre d'ouvrage
hal-00999661v1
|
|||
|
|
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systemsInformation and Computation, 1990, 88 (2), pp.187-201. ⟨10.1016/0890-5401(90)90015-A⟩
Article dans une revue
hal-02193891v1
|
||
Set-based analysis for logic programming and tree automataStatic Analysis, 4th International Symposium, SAS '97, 1997, Paris, France. pp.127-140
Communication dans un congrès
hal-02193771v1
|
|||
Metrical and ordered properties of powerdomainsFundamentals of Computation Theory, FCT'83, 1983, Borgholm, Sweden. pp.465-474
Communication dans un congrès
hal-02193994v1
|
|||
Regular Tree Languages and Rewrite SystemsFundamenta Informaticae, 1995, 24 (1/2), pp.157--176
Article dans une revue
inria-00538882v1
|
|||
Set constraints and automataInformation and Computation, 1999, 149 (1), pp.1--41
Article dans une revue
inria-00538886v1
|
|||
|
|
View update translation for XML14th International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden
Communication dans un congrès
inria-00534857v2
|
||
|
|
Oblivious and Semi-Oblivious Boundedness for Existential RulesIJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. pp.1581-1587, ⟨10.24963/ijcai.2019/219⟩
Communication dans un congrès
lirmm-02148142v1
|
||
|
|
Earliest Query Answering for Deterministic Nested Word Automata17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132
Communication dans un congrès
inria-00390236v2
|
||
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?22nd International Conference on Rewriting Techniques and Applications (RTA'11), Apr 2011, France. ⟨10.4230/LIPIcs.RTA.2011.1⟩
Communication dans un congrès
hal-00818127v1
|
|||
|
|
Expressiveness of a spatial logic for trees20th Annual IEEE Symposium on Logic in Computer Science, 2005, Chicago, United States. pp.280--289
Communication dans un congrès
inria-00536696v1
|
||
|
|
Queries on XML Streams with Bounded Delay and ConcurrencyInformation and Computation, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. ⟨10.1016/j.ic.2010.08.003⟩
Article dans une revue
inria-00491495v1
|
||
Some new Decidability Results on Positive and Negative Set ConstraintsProceedings of First International Conference on Constraints in Computational Logics, CCL'94, 1994, Munich, Germany. pp.336--351
Communication dans un congrès
inria-00538880v1
|
|||
|
|
Tree Automata with Global Constraints12th International Conference on Developments in Language Theory (DLT), Sep 2008, Kyoto, Japan. pp.314-326
Communication dans un congrès
inria-00292027v2
|
||
|
|
On Rewrite Constraints and Context UnificationInformation Processing Letters, 2000, 74 (1-2), pp.35--40
Article dans une revue
inria-00536802v1
|
||
|
|
Decidability of the confluence of ground term rewriting systems[Research Report] RR-0675, INRIA. 1987
Rapport
inria-00075878v1
|
||
|
|
Extraction and Implication of Path Constraints29th Symposium on Mathematical Foundations of Computer Science, 2004, Prague, Costa Rica. pp.863-875
Communication dans un congrès
inria-00536715v1
|
||
|
|
Path Rewriting in Semistructured Data4th International Conference on Combinatorics on Words, 2003, Turku, Finland. pp.358--369
Communication dans un congrès
inria-00536731v1
|
||
|
|
N-ary Queries by Tree Automata10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.217--231
Communication dans un congrès
inria-00536522v1
|
||
About connections between syntactical and computational complexityFundamentals of Computation Theory, FCT'89, 1989, Szeged, Hungary. pp.105-115
Communication dans un congrès
hal-02193920v1
|
- 1
- 2