3481 search results - page 348 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
192
click to vote
ICFP
2012
ACM
13 years 7 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
207
click to vote
PSSE
2004
Springer
15 years 10 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
161
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
165
click to vote
VSTTE
2012
Springer
14 years 13 days ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
124
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
ended abstract provides an overview of my research towards a dissertation thesis in the context of programming cognitive agents with non-monotonic reasoning capabilities. Categori...