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

Authors:
Fangzhen Lin
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Year:
1997

Citing 3
Cited 3

The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Tight, consistent, and computable completions for unrestricted logic programs

Journal of Logic Programming
A Declarative Semantics for the Prolog Cut Operator

ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming

Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning

Annals of Mathematics and Artificial Intelligence
Heuristic planning: a declarative approach based on strategies for action selection

Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
What robots can do: robot programs and effective achievability

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We argue that the situation calculus is a natural formalism for representing and reasoning about control and strategic information. As a case study, in this paper we provide a situation calculus semantics for the Prolog cut operator, the central search control operator in Prolog. We show that our semantics is well-behaved when the programs are properly stastified. We also show that according to this semantics, the conventional implementation of the negationas-failure operator using cut is provably correct with respect to the stable model semantics.