884 search results - page 17 / 177 » A Proof Theory for DL-Lite |
CSL
2003
Springer
15 years 5 months ago
2003
Springer
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
123
click to vote
HASKELL
2005
ACM
15 years 5 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
109
click to vote
MKM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type ...
CADE
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
CIE
2006
Springer
15 years 3 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...