Sciweavers

240 search results - page 1 / 48
» Constrained Partial Deduction
Sort
View
WLP
1997
Springer
13 years 8 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
ICPR
2008
IEEE
13 years 11 months ago
Partial closure-based constrained clustering with order ranking
In this paper we propose a new partial closure-based constrained clustering algorithm. We introduce closures into the partial constrained clustering and we propose a new measureme...
Shaohong Zhang, Hau-San Wong
DAGSTUHL
1996
13 years 5 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 4 months ago
Logic program specialisation through partial deduction: Control issues
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
Michael Leuschel, Maurice Bruynooghe
ECSQARU
2005
Springer
13 years 10 months ago
Conditional Deduction Under Uncertainty
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
Audun Jøsang, Simon Pope, Milan Daniel