The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
Author:
- Alan M. FrischAFAlan M. Frisch
- 1 May 1991
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 49 (1-3) , 161-198
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Constraint logic programming languagesCommunications of the ACM, 1990
- Taxonomic reasoning with many-sorted logicsArtificial Intelligence Review, 1989
- A more expressive formulation of many sorted logicJournal of Automated Reasoning, 1987
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- Parsing with restricted quantification: an initial demonstration1Computational Intelligence, 1986
- Towards a general theory of action and timeArtificial Intelligence, 1984
- Krypton: A Functional Approach to Knowledge RepresentationComputer, 1983
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A Temporal Logic for Reasoning about Processes and Plans*Cognitive Science, 1982
- Applications of many-sorted interpolation theorems1974