Chaining Techniques for Automated Theorem Proving in Many-Valued Logics

Authors:
Harald Ganzinger;Viorica Sofronie-Stokkermans
Affiliations:
-;-
Venue:
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Year:
2000

Citing 0
Cited 6

Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Automated theorem proving by resolution in non-classical logics

Annals of Mathematics and Artificial Intelligence
On the refutational completeness of signed binary resolution and hyperresolution

Fuzzy Sets and Systems
Determination of α-resolution in lattice-valued first-order logic LF(X)

Information Sciences: an International Journal
Resolution procedures for multiple-valued optimization

Information Sciences: an International Journal
System description: E-KRHyper 1.4: extensions for unique names and description logic

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition specializes to a refined version of the many-valued resolution rules introduced by Baaz and Fermüller, and that ordered chaining can be specialized to a refutationally complete inference system for regular clauses.