Modular-E and the role of elaboration tolerance in solving the qualification problem

A. Bracciali, A.C. Kakas, Frame consistency: Computing with causal explanations, in: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR'04), 2004, pp. 79–87. Brewka, 1999, Preferred answer sets for extended logic programs, Artificial Intelligence, 109, 297, 10.1016/S0004-3702(99)00015-6 Denecker, 1998, An inductive definition approach to ramifications, Electronic Transactions on Artificial Intelligence, 2, 25 Y. Dimopoulos, A. Kakas, L. Michael, Reasoning about actions and change in answer set programming, in: Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), 2004, pp. 61–73. Doherty, 1998, TAL: Temporal action logics language specification and tutorial, Electronic Transactions on Artificial Intelligence, 2, 273 C. Elkan, On solving the qualification problem, in: Working Notes of the AAAI Spring Symposium on Extending Theories of Actions: Formal Theory and Practical Applications, 1995, pp. 77–79. K. Eshghi, Abductive planning with event calculus, in: Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP'88), 1988, pp. 562–579. M. Gelfond, V. Lifschitz, Representing actions in extended logic programming, in: Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP'92), 1992, pp. 559–573. Ginsberg, 1988, Reasoning about action II: The qualification problem, Artificial Intelligence, 35, 311, 10.1016/0004-3702(88)90020-3 Giunchiglia, 2004, Nonmonotonic causal theories, Artificial Intelligence, 153, 49, 10.1016/j.artint.2002.12.001 Hanks, 1987, Nonmonotonic logic and temporal projection, Artificial Intelligence, 33, 379, 10.1016/0004-3702(87)90043-9 Harel, 1984, Dynamic logic, 497 A. Herzig, I. Varzinczak, Domain descriptions should be modular, in: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI'04), 2004, pp. 348–352. Kakas Kakas, 1997, A simple declarative language for describing narratives with actions, Journal of Logic Programming, 31, 157, 10.1016/S0743-1066(96)00138-0 Kakas, 1998, Reasoning about actions, narratives and ramification, Electronic Transactions on Artificial Intelligence, 1, 39 A.C. Kakas, P. Mancarella, P.M. Dung, The acceptability semantics for logic programs, in: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 1994, pp. 504–519. H. Kautz, The logic of persistence, in: Proceedings of the 5th National Conference on Artificial Intelligence (AAAI'86), 1986, pp. 401–405. H. Kautz, B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI'96), 1996, pp. 1194–1201. Kvarnström, 2000, Tackling the qualification problem using fluent dependency constraints, Computational Intelligence, 16, 169, 10.1111/0824-7935.00111 V. Lifschitz, Missionaries and cannibals in the Causal Calculator, in: Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning (KR'00), 2000, pp. 85–96. J. McCarthy, Epistemological problems of Artificial Intelligence, in: Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI'77), 1977, pp. 1038–1044. McCarthy, 1980, Circumscription — A form of non-monotonic reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 McCarthy McCarthy McCarthy, 1969, Some philosophical problems from the standpoint of Artificial Intelligence, Machine Intelligence, 4, 463 McIlraith, 2001, Semantic web services, IEEE Intelligent Systems (Special Issue on the Semantic Web), 16, 46 Miller, 2002, Some alternative formulations of the Event Calculus, vol. 2408, 452 Missiaen, 1995, CHICA, a planning system based on the Event Calculus, Journal of Logic and Computation, 5, 579, 10.1093/logcom/5.5.579 Mueller, 2006 H. Prakken, G. Sartor, A system for defeasible argumentation, with defeasible priorities, in: Proceedings of the International Conference on Formal and Applied Practical Reasoning (FAPR'96), 1996, pp. 510–524. Reiter, 1991, The frame problem in the Situation Calculus: A simple solution (sometimes) and a completeness result for goal regression, 359 A. Russo, R. Miller, B. Nuseibeh, J. Kramer, An abductive approach for analysing event-based requirements specifications, in: Proceedings of the 18th International Conference on Logic Programming (ICLP'02), 2002, pp. 22–37. Shanahan, 2000, An abductive Event Calculus planner, Journal of Logic Programming, 44, 207, 10.1016/S0743-1066(99)00077-1 Shanahan, 2004, Event Calculus planning through satisfiability, Journal of Logic and Computation, 14, 731, 10.1093/logcom/14.5.731 Thielscher, 1998, Introduction to the fluent calculus, Electronic Transactions on Artificial Intelligence, 2, 179 Thielscher, 2001, The qualification problem: A solution to the problem of anomalous models, Artificial Intelligence, 131, 1, 10.1016/S0004-3702(01)00131-X N. Tran, C. Baral, C. Shankland, Issues in reasoning about interaction networks in cells: Necessity of event ordering knowledge, in: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI'05), 2005, pp. 676–681.