Anti-unification (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Anti-unification" in French language version.

refsWebsite

Global rank French rank

8doi.org

2^nd place

3^rd place

2handle.net

102^nd place

779^th place

1issn.org

57^th place

4^th place

1arxiv.org

69^th place

232^nd place

1illinois.edu

1,349^th place

2,764^th place

1acm.org

1,185^th place

1,318^th place

acm.org

dl.acm.org

David Cerna et Temur Kutsia, « Idempotent Anti-Unification », ACM Transactions in Computational Logic, vol. 21, n^o 2,‎ 2019 (hdl 10.1145/3359060, lire en ligne).

arxiv.org

Jochen Burghardt, « E-Generalization Using Grammars », Artificial Intelligence, vol. 165, n^o 1,‎ 2005, p. 1–35 (DOI 10.1016/j.artint.2005.01.008, arXiv 1403.8118).

doi.org

dx.doi.org

Franz Baader, « Unification, weak unification, upper bound, lower bound, and generalization problems », Lecture Notes in Computer Science, vol. 488 « Proc. 4th Conf. on Rewriting Techniques and Applications (RTA) »,‎ 1991, p. 86-97 (ISSN 0302-9743, DOI 10.1007/3-540-53904-2_88).
Jochen Burghardt, « E-Generalization Using Grammars », Artificial Intelligence, vol. 165, n^o 1,‎ 2005, p. 1–35 (DOI 10.1016/j.artint.2005.01.008, arXiv 1403.8118).
Maria Alpuente, Santiago Escobar, Javier Espert et Jose Meseguer, « A modular order-sorted equational generalization algorithm », Information and Computation, vol. 235,‎ 2014, p. 98–136 (DOI 10.1016/j.ic.2014.01.006, hdl 2142/25871, lire en ligne).
Rylan Cottrell, Robert J. Walker et Jörg Denzinger, « Semi-automating small-scale source code reuse via structural correspondence », SIGSOFT '08/FSE-16: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering,‎ 2008, p. 214-225 (DOI 10.1145/1453101.1453130)
Zohar Manna and Richard Waldinger, « A Deductive Approach to Program Synthesis », ACM Transactions on Programming Languages and Systems, vol. 2,‎ janvier 1980, p. 90–121 (DOI 10.1145/357084.357090).
Boris Galitsky, Kuznetsov SO et Usikov DA, « Parse Thicket Representation for Multi-sentence Search », Lecture Notes in Computer Science, vol. 7735,‎ 2013, p. 1072–1091 (ISBN 978-3-642-35785-5, DOI 10.1007/978-3-642-35786-2_12).
Boris Galitsky, Gabor Dobrocsi, Josep Lluís de la Rosa et Sergei O. Kuznetsov, « From Generalization of Syntactic Parse Trees to Conceptual Graphs », Lecture Notes in Computer Science, vol. 6208,‎ 2010, p. 185–190 (ISBN 978-3-642-14196-6, DOI 10.1007/978-3-642-14197-3_19)
Boris Galitsky, de la Rosa JL et Dobrocsi G., « Inferring the semantic properties of sentences by mining syntactic parse trees », Data & Knowledge Engineering, vol. 81-82,‎ 2012, p. 21–45 (DOI 10.1016/j.datak.2012.07.003)

handle.net

hdl.handle.net

Maria Alpuente, Santiago Escobar, Javier Espert et Jose Meseguer, « A modular order-sorted equational generalization algorithm », Information and Computation, vol. 235,‎ 2014, p. 98–136 (DOI 10.1016/j.ic.2014.01.006, hdl 2142/25871, lire en ligne).
David Cerna et Temur Kutsia, « Idempotent Anti-Unification », ACM Transactions in Computational Logic, vol. 21, n^o 2,‎ 2019 (hdl 10.1145/3359060, lire en ligne).

illinois.edu

ideals.illinois.edu

Maria Alpuente, Santiago Escobar, Javier Espert et Jose Meseguer, « A modular order-sorted equational generalization algorithm », Information and Computation, vol. 235,‎ 2014, p. 98–136 (DOI 10.1016/j.ic.2014.01.006, hdl 2142/25871, lire en ligne).

issn.org

portal.issn.org

Franz Baader, « Unification, weak unification, upper bound, lower bound, and generalization problems », Lecture Notes in Computer Science, vol. 488 « Proc. 4th Conf. on Rewriting Techniques and Applications (RTA) »,‎ 1991, p. 86-97 (ISSN 0302-9743, DOI 10.1007/3-540-53904-2_88).