641 search results - page 57 / 129 » Embedding Finite Sets in a Logic Programming Language |
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
PLSA
1994
14 years 7 days ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
ICLP
2007
Springer
14 years 8 hour ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
FASE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
INTERSENSE
2006
ACM
14 years 2 months ago
2006
ACM
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...