Sciweavers

37 search results - page 4 / 8
» Splitting a Logic Program Revisited
Sort
View
LOGCOM
1998
110views more  LOGCOM 1998»
13 years 7 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
ESOP
2012
Springer
12 years 3 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
ML
2008
ACM
150views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
ESOP
2009
Springer
14 years 2 months ago
Deny-Guarantee Reasoning
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...
Mike Dodds, Xinyu Feng, Matthew J. Parkinson, Vikt...