메뉴 건너뛰기




Volumn 19, Issue 1-2, 1997, Pages 27-58

The logic of totally and partially ordered plans: A deductive database approach

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031479445     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018995303452     Document Type: Article
Times cited : (7)

References (36)
  • 3
    • 0011773032 scopus 로고
    • Meta-level programming and knowledge representation
    • K.A. Bowen, Meta-level programming and knowledge representation, New Generation Computing 3(3) (1985) 359-383.
    • (1985) New Generation Computing , vol.3 , Issue.3 , pp. 359-383
    • Bowen, K.A.1
  • 4
    • 0002830387 scopus 로고
    • Amalgamating language and metalanguage in logic programming
    • eds. K.L. Clark and S.A. Tarnlund Academic Press
    • K.A. Bowen and R.A. Kowalski, Amalgamating language and metalanguage in logic programming, in: Logic Programming, eds. K.L. Clark and S.A. Tarnlund (Academic Press, 1982) pp. 153-173.
    • (1982) Logic Programming , pp. 153-173
    • Bowen, K.A.1    Kowalski, R.A.2
  • 8
    • 0037511804 scopus 로고
    • Polynomial-time computable queries in temporal deductive databases
    • J. Chomicki, Polynomial-time computable queries in temporal deductive databases, PODS'90 (1990).
    • (1990) PODS'90
    • Chomicki, J.1
  • 9
    • 0003229649 scopus 로고
    • Temporal deductive databases
    • eds. A. Tansel, J. Clifford, S. Gadia, S. Jagodia, A. Segev and R. Snodgrass Benjamin/Cummings
    • J. Chomicki, Temporal deductive databases, in: Temporal Databases: Theory, Design and Implementation, eds. A. Tansel, J. Clifford, S. Gadia, S. Jagodia, A. Segev and R. Snodgrass (Benjamin/Cummings, 1993) pp. 294-320.
    • (1993) Temporal Databases: Theory, Design and Implementation , pp. 294-320
    • Chomicki, J.1
  • 10
    • 0000826543 scopus 로고
    • Negation as failure
    • eds. H. Gallaire and J. Minker
    • K.L. Clark, Negation as failure, in: Logic and Databases, eds. H. Gallaire and J. Minker (1978).
    • (1978) Logic and Databases
    • Clark, K.L.1
  • 12
    • 0029332411 scopus 로고
    • Complexity, decidability and undecidability results for domain-independent planning
    • K. Erol, D.S. Nau and V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence (1995).
    • (1995) Artificial Intelligence
    • Erol, K.1    Nau, D.S.2    Subrahmanian, V.S.3
  • 15
    • 2842560201 scopus 로고
    • STRIPS: A new approach to the application of theorem proving in problem solving
    • R. Fikes and N. Nilsson, STRIPS: A new approach to the application of theorem proving in problem solving, Artificial Intelligence 2(3,4) (1971) 189-208.
    • (1971) Artificial Intelligence , vol.2 , Issue.3-4 , pp. 189-208
    • Fikes, R.1    Nilsson, N.2
  • 17
    • 0027694534 scopus 로고
    • Representing action and change by logic programs
    • M. Gelfond and V. Lifschitz, Representing action and change by logic programs, Journal of Logic Programming 17 (1993) 301-322.
    • (1993) Journal of Logic Programming , vol.17 , pp. 301-322
    • Gelfond, M.1    Lifschitz, V.2
  • 18
    • 0023442334 scopus 로고
    • Nonmonotonic logic and temporal projection
    • S. Hanks and D. McDermott, Nonmonotonic logic and temporal projection, Artificial Intelligence 33 (1987) 379-412.
    • (1987) Artificial Intelligence , vol.33 , pp. 379-412
    • Hanks, S.1    McDermott, D.2
  • 20
    • 0026914596 scopus 로고
    • The relationship between stable, supported, default and autoepistemic semantics for general logic programs
    • V. Marek and V.S. Subrahmanian, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, Theoretical Computer Science 103 (1992) 365-386.
    • (1992) Theoretical Computer Science , vol.103 , pp. 365-386
    • Marek, V.1    Subrahmanian, V.S.2
  • 23
    • 0022661717 scopus 로고
    • Applications of circumsription to formalising common sense reasoning
    • J. McCarthy, Applications of circumsription to formalising common sense reasoning, Artificial Intelligence 26 (1986) 89-116.
    • (1986) Artificial Intelligence , vol.26 , pp. 89-116
    • McCarthy, J.1
  • 24
    • 0001445808 scopus 로고
    • A temporal logic for reasoning about processes and plans
    • D. McDermott, A temporal logic for reasoning about processes and plans, Cognitive Science 6 (1982) 101-155.
    • (1982) Cognitive Science , vol.6 , pp. 101-155
    • McDermott, D.1
  • 25
    • 0002378357 scopus 로고
    • Temporal reasoning in logic programming: A case for the situation calculus
    • MIT Press
    • J. Pinto and R. Reiter, Temporal reasoning in logic programming: A case for the situation calculus, in: Proc. 1993 Intl. Conf. on Logic Programming (MIT Press, 1993) pp. 203-221.
    • (1993) Proc. 1993 Intl. Conf. on Logic Programming , pp. 203-221
    • Pinto, J.1    Reiter, R.2
  • 26
    • 0001599027 scopus 로고
    • On the declarative and procedural semantics of stratified deductive databases
    • ed. J. Minker Morgan-Kaufmann
    • T. Przymusinski, On the declarative and procedural semantics of stratified deductive databases, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann, 1988) pp. 193-216.
    • (1988) Foundations of Deductive Databases and Logic Programming , pp. 193-216
    • Przymusinski, T.1
  • 33
    • 0037849359 scopus 로고
    • An introduction to least commitment planning
    • D.S. Weld, An introduction to least commitment planning, A.I. Magazine (1995).
    • (1995) A.I. Magazine
    • Weld, D.S.1


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