Sciweavers

3573 search results - page 252 / 715
» Reasoning about Codata
Sort
View
JOLLI
1998
103views more  JOLLI 1998»
15 years 4 months ago
An Interpretation of Default Logic in Minimal Temporal Epistemic Logic
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
Joeri Engelfriet, Jan Treur
SYNTHESE
2010
130views more  SYNTHESE 2010»
15 years 2 months ago
Belief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
Natasha Alechina, Brian Logan
CVPR
2007
IEEE
16 years 6 months ago
Inferring Temporal Order of Images From 3D Structure
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
Grant Schindler, Frank Dellaert, Sing Bing Kang
ICDE
1997
IEEE
112views Database» more  ICDE 1997»
16 years 5 months ago
WOL: A Language for Database Transformations and Constraints
The need to transform data between heterogeneous databases arises from a number of critical tasks in data management. These tasks are complicated by schema evolution in the underl...
Susan B. Davidson, Anthony Kosky
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 4 months ago
How NOT to review a paper: the tools and techniques of the adversarial reviewer
There are several useful guides available for how to review a paper in Computer Science [10, 6, 12, 7, 2]. These are soberly presented, carefully reasoned and sensibly argued. As ...
Graham Cormode