3481 search results - page 417 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
148
click to vote
ENTCS
2008
15 years 4 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
255
Voted
POPL
2006
ACM
16 years 5 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
143
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
193
click to vote
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
137
Voted
ALT
1994
Springer
15 years 8 months ago
1994
Springer
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...