446 search results - page 19 / 90 » A Theorem Prover for a Computational Logic |
88
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
TABLEAUX
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
89
Voted
BIRTHDAY
2010
Springer
14 years 8 months ago
2010
Springer
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell–La Padula. We show t...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...