3693 search results - page 284 / 739 » Splitting a Logic Program |
147
click to vote
PPDP
2009
Springer
15 years 11 months ago
2009
Springer
“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the un...
146
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
151
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
141
Voted
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
146
click to vote
LCC
1994
15 years 9 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...