Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  On Translation of Finitely-Valued Logics to Classical First-Order Logic

Sofronie-Stokkermans, V. (1998). On Translation of Finitely-Valued Logics to Classical First-Order Logic. In H. Prade (Ed.), Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98) (pp. 410-411). Chichester, USA: Wiley.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3863-9 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3864-7
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Sofronie-Stokkermans, Viorica1, 2, Autor           
Affiliations:
1Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              
2Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-121998
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Chichester, USA : Wiley
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 519890
Anderer: Local-ID: C1256104005ECAFC-B046898D722B5029412566F6003BC200-Sofronie1998a
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Brighton, UK
Start-/Enddatum: 1998

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98)
Genre der Quelle: Konferenzband
 Urheber:
Prade, Henri, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Chichester, USA : Wiley
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 410 - 411 Identifikator: ISBN: 0-471-98431-0