L. Thorne McCarty, Ron van der Meyden  Home/Search
Context Related
| uts.edu.au:8080/~ron/research...kr92.ps uts.edu.au/~ron/research/kr92.ps unsw.edu.au/~meyden/research/kr92.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uts.edu.au:8080/~r...publications (more) From: uts.edu.au/~ron/re...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permits the representation of concurrent activity. Suppose we have a set of abstract actions defined by Horn clauses from a set of basic actions. Let us assume that an abstract action / has occurred, and ask whether a given condition OE is entailed by all the basic actions that constitute /. A countermodel to this... (Update)
Context of citations to this paper: More
...notions of a database or a query, and they do not support named procedures, such as subroutines and views. McCarty and Van der Meyden. In [MvdM92] McCarty and Van der Meyden develop a theory for reasoning about indefinite actions. This work is orthogonal to T R. The main...
...hardly assign a satisfactory semantics to all programs. McCarty [68] describes a deontic action language, combining the action language in [69] and his pioneering deontic language [67] which emerged from the TAXMAN project [66] It has deontic operators similar as ours....
Cited by: More
Heterogeneous Active Agents, I: Semantics - Eiter, Subrahmanian, Pick (1999) (Correct)
The Complexity of Querying Indefinite Data about Linearly.. - van der Meyden (1992) (Correct)
Searching for Inductive Proofs in Second-Order Intuitionistic.. - McCarty (1992) (Correct)
Active bibliography (related documents): More All
0.6: The Complexity Of Querying Indefinite Information: Defined.. - van der Meyden (1992) (Correct)
0.6: Circumscribing Embedded Implications (Without Stratifications) - McCarty (1992) (Correct)
0.5: CHIRON: Planning in an Open-textured Domain - Sanders (1994) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: The RHET Plan Recognition System Version 1.0 - Miller (1992) (Correct)
0.2: An Intuitionistic Interpretation of Finite and Infinite.. - McCarty, van der Meyden (1993) (Correct)
0.2: Indefinite Information in Modal Logic Programming - Stone (1999) (Correct)
Related documents from co-citation: More All
7: The Stable Model Semantics for Logic Programming - Gelfond - 1988
7: Permissions and obligations (context) - McCarty - 1983
6: Ullman J. D.: Principles of Database and Knowledge-Base Systems, Volumes 1 and 2. Computer Science Press, 1988. This article was processed using the L scaled 913a T E X macro package with LLNCS style
BibTeX entry: (Update)
L.T. McCarty and R. van der Meyden. Reasoning about indefinite actions. In Proceedings of the International Conference on Knowledge Representation and Reasoning (KR), pages 59--70, Cambridge, MA, October 1992. http://citeseer.ist.psu.edu/mccarty92reasoning.html More
@incollection{ mccarty92reasoning,
author = "L. Thorne McCarty and Ron {van der Meyden}",
title = "Reasoning about Indefinite Actions",
booktitle = "{KR}'92. Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference",
publisher = "Morgan Kaufmann",
address = "San Mateo, California",
editor = "Bernhard Nebel and Charles Rich and William Swartout",
pages = "59--70",
year = "1992",
url = "citeseer.ist.psu.edu/mccarty92reasoning.html" }
Citations (may not include all citations):759 Negation as failure (context) - Clark - 1978
451 Planning for conjunctive goals (context) - Chapman - 1985
451 Circumscription: A form of non-monotonic reasoning (context) - McCarthy - 1980
444 Towards a general theory of action and time (context) - Allen - 1984
324 A logic-based calculus of events (context) - Kowalski, Sergot - 1986
251 Generating project networks (context) - Tate - 1977
177 Temporal logic can be more expressive (context) - Wolper - 1983
166 Computing circumscription (context) - Lifschitz - 1985
166 An overview of PROLOG (context) - Nadathur, Miller - 1988
160 A temporal logic for reasoning about processes and plans (context) - McDermott - 1982
151 Reasoning about Change (context) - Shoham - 1987
126 Semantical considerations on Floyd-Hoare logic - Pratt - 1976
103 Prediction is deduction but explanation is abduction - Shanahan - 1989
88 Generalized stable models: A semantics for abduction (context) - Kakas, Mancerella - 1990
88 Abductive planning with event calculus (context) - Eshghi - 1988
85 Planning using a temporal world model (context) - Allen, Koomen - 1983
85 First-Order Dynamic Logic (context) - Harel - 1979
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988
65 Abduction versus closure in causal theories (context) - Konolige - 1992
56 Temporal reasoning with abductive event calculus - Denecker, Missiaen et al. - 1992
55 Clausal intuitionistic logic (context) - McCarty - 1988
55 Collected Papers of Charles Sanders Peirce (context) - Peirce - 1931
55 Clausal intuitionistic logic (context) - McCarty - 1988
53 Lexical scoping as universal quantification - Miller - 1989
52 Abduction compared with negation as failure (context) - Eshghi, Kowalski - 1989
51 Planning and acting (context) - McDermott - 1978
42 Plan synthesis: A logical perspective (context) - Rosenschein - 1981
33 The complexity of querying indefinite data about linearly or.. - van der Meyden - 1992
32 Near-Horn Prolog and beyond (context) - Loveland - 1991
31 A Structure for Plans and Behaviour (context) - Sacerdoti - 1977
30 Localized Abductive Planning with the Event Calculus (context) - Missiaen - 1991
25 Permissions and obligations (context) - McCarty - 1983
23 How to clear a block: A theory of plans (context) - Manna, Waldinger - 1987
22 Process logic (context) - Pratt - 1979
20 A language for legal discourse (context) - McCarty - 1989
11 The Complexity of Querying Indefinite Information: Defined r.. (context) - van der Meyden - 1992
10 A procedural logic (context) - Georgeff, Lansky - 1985
8 Temporal reasoning in artificial intelligence (context) - Shoham, Goyal - 1988
6 Indefinite reasoning with definite rules (context) - McCarty, van der Meyden - 1991
6 EPS-II: Estate planning with prototypes (context) - Schlobohm, McCarty - 1989
6 The dynamic logic of permission (context) - van der Meyden - 1990
5 decidability and completeness (context) - Harel, Kozen et al. - 1982
4 Permissions and obligations: An informal introduction (context) - McCarty - 1986
3 Computer Science Department (context) - McCarty, prototypes - 1992
2 A clausal logic for deontic action specification (context) - van der Meyden - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-staff.socs.uts.edu.au:8080/~ron/research/publications.html): More
Knowledge Based Programs: On the Complexity of Perfect Recall .. - van der Meyden (1996) (Correct)
Axioms for Knowledge and Time in Distributed Systems with.. - van der Meyden (1993) (Correct)
A Clausal Logic for Deontic Action Specification (Extended.. - van der Meyden (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC