• Conference Object  

      Constraint propagation in propositional planning 

      Sideris, A.; Dimopoulos, Yannis (2010)
      Planning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization ...
    • 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 ...
    • Article  

      Towards local search for answer sets 

      Dimopoulos, Yannis; Sideris, A. (2002)
      Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...