Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Théorie équationnelle")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 405

  • Page / 17
Export

Selection :

  • and

Résolution modale et logique des cheminsAuffray, Yves; Enjalbert, M.1989, 148 p.Thesis

On the problem of generating small convergent systemsMADLENER, K; SATTLER-KLEIN, A; OTTO, F et al.Journal of symbolic computation. 1993, Vol 16, Num 2, pp 167-187, issn 0747-7171Conference Paper

Unification dans les Théories Syntaxiques = Unification in Syntactic TheoriesKlay, Francis; Kirchner, Claude.1992, 96 p.Thesis

Stratified context unification is in PSPACESCHMIDT-SCHAUSS, Manfred.Lecture notes in computer science. 2001, pp 498-512, issn 0302-9743, isbn 3-540-42554-3Conference Paper

The new WALDMEISTER loop at workGAILLOURDET, Jean-Marie; HILLENBRAND, Thomas; LÖCHNER, Bernd et al.Lecture notes in computer science. 2003, pp 317-322, issn 0302-9743, isbn 3-540-40559-3, 6 p.Conference Paper

Paramodulation, superposition, and simplificationBACHMAIR, L.Lecture notes in computer science. 1997, pp 1-3, issn 0302-9743, isbn 3-540-63385-5Conference Paper

The word matching problem is undecidable for finite special string-rewriting systems that are confluentNARENDRAN, P; OTTO, F.Lecture notes in computer science. 1997, pp 638-648, issn 0302-9743, isbn 3-540-63165-8Conference Paper

ACID-unification is NEXPTIME-decidableANANTHARAMAN, Siva; NARENDRAN, Paliath; RUSINOWITCH, Michael et al.Lecture notes in computer science. 2003, pp 169-178, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Beyond regularity: Equational tree automata for associative and commutative theoriesOHSAKI, Hitoshi.Lecture notes in computer science. 2001, pp 539-553, issn 0302-9743, isbn 3-540-42554-3Conference Paper

Foundations of equational logic programmingHÖLLDOBLER, Steffen.Lecture notes in computer science. 1989, Vol 353, issn 0302-9743, X-250 p. [260 p.]Serial Issue

Preuves de terminaison des systèmes de réécriture associatifs commutatifs : une méthode fondée sur la réécriture elle-même = Termination proof for associative commutative rewriting systems: a method bared on the rewriting it-selfGNAEDIG, Isabelle.1986, 73 fThesis

Coalgebraic methods in computer scienceJACOBS, Bart; RUTTEN, Jan.Theoretical computer science. 2002, Vol 280, Num 1-2, issn 0304-3975, 194 p.Conference Proceedings

Isomorphisme et équivalence équationnelle entre modèles du lambda-calcul = Isomorphism and Equational Equivalence of Models of Lambda-CalculusKerth, Rainer; Berline, C.1995, 105 p.Thesis

Réécriture modulo une théorie présentée par un système convergent et décidabilité des problèmes du mot dans certaines classes de théories équationnelles = Rewriting modulo a theory presented by a convergent system and decidability of the word problem for some clases of equational theoriesMarche, Claude; Jouannaud, Jean-Pierre.1993, 151 p.Thesis

Equational theory of positive numbers with exponentiationGUREVIC, R.Proceedings of the American Mathematical Society. 1985, Vol 94, Num 1, pp 135-1441, issn 0002-9939Article

A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination methodBAADER, F; TINELLI, C.Lecture notes in computer science. 1997, pp 19-33, issn 0302-9743, isbn 3-540-63104-6Conference Paper

Kleene algebra with tests : Completeness and decidabilityKOZEN, D; SMITH, F.Lecture notes in computer science. 1997, pp 244-259, issn 0302-9743, isbn 3-540-63172-0Conference Paper

Some Varieties of Equational Logic (Extended Abstract)PLOTKIN, Gordon.Algebra, meaning, and computation (essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday). Lecture notes in computer science. 2006, pp 150-156, issn 0302-9743, isbn 3-540-35462-X, 1Vol, 7 p.Book Chapter

Certifying and synthesizing membership equational proofsROSU, Grigore; EKER, Steven; LINCOLN, Patrick et al.Lecture notes in computer science. 2003, pp 359-380, issn 0302-9743, isbn 3-540-40828-2, 22 p.Conference Paper

Equational prover of THEOREMAKUTSIA, Temur.Lecture notes in computer science. 2003, pp 367-379, issn 0302-9743, isbn 3-540-40254-3, 13 p.Conference Paper

Combination of distributed search and multi-search in peers-mcd.d: (System description)BONACINA, Maria Paola.Lecture notes in computer science. 2001, pp 448-452, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Complete categorical equational deductionROSU, Grigore.Lecture notes in computer science. 2001, pp 528-538, issn 0302-9743, isbn 3-540-42554-3Conference Paper

A fast algorithm for generating reduced ground rewriting systems from a set of ground equationsSNYDER, W.Journal of symbolic computation. 1993, Vol 15, Num 4, pp 415-450, issn 0747-7171Article

The minimal graph model of lambda calculusBUCCIARELLI, Antonio; SALIBRA, Antonino.Lecture notes in computer science. 2003, pp 300-307, issn 0302-9743, isbn 3-540-40671-9, 8 p.Conference Paper

Type introduction for equational rewritingMIDDELDORP, A; OHSAKI, H.Acta informatica. 2000, Vol 36, Num 12, pp 1007-1029, issn 0001-5903Article

  • Page / 17