Chaining techniques for automated theorem proving in finitely-valued logics
H. Ganzinger, and V. Sofronie-Stokkermans. Proceedings of the 30th Intl Symp. Multi-valued Logics, page 337--344. Portland, Oregon, IEEE Computer Society Press, (May 2000)
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.
%0 Conference Paper
%1 ganzinger00mvl
%A Ganzinger, Harald
%A Sofronie-Stokkermans, Viorica
%B Proceedings of the 30th Intl Symp. Multi-valued Logics
%C Portland, Oregon
%D 2000
%I IEEE Computer Society Press
%K logic uncertainty
%P 337--344
%T Chaining techniques for automated theorem proving in finitely-valued logics
%X 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.
@inproceedings{ganzinger00mvl,
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.},
added-at = {2009-02-09T05:03:53.000+0100},
address = {Portland, Oregon},
author = {Ganzinger, Harald and Sofronie-Stokkermans, Viorica},
biburl = {https://www.bibsonomy.org/bibtex/2beb3d318361b0c03ca8e2752b9ce880f/neilernst},
booktitle = {Proceedings of the 30th Intl Symp. Multi-valued Logics},
interhash = {3f2a00c0d1def0b5d865bf33329025b8},
intrahash = {beb3d318361b0c03ca8e2752b9ce880f},
keywords = {logic uncertainty},
month = May,
pages = {337--344},
publisher = {IEEE Computer Society Press},
timestamp = {2009-02-09T05:03:53.000+0100},
title = {Chaining techniques for automated theorem proving in finitely-valued logics},
year = 2000
}