764 search results - page 43 / 153 » On the Expressibility of Stable Logic Programming |
137
click to vote
NJC
2002
15 years 3 months ago
2002
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
129
Voted
LPAR
1999
Springer
15 years 7 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
144
Voted
PADL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
117
click to vote
DALT
2006
Springer
15 years 7 months ago
2006
Springer
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
143
Voted
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...