884 search results - page 77 / 177 » A Proof Theory for DL-Lite |
141
click to vote
EJC
2007
15 years 6 months ago
2007
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
169
click to vote
CHI
2006
ACM
16 years 6 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
155
click to vote
TLCA
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
179
click to vote
IANDC
2007
15 years 6 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
184
click to vote
SP
2008
IEEE
15 years 4 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...