Unification in Many-Sorted Eqational Theories
暂无分享,去创建一个
[1] Arnold Oberschelp. Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .
[2] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[3] José Meseguer,et al. Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..
[4] Manfred Schmidt-Schauß. A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation , 1985, IJCAI.
[5] George Gratzer,et al. Universal Algebra , 1979 .
[6] Christoph Walther,et al. Unification in Many-Sorted Theories , 1984, ECAI.
[7] Jörg H. Siekmann,et al. Universal Unification , 1982, GWAI.
[8] Mark E. Stickel,et al. A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.
[9] Christoph Walther,et al. A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.
[10] L. Henschen. N-sorted logic for automatic theorem-proving in higher-order logic , 1972, ACM Annual Conference.
[11] Jean-Marie Hullot,et al. Canonical Forms and Unification , 1980, CADE.
[12] Anthony G. Cohn. Improving the Expressiveness of Many Sorted Logic , 1983, AAAI.
[13] Wolfgang Bibel,et al. Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.
[14] José Meseguer,et al. Equality, Types, Modules and Generics for Logic Programming , 1984, ICLP.
[15] Manfred Schmidt-Schauß. Unification in a Many-sorted Calculus with Declarations , 1985, GWAI.
[16] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .