2062 search results - page 123 / 413 » Derivatives of Logical Formulas |
136
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
130
Voted
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
137
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
130
click to vote
ESOP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
160
click to vote
IJCAI
2003
15 years 5 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...