Sciweavers

12774 search results - page 86 / 2555
» A Framework for Proof Systems
Sort
View
LOGCOM
2006
58views more  LOGCOM 2006»
13 years 8 months ago
Proof Theory for Casari's Comparative Logics
Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper Gentzen systems are defined for the...
George Metcalfe
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 9 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
ICFP
2009
ACM
14 years 9 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
14 years 3 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
Adrian Craciun, Madalina Hodorog
ECAI
2010
Springer
13 years 10 months ago
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
Lutz Schröder, Dirk Pattinson, Daniel Hausman...