Sorted Unification and Its Application to Automated Theorem Proving

Weidenbach, Christoph

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Sorted Unification and Its Application to Automated Theorem Proving

MPS-Authors

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Weidenbach, C. (1996). Sorted Unification and Its Application to Automated Theorem Proving. In M. Hermann, & G. Salzer (Eds.), Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications (pp. 67-76). Self.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC10-0

Abstract

There is no abstract available