4438 search results - page 226 / 888 » The Case for Collaborative Programming |
179
click to vote
ICLP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
181
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
171
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
161
click to vote
Publication
_1990.jpg "Arity Raiser and its Use in Program Specialization")
Experiments on generating compilers by specializing specializers with respect to interpreters have shown that the compilers thus obtained have a natural structure only if the speci...
163
click to vote
AAMAS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-b...