2540 search results - page 193 / 508 » Abstract Logics as Dialgebras |
185
click to vote
TABLEAUX
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
158
click to vote
APAL
2006
15 years 6 months ago
2006
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
161
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
273
click to vote
PADL
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
199
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...