Browsing Τμήμα Πληροφορικής / Department of Computer Science by Subject "SAT solvers"
Now showing items 1-3 of 3
-
Conference Object
Constraint propagation in propositional planning
(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
(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
ε-RES: Reasoning about actions, events and observations
(2001)The language ε for reasoning about actions and change can be translated into an argumentation framework. In this paper, we extend this translation of the basic language and showhowit can, together with methods from abduction, ...