Sciweavers

6167 search results - page 1191 / 1234
» Can Refinement be Automated
Sort
View
CSL
2004
Springer
14 years 3 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
EWCBR
2004
Springer
14 years 3 months ago
Fault Diagnosis of Industrial Robots Using Acoustic Signals and Case-Based Reasoning
In industrial manufacturing rigorous testing is used to ensure that the delivered products meet their specifications. Mechanical maladjustment or faults often show their presence t...
Erik Olsson, Peter J. Funk, Marcus Bengtsson
ICSR
2004
Springer
14 years 3 months ago
XML-Based Feature Modelling
This paper describes a feature modelling technique aimed at modelling the software assets behind a product family. The proposed technique is distinctive in five respects. First, it...
Vaclav Cechticky, Alessandro Pasetti, O. Rohlik, W...
ILP
2004
Springer
14 years 3 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
KR
2004
Springer
14 years 3 months ago
A Split-Combination Method for Merging Inconsistent Possibilistic Knowledge Bases
In this paper, a new method for merging multiple inconsistent knowledge bases in the framework of possibilistic logic is presented. We divide the fusion process into two steps: on...
Guilin Qi, Weiru Liu, David H. Glass
« Prev « First page 1191 / 1234 Last » Next »