Sciweavers

7456 search results - page 153 / 1492
» Parallelism in Logic Programming
Sort
View
PRICAI
2000
Springer
15 years 10 months ago
Argumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
Guido Governatori, Michael J. Maher, Grigoris Anto...
IPPS
1998
IEEE
15 years 10 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
PPDP
1999
Springer
15 years 10 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
SOFTVIS
2005
ACM
15 years 12 months ago
Adding parallelism to visual data flow programs
Programming in parallel is an error-prone and complex task compounded by the lack of tool support for both programming and debugging. Recent advances in compiler-directed shared m...
Philip T. Cox, Simon Gauvin, Andrew Rau-Chaplin
PAAPP
2002
101views more  PAAPP 2002»
15 years 6 months ago
Static performance prediction of skeletal parallel programs
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
Yasushi Hayashi, Murray Cole