Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("UNIFICATION")

Filter

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

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

Origin

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

Results 1 to 25 of 2182

  • Page / 88
Export

Selection :

  • and

Automata-driven efficient subterm unificationRAMESH, R; RAMAKRISHNAN, I. V; SEKAR, R. C et al.Theoretical computer science. 2001, Vol 254, Num 1-2, pp 187-223, issn 0304-3975Article

Average-case analysis of unification algorithmsALBERT, L; CASAS, R; FAGES, F et al.Theoretical computer science. 1993, Vol 113, Num 1, pp 3-34, issn 0304-3975Conference Paper

Principal type scheme and unification for intersection type disciplineRONCHI DELLA ROCCA, S.Theoretical computer science. 1988, Vol 59, Num 1-2, pp 181-209, issn 0304-3975Conference Paper

Generalizations of unificationBERARDUCCI, A; VENTURINI ZILLI, M.Journal of symbolic computation. 1993, Vol 16, Num 5, pp 479-491, issn 0747-7171Article

Causation, Unification, and the Adequacy of Explanations of Facts = Causation, unification et adéquation des explications des faitsWEBER, Erik; VAN BOUWEL, Jeroen.Theoria (Madrid). 2009, Vol 24, Num 66, pp 301-320, issn 0495-4548, 20 p.Article

Une grammaire pour l'analyse et la génération = A grammar for parsing and generationESTIVAL, D.TAL. Traitement automatique des langues. 1993, Vol 34, Num 1, pp 83-99, issn 1248-9433Article

∀∃5-equational theory of context unification is undecidableVOROBYOV, Sergei.Theoretical computer science. 2002, Vol 275, Num 1-2, pp 463-479, issn 0304-3975Article

Verpasste Chancen? Die Kirchen und die Einheit Deutschlands = Missed Chances? The Churches and the Unification of GermanyKIRCHNER, H.MD. Materialdienst des Konfessionskundlichen Instituts Bensheim. 1993, Vol 44, Num 1, pp 3-4, issn 0934-8522Article

The undecidability of the semi-unification problemKFOURY, A. J; TIURYN, J; URZYCZYN, P et al.Information and computation (Print). 1993, Vol 102, Num 1, pp 83-101, issn 0890-5401Article

De la medicina a la unificación de las cienciasARASA, F.Folia humanística. 1991, Vol 29, Num 318, pp 3-27, issn 0015-5594Article

Hyper tableaux : The third versionSHASHA FENG; JIGUI SUN; XIA WU et al.Lecture notes in computer science. 2006, pp 127-138, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 12 p.Conference Paper

Unification, explanation and explaining unity : The fisher-wright controversyMORRISON, Margaret.The British journal for the philosophy of science. 2006, Vol 57, Num 1, pp 233-245, issn 0007-0882, 13 p.Article

Monadic Second-Order Unification is NP-completeLEVY, Jordi; SCHMIDT-SCHAUSS, Manfred; VILLARET, Mateu et al.Lecture notes in computer science. 2004, pp 55-69, issn 0302-9743, isbn 3-540-22153-0, 15 p.Conference Paper

William James's divided self and the process of its unification: A reply to Richard Gale = Le soi divisé et le processus de son unification chez William James : réponse à Richard GalePAWELSKI, James O.Transactions of the Charles S. Peirce Society. 2003, Vol 39, Num 4, pp 645-656, issn 0009-1774, 12 p.Article

Friedrich Naumann et l'idée germanique de MitteleuropaEMMY; JONAS, Stephane.Revue des sciences sociales (Strasbourg). 2007, Num 37, pp 100-107, issn 1623-6572, 8 p.Article

The joinability and unification problems for confluent semi-constructor TRSsMITSUHASHI, Ichiro; OYAMAGUCHI, Michio; OHTA, Yoshikatsu et al.Lecture notes in computer science. 2004, pp 285-300, issn 0302-9743, isbn 3-540-22153-0, 16 p.Conference Paper

Decidability of bounded second order unificationSCHMIDT-SCHAUSS, Manfred.Information and computation (Print). 2004, Vol 188, Num 2, pp 143-178, issn 0890-5401, 36 p.Article

Vietnam's economy during 31 year-unification (1975 - 2006)NGUYEN SINH CUC.Vietnam social sciences. 2006, Num 116, pp 19-24, issn 1013-4328, 6 p.Article

Unification algorithms cannot be combined in polynomial timeHERMANN, Miki; KOLAITIS, Phokion G.Information and computation (Print). 2000, Vol 162, Num 1-2, pp 24-42, issn 0890-5401Article

Higher-order unification via combinatorsDOUGHERTY, D. J.Theoretical computer science. 1993, Vol 114, Num 2, pp 273-298, issn 0304-3975Article

A UNIFICATIONIST VINDICATION OF MORAL EXPLANATIONLEI ZHONG.Philosophical forum. 2011, Vol 42, Num 2, pp 131-146, issn 0031-806X, 16 p.Article

Errors of measurement and explanation-as-unificationFORGE, J.Philosophia (Ramat Gan). 1993, Vol 22, Num 1-2, pp 41-61, issn 0048-3893Article

Higher order unification via explicit substitutionsDOWEK, G; HARDIN, T; KIRCHNER, C et al.Information and computation (Print). 2000, Vol 157, Num 1-2, pp 183-235, issn 0890-5401Article

On the undecidability of second-order unificationLEVY, J; VEANES, M.Information and computation (Print). 2000, Vol 159, Num 1-2, pp 125-150, issn 0890-5401Conference Paper

UNIMOK : A system for combining equational unification algorithmsKEPSER, S; RICHTS, J.Lecture notes in computer science. 1999, pp 248-251, issn 0302-9743, isbn 3-540-66201-4Conference Paper

  • Page / 88