Sciweavers

4192 search results - page 292 / 839
» Probabilistic Logic Programming
Sort
View
DEXAW
2008
IEEE
93views Database» more  DEXAW 2008»
16 years 1 months ago
Overlay GHC: An Extension of Guarded Horn Clauses for Overlay Programming
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
Kenji Saito
ENTCS
2006
171views more  ENTCS 2006»
15 years 6 months ago
Program Extraction From Proofs of Weak Head Normalization
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
Malgorzata Biernacka, Olivier Danvy, Kristian St&o...
PLDI
2011
ACM
14 years 9 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
DMIN
2006
83views Data Mining» more  DMIN 2006»
15 years 8 months ago
On Novelty Evaluation of Potentially Useful Patterns
- As is generally accepted, the most important feature that a Knowledge Discovery in Database (KDD) system must possess is, to be able to discover patterns that are "novel&quo...
Ying Xie, Manmathasivaram Nagarajan, Vijay V. Ragh...
APIN
1998
78views more  APIN 1998»
15 years 6 months ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy