The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Abstract. The demonstration presents Pronto - a prototype of a nonmonotonic probabilistic reasoner for very expressive Description Logics. Pronto is built on top of the OWL DL reas...