Sciweavers

3658 search results - page 169 / 732
» The logic of proofs, semantically
Sort
View
TYPES
1998
Springer
15 years 5 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
SUM
2009
Springer
15 years 7 months ago
Query Answering in Belief Logic Programming
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
Hui Wan, Michael Kifer
97
Voted
AAAI
2004
15 years 2 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
95
Voted
POPL
2010
ACM
15 years 10 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
151
Voted
LICS
1991
IEEE
15 years 4 months ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss