241 search results - page 6 / 49 » Bounded Nondeterminism of Logic Programs |
POPL
2011
ACM
12 years 10 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...
PSSE
2004
Springer
14 years 29 days 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,...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...