Sciweavers

LATIN
2000
Springer
15 years 7 months ago
Worst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
Ali Akhavi
KR
2000
Springer
15 years 7 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
KR
2000
Springer
15 years 7 months ago
Representing the Knowledge of a Robot
Acquiring information about its environment by sensing is a crucial ability of autonomous robots. Based on the established solution to the Frame Problem of the Fluent Calculus, we...
Michael Thielscher
KR
2000
Springer
15 years 7 months ago
Iterated Belief Change in the Situation Calculus
The ability to reason about action and change has long been considered a necessary component for any intelligent system. Many proposals have been offered in the past to deal with ...
Steven Shapiro, Maurice Pagnucco, Yves Lespé...
KR
2000
Springer
15 years 7 months ago
Practical Knowledge Representation and the DARPA High Performance Knowledge Bases Project
We address the experiences of the DARPA High Performance Knowledge Bases (HPKB) (Cohen et al., 1998) project in practical knowledge representation. The purpose of the HPKB project...
Adam Pease, Vinay K. Chaudhri, Fritz Lehmann, Adam...