Exploiting data dependencies in many-valued logics
作者:
Reiner Haähnle,
期刊:
Journal of Applied Non-Classical Logics
(Taylor Available online 1996)
卷期:
Volume 6,
issue 1
页码: 49-69
ISSN:1166-3081
年代: 1996
DOI:10.1080/11663081.1996.10510866
出版商: Taylor & Francis Group
关键词: many-valued logic;Polarity;Horn formula;direct products of structures;resolution;Davis-Putnam procedure
数据来源: Taylor
摘要:
The purpose of this paper is to make some pratically relevant results in automated theorem proving available to many-valued logics with suitable modifications. We are working with a notion of many-valued first-order clauses which any finitely- valued logic formula can be translated into and that has been used several times in the literature, but in an ad hoc way. We give a many-valued version of polarity which in turn leads to natural many-valued counterparts of Horn formulas, hyperresolution, and a Davis—Putnam procedure. We show that the many-valued generalizations share many of the desirable properties of the classical versions. Our results justify and generalize several earlier results on theorem proving in many-valued logics.
点击下载:
PDF (1021KB)
返 回