884 search results - page 106 / 177 » A Proof Theory for DL-Lite |
113
click to vote
ESOP
2006
Springer
15 years 3 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
105
click to vote
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
CCS
2008
ACM
15 years 1 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
DLT
2008
15 years 1 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
106
click to vote
COMMA
2006
15 years 1 months ago
2006
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...