60 search results - page 5 / 12 » Quantitative Logic Programming Revisited |
LOGCOM
1998
13 years 7 months ago
1998
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...
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
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...
ICSM
2002
IEEE
14 years 9 days ago
2002
IEEE
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
WCRE
2000
IEEE
13 years 11 months ago
2000
IEEE
Component recovery supports program understanding, architecture recovery, and re-use. Among the best known techniques for detection of re-usable objects (related global variables ...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...