Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?
Markus Hecher
Topics & Concepts
TreewidthHeuristicsParameterized complexityTree decompositionReduction (mathematics)Rotation formalisms in three dimensionsMathematicsComputational complexity theoryPartial k-treeConjunctive normal formTheoretical computer scienceCombinatoricsDiscrete mathematicsComputer scienceAlgorithmGraphChordal graphPathwidth1-planar graphMathematical optimizationLine graphGeometryLogic, Reasoning, and KnowledgeMulti-Agent Systems and NegotiationLogic, programming, and type systems