• Article  

      Encoding planning problems in nonmonotonic logic programs 

      Dimopoulos, Yannis; Nebel, B.; Koehler, J. (1997)
      We present a framework for encoding planning problems in logic programs with negation as failure, having computational efficiency as our major consideration. In order to accomplish our goal, we bring together ideas from ...
    • Conference Object  

      Heuristic guided optimization for propositional planning 

      Sideris, A.; Dimopoulos, Yannis (AAAI press, 2014)
      Planning as Satisfiability is an important approach to Propositional Planning. A serious drawback of the method is its limited scalability, as the instances that arise from large planning problems are often too hard for ...
    • Article  

      Propositional planning as optimization 

      Sideris, A.; Dimopoulos, Yannis (2012)
      Planning as Satisfiability is a most successful approach to optimal propositional planning. Although optimality is highly desirable, for large problems it comes at a high, often prohibitive, computational cost. This paper ...