146 search results - page 5 / 30 » Modelling and solving temporal reasoning as propositional sa... |
SIGSOFT
2003
ACM
14 years 1 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
EPIA
2001
Springer
14 years 1 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
KR
1998
Springer
14 years 25 days ago
1998
Springer
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the p...
UAI
1993
13 years 10 months ago
1993
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...