There has been considerable work on practical reasoning in artificial intelligence and also in philosophy. Typically, such reasoning includes premises regarding means–end relations. A clear semantics for such relations is needed in order to evaluate proposed syllogisms. In this paper, we provide a formal semantics for means–end relations, in particular for necessary and sufficient means–end relations. Our semantics includes a non-monotonic conditional operator, so that related practical reasoning is naturally defeasible. This work is primarily an exercise in conceptual analysis, aimed (...) at clarifying and eventually evaluating existing theories of practical reasoning (pending a similar analysis regarding desires, intentions and other relevant concepts). (shrink)

Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic features common to much practical reasoning involving means and ends. We alter the semantics for PDL by adding probabilities to the transition systems and interpreting dynamic formulas 〈α〉 ϕ as fuzzy predicates about the reliability of α as a means to ϕ. This gives our semantics a measure of efficacy for means-end relations.

This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. We encode Pednault's syntax-based solution, Baker's state-minimization policy, and Gelfond & Lifchitz's Action Language A in the propositional dynamic logic (PDL). The formal relationships among these solutions are given. The results of the paper show that dynamic logic, as one of the formalisms for reasoning about dynamic domains, can be used as a formal tool for comparing, analyzing and unifying logics of action.

Propositional dynamic logic (PDL) is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, as long-known, reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context (...) of description logics, and prove that satisfiability is decidable and EXPTIME-complete using an approach based on Büchi tree automata. (shrink)