{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:13Z","timestamp":1747548313176},"reference-count":57,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5953,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0743-1066(96)00141-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"201-243","source":"Crossref","is-referenced-by-count":62,"title":["Representing actions: Laws, observations and hypotheses"],"prefix":"10.1016","volume":"31","author":[{"given":"Chitta","family":"Baral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gelfond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Provetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(96)00141-0_bib1","series-title":"Logic Programming: Proceedings of the Seventh International Conference","first-page":"617","article-title":"Acyclic Programs","author":"Apt","year":"1990"},{"issue":"3\/4","key":"10.1016\/S0743-1066(96)00141-0_bib2","first-page":"355","article-title":"Acyclic Programs","volume":"9","author":"Apt","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/S0743-1066(96)00141-0_bib3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","article-title":"Logic Programming and Negation: A Survey","volume":"19\/20","author":"Apt","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00141-0_bib4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(94)90051-5","article-title":"A New Definition of SLDNF Resolution","volume":"18","author":"Apt","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00141-0_bib5","first-page":"424","article-title":"SLX\u2014A Top-Down Derivation Procedure for Programs with Explicit Negation","volume":"94","author":"Alferes","year":"1994"},{"key":"10.1016\/S0743-1066(96)00141-0_bib6","doi-asserted-by":"crossref","DOI":"10.1007\/BF00883931","article-title":"A Logic Programming System for Non-Monotonic Reasoning","author":"Alferes","year":"1995","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0743-1066(96)00141-0_bib7","series-title":"Proceedings of IBERAMIA 94","first-page":"93","article-title":"Concurrent Actions and Changes in the Situation Calculus","author":"Alferes","year":"1994"},{"key":"10.1016\/S0743-1066(96)00141-0_bib8","series-title":"Proceedings of the International Conference on Theoretical Aspects of Computer Software (LNCS 526)","first-page":"265","article-title":"Proving Termination in General Prolog Programs","author":"Apt","year":"1991"},{"issue":"3","key":"10.1016\/S0743-1066(96)00141-0_bib9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/177492.177673","article-title":"On the Occur-Check Free Logic Programs","volume":"16","author":"Apt","year":"1994","journal-title":"ACM Transaction on Programming Languages and Systems"},{"key":"10.1016\/S0743-1066(96)00141-0_bib10","series-title":"Proceedings of IJCAI 95","first-page":"2017","article-title":"Reasoning about Actions: Non-Deterministic effects, Constraints and Qualification","author":"Baral","year":"1995"},{"key":"10.1016\/S0743-1066(96)00141-0_bib11","series-title":"Proceedings of the 13th International Joint Conference on Artificial Intelligence","first-page":"866","article-title":"Representing Concurrent Actions in Extended Logic Programming","author":"Baral","year":"1993"},{"key":"10.1016\/S0743-1066(96)00141-0_bib12","series-title":"Proceedings of the 14th AAAI National Conference on Artificial Intelligence","article-title":"Formalizing Narratives Using Nested Circumscription","author":"Baral","year":"1996"},{"article-title":"UCPOP User's Manual, Version 2.0","year":"1993","author":"Barrett","key":"10.1016\/S0743-1066(96)00141-0_bib13"},{"key":"10.1016\/S0743-1066(96)00141-0_bib14","series-title":"Proceedings of German Conference on AI","article-title":"Representing Concurrent Actions and Solving Conflicts","author":"Bornscheuer","year":"1994"},{"key":"10.1016\/S0743-1066(96)00141-0_bib15","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"issue":"3","key":"10.1016\/S0743-1066(96)00141-0_bib16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","article-title":"Efficient Top-Down Computation of Queries under the Well-Founded Semantics","volume":"24","author":"Chen","year":"1995","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00141-0_bib17","first-page":"147","article-title":"Representing Incomplete Knowledge in Abductive Logic Programming","volume":"93","author":"Denecker","year":"1993"},{"key":"10.1016\/S0743-1066(96)00141-0_bib18","series-title":"Proceedings of the International Symposium on Logic Programming","first-page":"25","article-title":"And-parallelism with Intelligent Back-tracking for Annotated Logic Programs","author":"Dembinski","year":"1985"},{"key":"10.1016\/S0743-1066(96)00141-0_bib19","series-title":"Proceedings of ICLP-93","first-page":"222","article-title":"Representing Actions in Logic Programming and Its Application in Database Updates","author":"Dung","year":"1993"},{"article-title":"Consistency of Clark's Completion and Existence of Stable Models","year":"1990","author":"Fages","key":"10.1016\/S0743-1066(96)00141-0_bib20"},{"volume":"4","year":"1994","key":"10.1016\/S0743-1066(96)00141-0_bib21"},{"issue":"3\/4","key":"10.1016\/S0743-1066(96)00141-0_bib22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical Negation in Logic Programs and Disjunctive Databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/S0743-1066(96)00141-0_bib23","series-title":"Joint International Conference and Symposium on Logic Programming","first-page":"559","article-title":"Representing Actions in Extended Logic Programs","author":"Gelfond","year":"1992"},{"key":"10.1016\/S0743-1066(96)00141-0_bib24","series-title":"Proceedings of IJCAI 95","first-page":"1964","article-title":"Dependent Fluents","author":"Giunchiglia","year":"1995"},{"key":"10.1016\/S0743-1066(96)00141-0_bib25","series-title":"Automated Reasoning: Essays in Honor of Woody Bledsoe","first-page":"167","article-title":"What Are the Limitations of the Situation Calculus?","author":"Gelfond","year":"1991"},{"key":"10.1016\/S0743-1066(96)00141-0_bib26","series-title":"Proceedings of ICLP-93","first-page":"164","article-title":"Actions and Specificity","author":"H\u00f6lldobler","year":"1993"},{"key":"10.1016\/S0743-1066(96)00141-0_bib27","series-title":"IJCAI 93","first-page":"724","article-title":"Soundness and Completeness Theorems for Three Formalizations of Action","author":"Kartha","year":"1993"},{"key":"10.1016\/S0743-1066(96)00141-0_bib28","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(94)90089-2","article-title":"Two Counterexamples Related to Baker's Approach to the Frame Problem","volume":"69","author":"Kartha","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0743-1066(96)00141-0_bib29","article-title":"Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial Order Planning","author":"Kambhampati","year":"1995","journal-title":"ASU-CSE-TR 94 002"},{"key":"10.1016\/S0743-1066(96)00141-0_bib30","first-page":"341","article-title":"Actions with Indirect Effects: Preliminary Report","author":"Kartha","year":"1994","journal-title":"KR 94"},{"key":"10.1016\/S0743-1066(96)00141-0_bib31","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF03037383","article-title":"A Logic-Based Calculus of Events","volume":"4","author":"Kowalski","year":"1986","journal-title":"New Generation Computing"},{"key":"10.1016\/S0743-1066(96)00141-0_bib32","series-title":"Posters of the International Symposium on Logic Programming","article-title":"Automation of Reasoning About Action: A Logic Programming Approach","author":"Lifschitz","year":"1993"},{"key":"10.1016\/S0743-1066(96)00141-0_bib33","series-title":"Proceedings of AAAI-91","article-title":"Provably Correct Theories of Actions: Preliminary Report","author":"Lin","year":"1991"},{"key":"10.1016\/S0743-1066(96)00141-0_bib34","series-title":"Proceedings of the Eleventh International Conference on Logic Programming","first-page":"23","article-title":"Splitting a Logic Program","author":"Lifschitz","year":"1994"},{"year":"1991","series-title":"Designing Autonomous Agents","key":"10.1016\/S0743-1066(96)00141-0_bib35"},{"year":"1992","series-title":"Overcoming an Unexpected Obstacle","author":"McCarthy","key":"10.1016\/S0743-1066(96)00141-0_bib36"},{"key":"10.1016\/S0743-1066(96)00141-0_bib37","article-title":"Situations, Actions and Causal Laws","author":"McCarthy","year":"1963","journal-title":"Technical Report, Stanford Artificial Intelligence Project: Memo 2"},{"key":"10.1016\/S0743-1066(96)00141-0_bib38","first-page":"463","article-title":"Some Philosophical Problems from the Standpoint of Artificial Intelligence","volume":"Vol. 4","author":"McCarthy","year":"1969"},{"key":"10.1016\/S0743-1066(96)00141-0_bib39","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Transaction on Programming Languages and Systems"},{"key":"10.1016\/S0743-1066(96)00141-0_bib40","series-title":"Proceedings of Sixth International Conference in Logic Programming","first-page":"600","article-title":"The Relationship between Stable, Supported, Default and Auto-Epistemic Semantics for General Logic Programs","author":"Marek","year":"1989"},{"issue":"5","key":"10.1016\/S0743-1066(96)00141-0_bib41","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1093\/logcom\/4.5.513","article-title":"Narratives in the Situation Calculus","volume":"4","author":"Miller","year":"1994","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S0743-1066(96)00141-0_bib42","series-title":"Proceedings of the Eleventh International Conference on Logic Programming","first-page":"38","article-title":"Language Independence and Language Tolerance in Logic Programs","author":"McCain","year":"1994"},{"key":"10.1016\/S0743-1066(96)00141-0_bib43","series-title":"Proceedings of IJCAI 95","first-page":"1978","article-title":"A Causal Theory of Ramifications and Qualifications","author":"McCain","year":"1995"},{"key":"10.1016\/S0743-1066(96)00141-0_bib44","series-title":"Logic in AI, Proceedings of European Workshop JELIA '92 (LNAI, 633)","first-page":"339","article-title":"Default Theory for Well Founded Semantics with Explicit Negation","author":"Pereira","year":"1992"},{"key":"10.1016\/S0743-1066(96)00141-0_bib45","series-title":"Proceedings of AAAI-88","first-page":"55","article-title":"Extending Conventional Planning Techniques to Handle Actions with Context-Dependent Effects","author":"Pednault","year":"1988"},{"issue":"5","key":"10.1016\/S0743-1066(96)00141-0_bib46","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1093\/logcom\/4.5.467","article-title":"ADL and the State-Transition Model of Actions","volume":"4","author":"Pednault","year":"1994","journal-title":"Journal of Logic and Computation"},{"article-title":"Temporal Reasoning in the Situation Calculus","year":"1994","author":"Pinto","key":"10.1016\/S0743-1066(96)00141-0_bib47"},{"key":"10.1016\/S0743-1066(96)00141-0_bib48","series-title":"Proceedings of the 10th International Conference in Logic Programming","first-page":"203","article-title":"Temporal Reasoning in Logic programming: A Case for the Situation Calculus","author":"Pinto","year":"1993"},{"issue":"3","key":"10.1016\/S0743-1066(96)00141-0_bib49","doi-asserted-by":"crossref","DOI":"10.1111\/j.1467-8640.1996.tb00272.x","article-title":"Hypothetical Reasoning about Actions: From Situation Calculus to Event Calculus","volume":"12","author":"Provetti","year":"1996","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0743-1066(96)00141-0_bib50","series-title":"Artificial Intelligence and Mathematical Theory of Computation","first-page":"359","article-title":"The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression","author":"Reiter","year":"1991"},{"key":"10.1016\/S0743-1066(96)00141-0_bib51","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0743-1066(14)80003-4","article-title":"A Completeness Result for SLDNF-Resolution","volume":"15","author":"Stroetman","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00141-0_bib52","series-title":"Proceedings of 10th International Conference on Logic Programming","first-page":"567","article-title":"A Monotonicity Theorem for Extended Logic Programs","author":"Turner","year":"1993"},{"key":"10.1016\/S0743-1066(96)00141-0_bib53","series-title":"Proceedings of the 1994 International Symposium on Logic Programming","first-page":"61","article-title":"Signed Logic Programs","author":"Turner","year":"1994"},{"key":"10.1016\/S0743-1066(96)00141-0_bib54","series-title":"Proceedings of the Twelfth International Conference on Logic Programming","first-page":"83","article-title":"Combining Situation Calculus and Event Calculus","author":"Van Belleghem","year":"1995"},{"issue":"3","key":"10.1016\/S0743-1066(96)00141-0_bib55","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The Well-Founded Semantics for General Logic Programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"Journal of ACM"},{"issue":"4","key":"10.1016\/S0743-1066(96)00141-0_bib56","first-page":"27","article-title":"An Introduction to Least Commitment Planning","volume":"15","author":"Weld","year":"1994","journal-title":"AI Magazine"},{"year":"1995","series-title":"Working Notes of AAAI Spring Symposium, Extending Theories of Action: Formal Theory and Practical Applications","key":"10.1016\/S0743-1066(96)00141-0_bib57"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696001410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696001410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T04:21:10Z","timestamp":1556511670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106696001410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":57,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0743106696001410"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(96)00141-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"type":"print","value":"0743-1066"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}