메뉴 건너뛰기




Volumn 2, Issue , 1997, Pages 1412-1418

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

Author keywords

[No Author keywords available]

Indexed keywords

CUT OPERATORS; NEGATION-AS-FAILURE; SEARCH CONTROL; SITUATION CALCULUS; STABLE MODEL SEMANTICS;

EID: 0043159619     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (10)
  • 6
    • 84880683483 scopus 로고    scopus 로고
    • Rules as actions: A situation calculus semantics for logic programs
    • To appear
    • F. Lin and R. Reiter. Rules as actions: A situation calculus semantics for logic programs. J. of Logic Programming, To appear. http://www.cs.toronto. edu/~cogrobo/.
    • J. of Logic Programming
    • Lin, F.1    Reiter, R.2
  • 7
    • 0014638440 scopus 로고
    • Some philosophical problems from the standpoint of artificial intelligence
    • B. Meltzer and D. Michie, editors, Edinburgh University Press, Edinburgh
    • J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, pages 463-502. Edinburgh University Press, Edinburgh, 1969.
    • (1969) Machine Intelligence , vol.4 , pp. 463-502
    • McCarthy, J.1    Hayes, P.2
  • 8
    • 0002048328 scopus 로고
    • The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
    • V. Lifschitz, editor, Academic Press, San Diego, CA
    • R. Reiter. The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 418-420. Academic Press, San Diego, CA, 1991.
    • (1991) Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy , pp. 418-420
    • Reiter, R.1
  • 10
    • 0039330748 scopus 로고
    • Tight, consistent, and computable completions for unrestricted logic programs
    • M. G. Wallace. Tight, consistent, and computable completions for unrestricted logic programs. Journal of Logic Programming, 15:243-273, 1993.
    • (1993) Journal of Logic Programming , vol.15 , pp. 243-273
    • Wallace, M.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.