This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F14%3A33150998%21RIV15-MSM-15310___/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F14%3A33150998%21RIV15-MSM-15310___
rdf:type
n18:Vysledek skos:Concept
rdfs:seeAlso
http://ceur-ws.org/Vol-1205/00010052.pdf
dcterms: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. 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.
dcterms:title
Many-valued Horn Logic is Hard Many-valued Horn Logic is Hard
skos:prefLabel
Many-valued Horn Logic is Hard Many-valued Horn Logic is Hard
skos:notation
RIV/61989592:15310/14:33150998!RIV15-MSM-15310___
n3:aktivita
n10:P
n3:aktivity
P(EE2.3.30.0041)
n3:dodaniDat
n19:2015
n3:domaciTvurceVysledku
Cerami, Marco
n3:druhVysledku
n16:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
27150
n3:idVysledku
RIV/61989592:15310/14:33150998
n3:jazykVysledku
n14:eng
n3:klicovaSlova
Many-valued logic, Complexity, Nondeterminism, Horn logic
n3:klicoveSlovo
n11:Nondeterminism n11:Many-valued%20logic n11:Horn%20logic n11:Complexity
n3:kontrolniKodProRIV
[76A690D5786E]
n3:mistoKonaniAkce
Wien
n3:mistoVydani
Aachen
n3:nazevZdroje
Proceedings of the 1st International Workshop on Logics for Reasoning about Preferences, Uncertainty and Vagueness (PRUV 2014)
n3:obor
n8:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n15:EE2.3.30.0041
n3:rokUplatneniVysledku
n19:2014
n3:tvurceVysledku
Cerami, Marco Borgwardt, Stefan Pe?Aloza, Rafael
n3:typAkce
n17:WRD
n3:zahajeniAkce
2014-07-23+02:00
s:issn
1613-0073
s:numberOfPages
7
n12:hasPublisher
CEUR Workshop Proceedings
n6:organizacniJednotka
15310