934 search results - page 101 / 187 » Elementary Sets of Logic Programs |
CL
2000
Springer
15 years 2 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
125
click to vote
ICCS
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
GPCE
2004
Springer
15 years 3 months ago
2004
Springer
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...
JSAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...