Abstract. In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partia...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...