Sciweavers

426 search results - page 25 / 86
» Specification, Abduction, and Proof
Sort
View
CLIMA
2004
13 years 11 months ago
Planning Partially for Situated Agents
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...
CADE
2002
Springer
14 years 10 months ago
The Reflection Theorem: A Study in Meta-theoretic Reasoning
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...
Lawrence C. Paulson
ATVA
2008
Springer
144views Hardware» more  ATVA 2008»
13 years 12 months ago
Tests, Proofs and Refinements
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
Sriram K. Rajamani
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 10 months ago
Induction and Co-induction in Sequent Calculus
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...
Alwen Tiu, Alberto Momigliano
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 7 months ago
Hardness Amplification in Proof Complexity
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...
Paul Beame, Trinh Huynh and Toniann Pitassi