446 search results - page 51 / 90 » Automating Theories in Intuitionistic Logic |
111
Voted
DIS
1999
Springer
15 years 4 months ago
1999
Springer
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...
113
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
101
Voted
TARK
1998
Springer
15 years 4 months ago
1998
Springer
: Salmetintroduced a notion of hypothetical knowledge and showed how it could be used to capture the type of counterfactual reasoning necessary to force the backwards induction sol...
93
Voted
LICS
1990
IEEE
15 years 4 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
94
Voted
DLOG
2010
14 years 10 months ago
2010
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...