A many-sorted calculus based on resolution and paramodulation

Authors:
Christoph Walther
Affiliations:
Institut fur Informatik I, Universitat Karlsruhe
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 3
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
N-sorted logic for automatic theorem-proving in higher-order logic

ACM '72 Proceedings of the ACM annual conference - Volume 1
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

The TPTP typed first-order form with arithmetic

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first-order calculus whose well formed formulas are clauses and whose sole inference rules are factorization, resolution and paramodulation is extended to a many-sorted calculus. As a basis for Automated Theorem Proving, this many-sorted calculus leads to a remarkable reduction of the search space and also to simpler proofs. The soundness and completeness of the new calculus and the Sort-Theorem, which relates the many-sorted calculus to its one-sorted counterpart, are shown. In addition results about term rewriting and unification in a many-sorted calculus are obtained. Practical examples and a proof protocol of an automated theorem prover based on the many-sorted calculus are presented.