Sciweavers

6978 search results - page 229 / 1396
» On Proofs in System P
Sort
View
SAT
2010
Springer
178views Hardware» more  SAT 2010»
15 years 10 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
CC
2009
Springer
142views System Software» more  CC 2009»
16 years 7 months ago
Extensible Proof-Producing Compilation
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
Magnus O. Myreen, Konrad Slind, Michael J. C. Gord...
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
16 years 4 days ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ITS
2004
Springer
153views Multimedia» more  ITS 2004»
15 years 12 months ago
Modeling Students' Reasoning About Qualitative Physics: Heuristics for Abductive Proof Search
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Maxim Makatchev, Pamela W. Jordan, Kurt VanLehn
JUCS
2007
108views more  JUCS 2007»
15 years 6 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani