Sciweavers

75 search results - page 12 / 15
» Abstract Interpretation of Proofs: Classical Propositional C...
Sort
View
TPHOL
2003
IEEE
15 years 5 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
AML
2006
87views more  AML 2006»
15 years 12 days ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer
CSL
2001
Springer
15 years 4 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ļ...
Frédéric Koriche
91
Voted
LICS
2007
IEEE
15 years 6 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski
LICS
2009
IEEE
15 years 7 months ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram