Many-valued Horn Logic is Hard
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F14%3A33150998" target="_blank" >RIV/61989592:15310/14:33150998 - isvavai.cz</a>
Result on the web
<a href="http://ceur-ws.org/Vol-1205/00010052.pdf" target="_blank" >http://ceur-ws.org/Vol-1205/00010052.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Many-valued Horn Logic is Hard
Original language description
In this work we show that for propositional Horn clauses a finite-valued conjunction operator (in particular under finite Lukasiewicz semantics) can induce additional nondeterminism. In order to prove this, we reduce the problem of deciding classical satisfiability of propositional formulas to the satisfiability problem for Horn clauses with finite-valued constraints.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0041" target="_blank" >EE2.3.30.0041: POST-UP II.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 1st International Workshop on Logics for Reasoning about Preferences, Uncertainty and Vagueness (PRUV 2014)
ISBN
—
ISSN
1613-0073
e-ISSN
—
Number of pages
7
Pages from-to
52-58
Publisher name
CEUR Workshop Proceedings
Place of publication
Aachen
Event location
Wien
Event date
Jul 23, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—