Sciweavers

8766 search results - page 47 / 1754
» Functional logic programming
Sort
View
SIGSOFT
2010
ACM
13 years 3 months ago
Language-based verification will change the world
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
Tim Sheard, Aaron Stump, Stephanie Weirich
ILP
2001
Springer
14 years 1 months ago
Induction of Stable Models
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
Ramón P. Otero
POPL
2008
ACM
14 years 9 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
POPL
2000
ACM
14 years 1 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
IJCAI
2007
13 years 10 months ago
From Answer Set Logic Programming to Circumscription via Logic of GK
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
Fangzhen Lin, Yi Zhou