Sciweavers

92 search results - page 17 / 19
» Decidable Reasoning over Timestamped Conceptual Models
Sort
View
LICS
2009
IEEE
14 years 1 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
IJCAI
1997
13 years 8 months ago
Object Identification in a Bayesian Context
Object identification—the task of deciding that two observed objects are in fact one and the same object—is a fundamental requirement for any situated agent that reasons about...
Timothy Huang, Stuart J. Russell
CICLING
2007
Springer
14 years 1 months ago
Dependency Analysis and CBR to Bridge the Generation Gap in Template-Based NLG
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...
Virginia Francisco, Raquel Hervás, Pablo Ge...
DKE
2008
172views more  DKE 2008»
13 years 7 months ago
An XML Schema integration and query mechanism system
The availability of large amounts of heterogeneous distributed web data necessitates the integration of XML data from multiple XML sources for many reasons. For example, currently,...
Sanjay Kumar Madria, Kalpdrum Passi, Sourav S. Bho...
LICS
2008
IEEE
14 years 1 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski