The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/Heusch95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/mfcs/Heusch95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Heusch
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-60246-1%5F128
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-60246-1_128
>
dc:
identifier
DBLP conf/mfcs/Heusch95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-60246-1%5F128
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Heusch
>
swrc:
pages
221-226
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/mfcs/Heusch95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/mfcs/Heusch95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#Heusch95
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-60246-1_128
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/mfcs
>
dc:
subject
Subject classification algorithms and data structures; logic in computer science
(xsd:string)
dc:
title
The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document