71 search results - page 7 / 15 » Complete Cuboidal Sets in Axiomatic Domain Theory |
94
Voted
IJCAI
1997
15 years 1 months ago
1997
We consider the frame problem, that is, char acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
129
Voted
TARK
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
117
Voted
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
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...
106
click to vote
ML
2000
ACM
15 years 6 days ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...