3513 search results - page 281 / 703 » Super Logic Programs |
182
click to vote
POPL
2011
ACM
14 years 7 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
161
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
138
click to vote
ICFP
2005
ACM
15 years 10 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
143
click to vote
POPL
2011
ACM
14 years 7 months ago
2011
ACM
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
117
click to vote
AUSAI
2005
Springer
15 years 10 months ago
2005
Springer
We are interested in programming languages for cognitive agents with preferences. We define rule-based agent theories and inference procedures in defeasible logic, and in this set...