A New Tree-Decomposition Based Algorithm for Answer Set Programming

  • Authors:
  • Michael Morak;Nysret Musliu;Reinhard Pichler;Stefan Rummele;Stefan Woltran

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • ICTAI '11 Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A promising approach to tackle intractable problems is given by combining decomposition methods with dynamic programming algorithms. One such decomposition concept is tree decomposition. In this paper, we provide a new algorithm using this combined approach for solving reasoning problems in propositional answer set programming.