Unification in sort theories and its applications

Annals of Mathematics and Artificial Intelligence

Volumn 18, Issue 2, 1996, Pages 261-293

  Weidenbach, Christoph ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444456437     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02127750     Document Type: Article

References (27)

1. C. Beierle, U. Hedstück, U. Pletat and J. Siekmann, An order-sorted logic for knowledge representation systems, Artificial Intelligence 55 (1992) 149-191.
2. K.H. Bläsius, U. Hedtstück and C.-R. Rollinger (eds.), Sorts and Types in Artificial Intelligence. Workshop Proceedings, LNAI, Vol. 418 (Springer, 1990).
3. B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, in: Proc. of 9th Annual Symposium on Theoretical Aspects of Computer Science. STACS92, LNCS, Vol. 577, eds. A. Finkel and M. Jantzen (Springer, 1992) pp. 161-171.
4. A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet and F. Jacquemard, Pumping, cleaning and symbolic constraints solving, in: Automata Languages and Programming. 21st International Colloquium, ICALP'94, LNCS, Vol. 820, eds. S. Abiteboul and E. Shamir (Springer. 1994) pp. 436-447.
5. A.G. Cohn. A more expressive formulation of many sorted logic, Journal of Automated Reasoning 3(2) (1987) 113-200.
6. A.G. Cohn, A many sorted logic with possibly empty sorts, in: 11th International Conference on Automated Deduction, CADE-11, LNCS, Vol. 607 (Springer, 1992) pp. 633-647.
7. H. Comon, Inductive proofs by specification transformations, in: Rewriting Techniques and Applications, RTA-89, LNCS, Vol. 355 (Springer, 1989) pp. 76-91.
8. H. Comon, Equational formulas in order-sorted algebras, in: Proc. of ICALP (Springer, 1990) pp. 674-688.
9. J. Corbin and M. Bidoit, A rehabilitation of Robinson's unification algorithm, in: Proceedings of IFIP 9th World Computer Congress (North-Holland, 1983) pp. 909-914.
10. N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation 3(1) (1987) 69-115.
11. N. Dershowitz and J.-P. Jouannaud, Rewrite systems, in: Handbook of Theoretical Computer Science, Vol. B, Chapter 6, ed. J. van Leeuwen (Elsevier Science Publishers, 1990) pp. 243-320.
12. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1(3) (1984) 267-284.
13. M. Fitting, First-Order Logic. Texts and Monographs in Computer Science (Springer, 1990).
14. A.M. Frisch, The substitutional framework for sorted deduction: fundamental results on hybrid reasoning, Artificial Intelligence 49 (1991) 161-198.
15. A.M. Frisch and A.G. Cohn, An abstract view of sorted unification, in: 11th International Conference on Automated Deduction, CADE-11. LNCS, Vol. 607 (Springer, 1992) pp. 178-192.
16. J.A. Goguen and J. Meseguer, Order-sorted algebra, I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoretical Computer Science 105 (1992) 217-273.
17. N. Guarino, M. Carrara and P. Giaretta, On ontology of meta-level categories, in: KR-94, Proceedings of the Fourth International Conference, eds. J. Doyle, E. Sandewall and P. Torasso (Morgan-Kaufmann, 1994) pp. 270-280.
18. J.-P. Jouannaud and C. Kirchner, Solving equations in abstract algebras: A rule-based survey of unification, in: Computational Logic, Essays in Honor of Alan Robinson. Chapter 8, eds. J.L. Lassez and G. Plotkin (MIT Press, 1991) pp. 257-321.
19. M. Kerber and M. Kohlhase, A mechanization of strong kleene logic for partial functions, in: 12th International Conference on Automated Deduction, CADE-12, LNAI, Vol. 814 (Springer, 1994) pp. 371-385.
20. A. Martelli and U. Montanari, An efficient unification algorithm, ACM Trans. Programming Languages ans Systems 4(2) (1982) 258-282.
21. J. Meseguer, J.A. Goguen and G. Smolka, Order-sorted unification. in: Unification, ed. C. Kirchner (Academic Press, 1990) pp. 457-487.
22. A. Oberschelp, Untersuchungen zur mehrsortigen Quantorenlogik, Mathematische Annalen 145 (1962) 297-333.
23. H.-J. Ohlbach and M. Schmidt-Schauß, The lion and the unicorn, Journal of Automated Reasoning 1(3) (1985) 327-332.
24. M. Paterson and M. Wegman, Linear unification, Journal of Computer and System Sciences 16(2) (1978) 158-167.
25. E.L. Post, A variant of a recursively unsolvable problem, Bulletin of the American Mathematical Society 52 (1946) 264-268.
26. D. Prawitz, An improved proof procedure, Theoria 26 (1960) 102-139.
27. J.A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM 12(1) (1965) 23-41.