324 search results - page 42 / 65 » Repairing Incomplete Reasoners |
ASPLOS
1992
ACM
15 years 3 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
100
click to vote
AIPS
2009
15 years 28 days ago
2009
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...
132
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...