764 search results - page 56 / 153 » On the Expressibility of Stable Logic Programming |
133
Voted
LOPSTR
2005
Springer
15 years 9 months ago
2005
Springer
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
220
Voted
Book
"Constructive Type theory has been a topic of research interest to computer
scientists, mathematicians, logicians and philosophers for a number of years.
For computer scient...
131
click to vote
INTERSENSE
2006
ACM
15 years 9 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 ...
117
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at e...
253
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...