111 citations · 121 across the 3 of their papers we have counts for
3 papers
cs.AI2021
Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination
Masood Feyzbakhsh Rankooh, Jussi Rintanen
We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs. They are based on vertex elimination…
cs.AI2011★ 111 cited
Constructing Conditional Plans by a Theorem-Prover
J. Rintanen
The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the pla…
cs.AI2011★ 10 cited
Complexity of Prioritized Default Logics
J. Rintanen
In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may…