• Home
  • Search
  • Planning in Answer Set Programming Using Ordered Task Decomposition
  • Cite Icon28
  • https://doi.org/10.1007/978-3-540-39451-8_36Copy DOI Icon

Planning in Answer Set Programming Using Ordered Task Decomposition

  • Jan 1, 2003
  • Jürgen Dix +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we introduce a formalism for solving Hierarchical Task Network (HTN) Planning using Answer Set Programming (ASP). We consider the formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP’s representation of the planning problem into logic programs with negation. We show that our translation is sound and complete: answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. We compare our method to (1) similar approaches based on non-HTN planning and (2) SHOP, a dedicated planning system. We show that our approach outperforms non-HTN methods and that its performance is better with ASP systems that allow for nonground programs than with ASP systems that require ground programs.

Similar Papers
  • Dissertation

Answer set programming : SAT based solver and phase transition

  • Jan 01, 2003
  • Yuting Zhao
  • Research Article
  • Citations3

Complexity of super-coherence problems in ASP

  • Aug 09, 2013
  • Theory and Practice of Logic Programming
  • Mario Alviano +2
  • Research Article
  • Citations1

An Answer Set Programming System with Cycle Breaking Heuristic

  • Mar 25, 2010
  • Journal of Software
  • Yu-Ping Shen +1
  • Single Book
  • Citations20

Logic Programming and Nonmonotonic Reasoning

  • Jan 01, 2009
  • Esra Erdem +2
  • Research Article
  • Citations10

ApproxASP – a Scalable Approximate Answer Set Counter

  • Jun 28, 2022
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Mohimenul Kabir +5
  • Research Article
  • Citations15

Multi-engine ASP solving with policy adaptation

  • Dec 11, 2013
  • Journal of Logic and Computation
  • M Maratea +2
  • Conference Article
  • Citations9

Blending Grounding and Compilation for Efficient ASP Solving

  • Nov 01, 2024
  • Carmine Dodaro +2
  • Research Article
  • Citations7

Witnesses for Answer Sets of Logic Programs

  • Jan 27, 2023
  • ACM Transactions on Computational Logic
  • Yisong Wang +3
  • Research Article

Counting Answer Sets of Disjunctive Answer Set Programs

  • Jul 01, 2025
  • Theory and Practice of Logic Programming
  • Md Mohimenul Kabir +2
  • Research Article
  • Citations12

Automated Verification of Weak Equivalence within thesmodelsSystem

  • Nov 01, 2007
  • Theory and Practice of Logic Programming
  • Tomi Janhunen +1
  • Research Article
  • Citations78

GASP: Answer Set Programming with Lazy Grounding

  • Jan 01, 2009
  • Fundamenta Informaticae
  • Alessandro Dal Palù +3
  • Book Chapter
  • Citations1

Moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming

  • Jan 01, 2017
  • Orkunt Sabuncu +1
  • Research Article
  • Citations53

Applications of intuitionistic logic in Answer Set Programming

  • Apr 16, 2004
  • Theory and Practice of Logic Programming
  • Mauricio Osorio +2
  • Book Chapter
  • Citations248

Answer Sets for Propositional Theories

  • Jan 01, 2005
  • Paolo Ferraris
  • Book Chapter
  • Citations5

An Answer Set Programming Encoding of Prioritized Removed Sets Revision: Application to GIS

  • Jan 01, 2004
  • Jonathan Ben-Naim +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.