Sciweavers

793 search results - page 49 / 159
» Argumentation and standards of proof
Sort
View
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 7 months ago
The Language Features and Architecture of B-Prolog
B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain c...
Neng-Fa Zhou
110
Voted
CADE
2006
Springer
16 years 1 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
96
Voted
CADE
2002
Springer
16 years 1 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
96
Voted
ICFP
2007
ACM
16 years 23 days ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
100
Voted
DCC
2002
IEEE
16 years 11 days ago
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
Peng Ding, Jennifer D. Key