1426 search results - page 133 / 286 » Specification of nonmonotonic reasoning |
177
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
189
click to vote
UAI
1996
15 years 8 months ago
1996
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
188
click to vote
AIIDE
2009
15 years 8 months ago
2009
In this paper, we describe a computational system that generates story analogues based on previous stories. Unlike many previous works on story generation that attempt to produce ...
204
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
177
click to vote
DKE
2006
15 years 7 months ago
2006
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...