MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Sofronie-Stokkermans, Vioricadblp
Editor(s):
Prade, Henridblp
BibTeX cite key*:
Sofronie1998a
Title, Booktitle
Title*:
On Translation of Finitely-Valued Logics to Classical First-Order Logic
Booktitle*:
Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98)
Event, URLs
Conference URL::
http://www.cogs.susx.ac.uk/ecai98/index.html
Downloading URL:
Event Address*:
Brighton, UK
Language:
English
Event Date*
(no longer used):
August 23-28, 1998
Organization:
Event Start Date:
13 May 2024
Event End Date:
13 May 2024
Publisher
Name*:
Wiley
URL:
Address*:
Chichester, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
Pages:
410-411
Year*:
1998
VG Wort Pages:
ISBN/ISSN:
0-471-98431-0
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
The main goal of this paper is to give a better understanding of
existing many-valued resolution procedures, and thus help to improve
the efficiency of automated theorem proving in finitely-valued logics.
First, we briefly present a method for translation to clause form
in finitely-valued logics based on distributive lattices with operators,
which uses the Priestley dual of the algebra of truth values.
We show that the unsatisfiability of the set of signed clauses thus
obtained can be checked by a version of signed negative hyperresolution.
This extends the results established by H\"ahnle in the case of regular logics,
where the set of truth values is linearly ordered. As in the case of regular
hyperresolution, also our version of signed hyperresolution is surprisingly
similar to the classical version. In the second part of the paper we explain
why regular logics and the logics we consider are so well-behaved.
We show that in both cases the translation to clause form is actually a
translation to classical logic, and that soundness and completeness of various
refinements of the (signed) resolution procedure follow as a consequence of
results from first-order logic. Decidability and complexity results for signed
clauses follow as well, by using results from first-order logic. This explains
and extends earlier results on theorem proving in finitely-valued logics.
Keywords:
Theorem Proving, Automated Reasoning, Finitely-valued logics
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:
@INPROCEEDINGS{Sofronie1998a,
AUTHOR = {Sofronie-Stokkermans, Viorica},
 EDITOR = {Prade, Henri},
 TITLE = {On Translation of Finitely-Valued Logics to Classical First-Order Logic},
 BOOKTITLE = {Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98)},
 PUBLISHER = {Wiley},
 YEAR = {1998},
 PAGES = {410--411},
 ADDRESS = {Brighton, UK},
 ISBN = {0-471-98431-0},
}

Entry last modified by Uwe Brahm, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Viorica Sofronie		Created
01/11/1999 11:52:42 AM
Revisions
4.
3.
2.
1.
0.		Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Viorica Sofronie
Viorica Sofronie		Edit Dates
01.04.99 09:49:00
01.04.99 09:42:37
29.03.99 19:22:00
29.03.99 19:22:00
29.03.99 19:22:00