Sciweavers

884 search results - page 27 / 177
» A Proof Theory for DL-Lite
Sort
View
CPC
2007
93views more  CPC 2007»
14 years 11 months ago
On a Random Graph Related to Quantum Theory
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
Svante Janson
ENTCS
2006
113views more  ENTCS 2006»
14 years 11 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 12 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
SAGT
2009
Springer
118views Game Theory» more  SAGT 2009»
15 years 6 months ago
A Modular Approach to Roberts' Theorem
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...
Shahar Dobzinski, Noam Nisan
APLAS
2005
ACM
15 years 5 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn