110 search results - page 9 / 22 » A Tutorial on Proof Theoretic Foundations of Logic Programmi... |
CL
2000
Springer
13 years 12 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
ESOP
2001
Springer
14 years 2 hour ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
AAAI
2008
13 years 9 months ago
2008
Program debugging is one of the most time-consuming parts of the software development cycle. In recent years, automatic debugging has been an active research area in software engi...
ICALP
2004
Springer
14 years 27 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...