Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ipl/ZawidzkiST13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ipl/ZawidzkiST13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dmitry_Tishkovsky
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michal_Zawidzki
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Renate_A._Schmidt
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.ipl.2012.09.007
>
foaf:
homepage
<
https://doi.org/10.1016/j.ipl.2012.09.007
>
dc:
identifier
DBLP journals/ipl/ZawidzkiST13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.ipl.2012.09.007
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ipl
>
rdfs:
label
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dmitry_Tishkovsky
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michal_Zawidzki
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Renate_A._Schmidt
>
swrc:
number
1-2
(xsd:string)
swrc:
pages
34-38
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ipl/ZawidzkiST13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ipl/ZawidzkiST13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ipl/ipl113.html#ZawidzkiST13
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.ipl.2012.09.007
>
dc:
title
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
113
(xsd:string)