Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Equational theory")

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


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

Selection :

  • and

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

Constructive rewritingNIPKOW, T.Computer journal (Print). 1991, Vol 34, Num 1, pp 34-41, issn 0010-4620, 8 p.Article

Solving word equationsABDULRAB, H.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 2, pp 109-130, issn 0988-3754, 22 p.Article

Comments on : Logic programming with equationsBOSCO, P. G; GIOVANNETTI, E; MOISO, C et al.The Journal of logic programming. 1991, Vol 11, Num 1, pp 85-89, issn 0743-1066, 5 p.Article

E-generalization using grammarsBURGHARDT, Jochen.Artificial intelligence. 2005, Vol 165, Num 1, pp 1-35, issn 0004-3702, 35 p.Article

Order-sorted term rewritingDICK, A. J. J; WATSON, P.Computer journal (Print). 1991, Vol 34, Num 1, pp 16-19, issn 0010-4620, 4 p.Article

Unification modulo an equality theory for equational logic programmingJIA-HUAI YOU.Journal of computer and system sciences (Print). 1991, Vol 42, Num 1, pp 54-75, issn 0022-0000, 22 p.Article

Decidability of the Equational Theory of the Continuous Geometry CG(F)HARDING, John.Journal of philosophical logic. 2013, Vol 42, Num 3, pp 461-465, issn 0022-3611, 5 p.Article

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

Investigations on termination of equational rewriting; Investigations sur la terminaison de la réécriture équationnelleGNAEDIG, I.Rapports de recherche - INRIA. 1987, Vol 732, issn 0249-6399, 16 p.Report

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

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

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

The equational theory of prebisimilarity over basic CCS with divergenceACETO, Luca; CAPOBIANCO, Silvio; INGOLFSDOTTIR, Anna et al.Information processing letters. 2008, Vol 108, Num 5, pp 284-289, issn 0020-0190, 6 p.Article

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

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