Complex Optimization in Answer Set Programming
Published in arXiv (Cornell University) • Jul 28, 2011
NobleIDNI4P58W57R79S99
Authors:,,
Martin Gebser
Roland Kaminski
Torsten Schaub
Abstract
Preference handling and optimization are indispensable means for addressing non-trivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems d...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!