884 search results - page 28 / 177 » A Proof Theory for DL-Lite |
104
click to vote
ITP
2010
15 years 3 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
101
click to vote
CSFW
2010
IEEE
15 years 3 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
TYPES
2000
Springer
15 years 3 months ago
2000
Springer
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
IPL
2006
14 years 11 months ago
2006
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
108
click to vote
WOLLIC
2010
Springer
14 years 10 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...