Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator

Artificial Intelligence - Tập 103 - Trang 273-294 - 1998
Fangzhen Lin1
1Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

Tài liệu tham khảo

Andrews, 1995, A paralogical semantics for the prolog cut, 591 Börger, 1989, A logical operational semantics of full Prolog, Vol. 440, 36 Gelfond, 1988, The stable model semantics for logic programming, 1070 Green, 1969, Application of theorem proving to problem solving, 219 Jones, 1984, Stepwise development of operational and denotational semantics for Prolog, 281 Lin, 1997, An ordering on subgoals for planning, Annals of Mathematics and Artificial Intelligence, 21, 321, 10.1023/A:1018925704786 Lin, 1997, Rules as actions: A situation calculus semantics for logic programs, Journal of Logic Programming, 31, 299, 10.1016/S0743-1066(96)00122-7 McCarthy, 1969, Some philosophical problems from the standpoint of artificial intelligence, 4, 463 Podelski, 1995, Operational semantics of constraint logic programs with cocoutining, 449 Reiter, 1991, The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression, 418 Stroetmann, 1996, A declarative semantics for the Prolog cut operator, 255 Wallace, 1993, Tight, consistent, and computable completions for unrestricted logic programs, Journal of Logic Programming, 15, 243, 10.1016/0743-1066(93)90041-E