[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/aaai/HecherK24>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Markus_Hecher>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Rafael_Kiesel>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1609%2Faaai.v38i9.28923>
foaf:homepage <https://doi.org/10.1609/aaai.v38i9.28923>
dc:identifier DBLP conf/aaai/HecherK24 (xsd:string)
dc:identifier DOI doi.org%2F10.1609%2Faaai.v38i9.28923 (xsd:string)
dcterms:issued 2024 (xsd:gYear)
rdfs:label On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Markus_Hecher>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Rafael_Kiesel>
swrc:pages 10535-10543 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/aaai/2024>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/aaai/HecherK24/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/aaai/HecherK24>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/aaai/aaai2024.html#HecherK24>
rdfs:seeAlso <https://doi.org/10.1609/aaai.v38i9.28923>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/aaai>
dc:title On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document