Constructing Bachmair-Ganzinger Models

DOI10.1007/978-3-642-37651-1_12zbMath1383.68079OpenAlexW84077869WikidataQ118190379 ScholiaQ118190379MaRDI QIDQ4916082

No author found.

Publication date: 19 April 2013

Published in: Programming Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37651-1_12

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (1)

Set of support, demodulation, paramodulation: a historical perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Termination of rewriting
• Resolution methods for the decision problem
• Automated complexity analysis based on ordered resolution
• Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae
• Automatic recognition of tractability in inference relations
• A machine program for theorem-proving

This page was built for publication: Constructing Bachmair-Ganzinger Models