Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
Paulo Gomes, Francisco C. Pereira, Paulo Paiva, Nu...
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...
Frej Drejhammar, Christian Schulte, Per Brand, Sei...
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...