136 search results - page 7 / 28 » The Satisfiability Problem for Probabilistic Ordered Branchi... |
AIPS
2007
13 years 10 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
AGP
2003
IEEE
14 years 29 days ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
IFIP
2001
Springer
14 years 3 days ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred wit...