• 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  

      Simple declarative language for describing narratives with actions 

      Kakas, Antonis C.; Miller, Rob (1997)
      We describe a simple declarative language E for describing the effects of a series of action occurrences within a narrative. E is analogous to Gelfond and Lifschitz's Language A and its extensions, but is based on a different ...
    • 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. ...
    • Article  

      Using argumentation logic for firewall policy specification and analysis 

      Bandara, A. K.; Kakas, Antonis C.; Lupu, E. C.; Russo, A. (2006)
      Firewalls are important perimeter security mechanisms that imple-ment an organisation's network security requirements and can be notoriously difficult to configure correctly. Given their widespread use, it is crucial that ...
    • Article  

      μ-SATPLAN: Multi-agent planning as satisfiability 

      Dimopoulos, Yannis; Hashmi, M. A.; Moraïtis, Pavlos (2012)
      Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination of multiple agents in two different settings. In the first, agents are able to attain individual goals that are necessary ...