English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Superposition with simplification as a decision procedure for the monadic class with equality

MPS-Authors
/persons/resource/persons44055

Bachmair,  Leo
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann,  Uwe       
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/ds5Dx
(Publisher version)

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

Bachmair, L., Ganzinger, H., & Waldmann, U. (1993). Superposition with simplification as a decision procedure for the monadic class with equality. In G. Gottlob, A. Leitsch, & D. Mundici (Eds.), Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93 (pp. 83-96). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ADE9-2
Abstract
We show that superposition, a restricted form of paramodulation, can be
combined with specifically designed simplification rules such that it becomes a
decision procedure for the monadic class with equality. The completeness of the
method follows from a general notion of redundancy for clauses and
superposition inferences.