An order-sorted resolution in theory and practice

Theoretical Computer Science

Volumn 185, Issue 2, 1997, Pages 393-410

  Weibel, Trudy ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; THEOREM PROVING;

ORDER SORTED SYSTEMS;

SORTING;

EID: 0031249301     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00051-0     Document Type: Article

References (23)

1. H. Aït-Kaci, R. Boyer, P. Lincoln, R. Nasr, Efficient implementation of lattice operations, ACM Trans. Program. Languages and Systems 11 (1) (1989) 115-146.
2. C. Beierle, U. Hedtstück, U. Pletat, P.M. Schmitt, J. Siekmann, An order-sorted logic for knowledge representation systems, Artificial Intelligence 55 (1992) 149-191.
3. A.G. Cohn, Many sorted logic = unsorted logic + control?, in: M. Bramer (Ed.), Research and Development in Expert Systems III, Cambridge Univ. Press, Cambridge, 1986, pp. 184-194.
4. A.G. Cohn, On the appearance of sorted literals: a non substitutional framework for hybrid reasoning, in: R. Brachman, H. Levesque, R. Reiter (Eds.), Proc. 1st Internat. Conf. on Principles of Knowledge Representation and Reasoning (1989) pp. 55-66.
5. A.G. Cohn, Completing sort hierarchies, Comput. Math. Appl. 23 (6-9) (1992) 477-491.
6. V.J. Digricoli, M.C. Harrison, Equality-based binary resolution, J. ACM 33 (2) (1986) 253-289.
7. D.A. Duffy, Principles of Automated Theorem Proving, Wiley, New York, 1991.
8. A.M. Frisch, The substitutional framework for sorted deduction: fundamental results on hybrid reasoning, Artificial Intelligence 49 (1991) 161-198.
9. K. Harwood, CARE: Development of a Parser, in: Proc. 5th Australasian Refinement Workshop, Software Verification Research Centre, Univ. of Queensland, Australia, April 1996.
10. K. Harwood, P.A. Lindsay, R. Matthews, An approach to constructing verified software, in: Proc. 17th Annual Computer Science Conf., Univ. of Canterbury, New Zealand, January 1994, pp. 777-786.
11. D. Hemer, P.A. Lindsay, The CARE toolset for developing verified programs from formal specifications, in: Proc. 4th IEEE Internat. Symp. on Assessment of Software Tools, May 1996, pp. 24-35.
12. J. Herbrand, Recherches sur la Théorie de la Démonstration, Thèse, Univ. of Paris, 1930.
13. H.J. Levesque, R.J. Brachman, Expressiveness and tractability in knowledge representation and reasoning, Comput. Intelligence 3 (1987) 78-93.
14. P.A. Lindsay, The data logger case study in CARE, Technical Report 95-10, Software Verification Research Centre, The Univ. of Queensland, Australia, June 1995.
15. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
16. P.D. Mosses, The use of sorts in algebraic specifications, in: Recent Trends in Data Type Specification, Lecture Notes in Computer Science, vol. 665, 1993, pp. 66-91.
17. J.A. Robinson, A machine-oriented logic based on the resolution principle, J. ACM 12 (1) (1965) 23-41.
18. A. Schmidt, Über deduktive Theorien mit mehreren Sorten von Grunddingen, Math. Ann. 115 (1938) 485-506.
19. M. Schmidt-Schauß, Computational Aspects of an Order-Sorted Logic with Term Declarations, Lecture Notes in Artificial Intelligence, vol. 395, 1989.
20. C. Walther, A mechanical solution of Schubert's Steamroller by many-sorted resolution, in: Proc National Conf. on Artificial Intelligence, AAAI, Austin, 1984, pp. 330-334.
21. C. Walther, A Many-Sorted Calculus Based on Resolution and Paramodulation, Research Notes in Artificial Intelligence, Pitman, London, 1987.
22. C. Walther, Many-sorted unification, J. ACM 35 (1) (1988) 1-17.
23. H. Wang, Logic of many-sorted theories, J. Symbolic Logic 17 (2) (1952) 105-116.