Representing actions: Laws, observations and hypotheses

Apt, 1990, Acyclic Programs, 617

Apt, 1991, Acyclic Programs, New Generation Computing, 9, 355

Apt, 1994, Logic Programming and Negation: A Survey, Journal of Logic Programming, 19/20, 9, 10.1016/0743-1066(94)90024-8

Apt, 1994, A New Definition of SLDNF Resolution, Journal of Logic Programming, 18, 177, 10.1016/0743-1066(94)90051-5

Alferes, 1994, SLX—A Top-Down Derivation Procedure for Programs with Explicit Negation, 94, 424

Alferes, 1995, A Logic Programming System for Non-Monotonic Reasoning, Journal of Automated Reasoning, 10.1007/BF00883931

Alferes, 1994, Concurrent Actions and Changes in the Situation Calculus, 93

Apt, 1991, Proving Termination in General Prolog Programs, 265

Apt, 1994, On the Occur-Check Free Logic Programs, ACM Transaction on Programming Languages and Systems, 16, 687, 10.1145/177492.177673

Baral, 1995, Reasoning about Actions: Non-Deterministic effects, Constraints and Qualification, 2017

Baral, 1993, Representing Concurrent Actions in Extended Logic Programming, 866

Baral, 1996, Formalizing Narratives Using Nested Circumscription

Barrett, 1993, UCPOP User's Manual, Version 2.0

Bornscheuer, 1994, Representing Concurrent Actions and Solving Conflicts

Clark, 1978, Negation as Failure, 293

Chen, 1995, Efficient Top-Down Computation of Queries under the Well-Founded Semantics, Journal of Logic Programming, 24, 161, 10.1016/0743-1066(94)00028-5

Denecker, 1993, Representing Incomplete Knowledge in Abductive Logic Programming, 93, 147

Dembinski, 1985, And-parallelism with Intelligent Back-tracking for Annotated Logic Programs, 25

Dung, 1993, Representing Actions in Logic Programming and Its Application in Database Updates, 222

Fages, 1990, Consistency of Clark's Completion and Existence of Stable Models

1994, 4

Gelfond, 1991, Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365, 10.1007/BF03037169

Gelfond, 1992, Representing Actions in Extended Logic Programs, 559

Giunchiglia, 1995, Dependent Fluents, 1964

Gelfond, 1991, What Are the Limitations of the Situation Calculus?, 167

Hölldobler, 1993, Actions and Specificity, 164

Kartha, 1993, Soundness and Completeness Theorems for Three Formalizations of Action, 724

Kartha, 1994, Two Counterexamples Related to Baker's Approach to the Frame Problem, Artificial Intelligence, 69, 379, 10.1016/0004-3702(94)90089-2

Kambhampati, 1995, Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial Order Planning, ASU-CSE-TR 94 002

Kartha, 1994, Actions with Indirect Effects: Preliminary Report, KR 94, 341

Kowalski, 1986, A Logic-Based Calculus of Events, New Generation Computing, 4, 67, 10.1007/BF03037383

Lifschitz, 1993, Automation of Reasoning About Action: A Logic Programming Approach

Lin, 1991, Provably Correct Theories of Actions: Preliminary Report

Lifschitz, 1994, Splitting a Logic Program, 23

1991

McCarthy, 1992

McCarthy, 1963, Situations, Actions and Causal Laws, Technical Report, Stanford Artificial Intelligence Project: Memo 2

McCarthy, 1969, Some Philosophical Problems from the Standpoint of Artificial Intelligence, Vol. 4, 463

Martelli, 1982, An Efficient Unification Algorithm, ACM Transaction on Programming Languages and Systems, 4, 258, 10.1145/357162.357169

Marek, 1989, The Relationship between Stable, Supported, Default and Auto-Epistemic Semantics for General Logic Programs, 600

Miller, 1994, Narratives in the Situation Calculus, Journal of Logic and Computation, 4, 513, 10.1093/logcom/4.5.513

McCain, 1994, Language Independence and Language Tolerance in Logic Programs, 38

McCain, 1995, A Causal Theory of Ramifications and Qualifications, 1978

Pereira, 1992, Default Theory for Well Founded Semantics with Explicit Negation, 339

Pednault, 1988, Extending Conventional Planning Techniques to Handle Actions with Context-Dependent Effects, 55

Pednault, 1994, ADL and the State-Transition Model of Actions, Journal of Logic and Computation, 4, 467, 10.1093/logcom/4.5.467

Pinto, 1994, Temporal Reasoning in the Situation Calculus

Pinto, 1993, Temporal Reasoning in Logic programming: A Case for the Situation Calculus, 203

Provetti, 1996, Hypothetical Reasoning about Actions: From Situation Calculus to Event Calculus, Computational Intelligence, 12, 10.1111/j.1467-8640.1996.tb00272.x

Reiter, 1991, The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression, 359

Stroetman, 1993, A Completeness Result for SLDNF-Resolution, Journal of Logic Programming, 15, 337, 10.1016/S0743-1066(14)80003-4

Turner, 1993, A Monotonicity Theorem for Extended Logic Programs, 567

Turner, 1994, Signed Logic Programs, 61

Van Belleghem, 1995, Combining Situation Calculus and Event Calculus, 83

Van Gelder, 1991, The Well-Founded Semantics for General Logic Programs, Journal of ACM, 38, 620, 10.1145/116825.116838

Weld, 1994, An Introduction to Least Commitment Planning, AI Magazine, 15, 27

1995