1888 search results - page 8 / 378 » Proof theory and computational analysis |
121
click to vote
ASIAN
2006
Springer
15 years 5 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
115
click to vote
FOSSACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
121
click to vote
ISCIS
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
109
click to vote
DLOG
2007
15 years 3 months ago
2007
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
118
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...