[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/amai/Kullmann04>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Oliver_Kullmann>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1023%2FB%3AAMAI.0000012871.08577.0b>
foaf:homepage <https://doi.org/10.1023/B:AMAI.0000012871.08577.0b>
dc:identifier DBLP journals/amai/Kullmann04 (xsd:string)
dc:identifier DOI doi.org%2F10.1023%2FB%3AAMAI.0000012871.08577.0b (xsd:string)
dcterms:issued 2004 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/amai>
rdfs:label Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Oliver_Kullmann>
swrc:number 3-4 (xsd:string)
swrc:pages 303-352 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/amai/Kullmann04/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/amai/Kullmann04>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/amai/amai40.html#Kullmann04>
rdfs:seeAlso <https://doi.org/10.1023/B:AMAI.0000012871.08577.0b>
dc:subject satisfiability problem (SAT); systems with partial instantiation; propositional logic; constraint satisfaction problems; polynomial time hierarchies; generalised resolution; lower bounds for resolution; upper bounds for SAT algorithms; automatisation of proof systems; generalised input resolution; generalised width restricted resolution; induced width of constraint satisfaction problems (xsd:string)
dc:title Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 40 (xsd:string)