The 2-SAT Problem of Regular Signed CNF Formulas.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ismvl/BeckertHM00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ismvl/BeckertHM00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bernhard_Beckert
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Felip_Many%E2%88%9A%E2%80%A0
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Reiner_H%E2%88%9A%C2%A7hnle
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FISMVL.2000.848640
>
foaf:
homepage
<
https://doi.org/10.1109/ISMVL.2000.848640
>
dc:
identifier
DBLP conf/ismvl/BeckertHM00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FISMVL.2000.848640
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
The 2-SAT Problem of Regular Signed CNF Formulas.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bernhard_Beckert
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Felip_Many%E2%88%9A%E2%80%A0
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Reiner_H%E2%88%9A%C2%A7hnle
>
swrc:
pages
331-336
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ismvl/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ismvl/BeckertHM00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ismvl/BeckertHM00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ismvl/ismvl2000.html#BeckertHM00
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ISMVL.2000.848640
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ismvl
>
dc:
subject
Many-valued logic, signed logic, NP-completeness, SAT
(xsd:string)
dc:
title
The 2-SAT Problem of Regular Signed CNF Formulas.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document