Sciweavers

1024 search results - page 104 / 205
» Value complete, column complete, predicate complete
Sort
View
AAAI
1998
15 years 3 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
ANOR
2010
85views more  ANOR 2010»
15 years 1 months ago
Inventory management with partially observed nonstationary demand
Abstract. We consider a continuous-time model for inventory management with Markov modulated non-stationary demands. We introduce active learning by assuming that the state of the ...
Erhan Bayraktar, Michael Ludkovski
FMSD
2008
64views more  FMSD 2008»
15 years 1 months ago
Robust safety of timed automata
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
CI
2006
94views more  CI 2006»
15 years 1 months ago
Against Optimality: Logical Foundations for Decision-Theoretic Planning in Autonomous Agents
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
John L. Pollock
IS
2006
15 years 1 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley