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

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

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
n11https://schema.org/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00045217%21RIV11-GA0-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00045217%21RIV11-GA0-14330___
rdf:type
n18:Vysledek skos:Concept
dcterms:description
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known -- e.g.~[Fischer, Makowsky, and Ravve] -- with a single-exponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (since clique-width reaches up to exponentially higher values than rank-width), and can be of practical interest for small values of rank-width. We also provide an algorithm for the MAX-SAT problem along the same lines. We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known -- e.g.~[Fischer, Makowsky, and Ravve] -- with a single-exponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (since clique-width reaches up to exponentially higher values than rank-width), and can be of practical interest for small values of rank-width. We also provide an algorithm for the MAX-SAT problem along the same lines.
dcterms:title
Better algorithms for satisfiability problems for formulas of bounded rank-width Better algorithms for satisfiability problems for formulas of bounded rank-width
skos:prefLabel
Better algorithms for satisfiability problems for formulas of bounded rank-width Better algorithms for satisfiability problems for formulas of bounded rank-width
skos:notation
RIV/00216224:14330/10:00045217!RIV11-GA0-14330___
n4:aktivita
n9:Z n9:S n9:O n9:P
n4:aktivity
O, P(GA201/08/0308), P(GC201/09/J021), S, Z(MSM0021622419)
n4:dodaniDat
n5:2011
n4:domaciTvurceVysledku
n10:7595646 n10:3294099 n10:6376290
n4:druhVysledku
n16:D
n4:duvernostUdaju
n12:S
n4:entitaPredkladatele
n21:predkladatel
n4:idSjednocenehoVysledku
248651
n4:idVysledku
RIV/00216224:14330/10:00045217
n4:jazykVysledku
n20:eng
n4:klicovaSlova
propositional model counting; satisfiability; rank-width; clique-width; parameterized complexity
n4:klicoveSlovo
n6:parameterized%20complexity n6:clique-width n6:satisfiability n6:propositional%20model%20counting n6:rank-width
n4:kontrolniKodProRIV
[3E21A3F341A9]
n4:mistoKonaniAkce
Chennai, India
n4:mistoVydani
Dagstuhl, Germany
n4:nazevZdroje
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
n4:obor
n22:IN
n4:pocetDomacichTvurcuVysledku
3
n4:pocetTvurcuVysledku
3
n4:projekt
n13:GC201%2F09%2FJ021 n13:GA201%2F08%2F0308
n4:rokUplatneniVysledku
n5:2010
n4:tvurceVysledku
Hliněný, Petr Ganian, Robert Obdržálek, Jan
n4:typAkce
n14:WRD
n4:wos
000000
n4:zahajeniAkce
2010-01-01+01:00
n4:zamer
n17:MSM0021622419
s:issn
1868-8969
s:numberOfPages
11
n15:hasPublisher
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS
n11:isbn
978-3-939897-23-1
n19:organizacniJednotka
14330