Many-sorted unification

Authors:
Christoph Walther
Affiliations:
Univ. Karlsruhe, Karlsruhe, Federal Republic of Germany
Venue:
Journal of the ACM (JACM)
Year:
1988

Citing 11
Cited 20

A mechanical solution of Schubert's steamroller by many-sorted resolution

Artificial Intelligence
Properties of substitutions and unifications

Journal of Symbolic Computation
Schubert's steamroller problem: formulations and solutions

Journal of Automated Reasoning
Unification in many-sorted equational theories

Proc. of the 8th international conference on Automated deduction
A many-sorted calculus based on resolution and paramodulation

A many-sorted calculus based on resolution and paramodulation
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Operational Semantics for Order-Sorted Algebra

Proceedings of the 12th Colloquium on Automata, Languages and Programming
Universal Unification

Proceedings of the 7th International Conference on Automated Deduction
Complete Sets of Unifiers and Matchers in Equational Theories

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Translating Spanish into logic through logic

Computational Linguistics
An investigation into inference with restricted quantification and a taxonomic representation

ACM SIGART Bulletin

Inheritance hierarchies: Semantics and unification

Journal of Symbolic Computation
Order-sorted unification

Journal of Symbolic Computation
Logic programming with typed unification and its realization on an abstract machine

IBM Journal of Research and Development
Taxonomic syntax for first order inference

Journal of the ACM (JACM)
Specification matching for software reuse: a foundation

SSR '95 Proceedings of the 1995 Symposium on Software reusability
A demonstration of a legal reasoning system based on teleological analogies

ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
Norms and time in agent-based systems

Proceedings of the 8th international conference on Artificial intelligence and law
Knowledge Representation for Natural Language Understanding: The L_LILOG Approach

IEEE Transactions on Knowledge and Data Engineering
A Simple Sequent System for First-Order Logic with Free Constructors

TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Method of Similarity-Driven Knowledge Revision for Type Specializations

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Resolution for label-based formulas in hierarchical representation

New Generation Computing
Order-sorted logic programming with predicate hierarchy

Artificial Intelligence
An algebraic array shape inference system for MATLAB®

ACM Transactions on Programming Languages and Systems (TOPLAS)
Context Dependent Procedures and Computed Types in √eriFun

Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed reasoning with ontologies and rules in order-sorted logic programming

Web Semantics: Science, Services and Agents on the World Wide Web
Nonmonotonic sorts for feature structures

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Integrating a spatial reasoner with a resolution theorem-prover

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Existential rigidity and many modalities in order-sorted logic

Knowledge-Based Systems
Inference scheme for order-sorted logic using noun phrases with variables as sorts

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Order-sorted Equational Unification Revisited

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many-sorted unification is considered; that is, unification in the many-sorted free algebras of terms, where variables, as well as the domains and ranges of functions, are restricted to certain subsets of the universe, given as a potentially infinite hierarchy of sorts. It is shown that complete and minimal sets of unifiers may not always exist for many-sorted unification. Conditions for sort hierarchies that are equivalent for the existence of these sets with one, finitely many, or infinitely many elements are presented. It is also proved that being a forest-structured sort hierarchy is a necessary and sufficient criterion for the Robinson Unification Theorem to hold for many-sorted unification. An algorithm for many-sorted unification is given.