David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
This paper gives a new, proof-theoretic explanation of partial-order reasoning about time in a nonmonotonic theory of action. The explanation relies on the technique of lifting ground proof systems to compute results using variables and unification. The ground theory uses argumentation in modal logic for sound and complete reasoning about specifications whose semantics follows Gelfond and Lifschitz’s language . The proof theory of modal logic A represents inertia by rules that can be instantiated by sequences of time steps or events. Lifting such rules introduces string variables and associates each proof with a set of string equations; these equations are equivalent to a set of partial-order tree-constraints that can be solved efficiently. The defeasible occlusion of inertia likewise imposes partial-order constraints in the lifted system. By deriving an auxiliary partial order representation of action from the underlying logic, not the input formulas or proofs found, this paper strengthens the connection between practical planners and formal theories of action. Moreover, the general correctness of the theory of action justifies partial-order representations not only for forward reasoning from a completely specified start state, but also for explanatory reasoning and for reasoning by cases.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Maria Alvarez (2010). Reasons for Action and Practical Reasoning. Ratio 23 (4):355-373.
William M. Farmer & Joshua D. Guttman (2000). A Set Theory with Support for Partial Functions. Studia Logica 66 (1):59-78.
William M. Farmer (1990). A Partial Functions Version of Church's Simple Theory of Types. Journal of Symbolic Logic 55 (3):1269-1291.
Timothy J. Carlson (2003). Ranked Partial Structures. Journal of Symbolic Logic 68 (4):1109-1144.
Bożena Staruch & Bogdan Staruch (2005). First Order Theories for Partial Models. Studia Logica 80 (1):105 - 120.
Solomon Feferman (1995). Definedness. Erkenntnis 43 (3):295 - 320.
Hans Kamp & Uwe Reyle (1996). A Calculus for First Order Discourse Representation Structures. Journal of Logic, Language and Information 5 (3-4):297-348.
Hans-Jürgen Hoehnke (2004). Quasi-Varieties: A Special Access. Studia Logica 78 (1-2):249 - 260.
Jouko Vaananen (2001). Second-Order Logic and Foundations of Mathematics. Bulletin of Symbolic Logic 7 (4):504-520.
William M. Farmer (1995). Reasoning About Partial Functions with the Aid of a Computer. Erkenntnis 43 (3):279 - 294.
Added to index2009-01-28
Total downloads10 ( #157,162 of 1,142,994 )
Recent downloads (6 months)1 ( #140,193 of 1,142,994 )
How can I increase my downloads?