1950 search results - page 196 / 390 » Lambda-Free Logical Frameworks |
165
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
165
click to vote
DALT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We...
164
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
196
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...