Sciweavers

446 search results - page 24 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
FLOPS
2004
Springer
14 years 1 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
CADE
2006
Springer
14 years 8 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner
KR
1991
Springer
13 years 11 months ago
Modal Nonmonotonic Logics: Ranges, Characterization, Computation
In the paper, we investigate the way in which nonmonotonic modal logics depend on their underlying monotonic modal logics. Most notably, we study when different monotonic modal l...
V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Trus...
LPNMR
2005
Springer
14 years 1 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
ICLP
1995
Springer
13 years 11 months ago
Variants of the Event Calculus
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
Fariba Sadri, Robert A. Kowalski