Sciweavers

1818 search results - page 47 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
FLAIRS
2001
13 years 10 months ago
Transformation of WordNet Glosses into Logic Forms
This paper presents a methodand implementation resuits for the transformation of WordNetglosses into logic forms. Theglosses, currently expressed in English are a rich source of w...
Dan I. Moldovan, Vasile Rus
ICFP
2010
ACM
13 years 10 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary
ENTCS
2006
159views more  ENTCS 2006»
13 years 8 months ago
Approximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
Guilherme de Souza Rabello, Marcelo Finger
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 8 months ago
Non-Commutative Sylvester's Determinantal Identity
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
Matjaz Konvalinka
JAR
2008
124views more  JAR 2008»
13 years 8 months ago
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
Xavier Leroy, Sandrine Blazy