Sciweavers

4281 search results - page 66 / 857
» How to Disembed a Program
Sort
View
PPDP
1999
Springer
13 years 12 months ago
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
Ulrich Neumerkel, Frédéric Mesnard
VL
1996
IEEE
125views Visual Languages» more  VL 1996»
13 years 11 months ago
Teaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
Amir Michail
SPLC
2010
13 years 9 months ago
A Hybrid Approach to Feature-Oriented Programming in XVCL
Feature-Oriented Programming (FOP) is a programming paradigm for developing programs by composing features. It is especially useful for software product line development, as each p...
Hongyu Zhang, Stan Jarzabek
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
EOR
2006
65views more  EOR 2006»
13 years 7 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini