4370 search results - page 390 / 874 » Algebra of Logic Programming |
126
click to vote
CORR
2010
Springer
15 years 3 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...
138
Voted
BIRTHDAY
2005
Springer
15 years 9 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...
125
click to vote
IPPS
1998
IEEE
15 years 7 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...
129
Voted
LCC
1994
15 years 7 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 ...
153
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...