메뉴 건너뛰기




Volumn , Issue , 2009, Pages 860-866

On first-order definability and computability of progression for local-effect actions and beyond

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

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

References (13)
  • 1
    • 84880896799 scopus 로고    scopus 로고
    • Computing strongest necessary and weakest sufficient conditions of first-order formulas
    • P. Doherty, W. Lukaszewicz, and A. Szalas. Computing strongest necessary and weakest sufficient conditions of first-order formulas. In Proc. IJCAI-01, 2001.
    • Proc. IJCAI-01, 2001
    • Doherty, P.1    Lukaszewicz, W.2    Szalas, A.3
  • 2
    • 0027694534 scopus 로고
    • Representing actions and change by logic programs
    • M. Gelfond and V. Lifschitz. Representing actions and change by logic programs. Journal of Logic Programming, 17(2-4):301-323, 1993.
    • (1993) Journal of Logic Programming , vol.17 , Issue.2-4 , pp. 301-323
    • Gelfond, M.1    Lifschitz, V.2
  • 3
    • 29344448462 scopus 로고    scopus 로고
    • Evaluation-based reasoning with disjunctive information in first-order knowledge bases
    • G. Lakemeyer and H. J. Levesque. Evaluation-based reasoning with disjunctive information in first-order knowledge bases. In Proc. KR, 2002.
    • Proc. KR, 2002
    • Lakemeyer, G.1    Levesque, H.J.2
  • 5
    • 0010316909 scopus 로고    scopus 로고
    • A completeness result for reasoning with incomplete first-order knowledge bases
    • H. J. Levesque. A completeness result for reasoning with incomplete first-order knowledge bases. In Proc. KR-98, 1998.
    • Proc. KR-98, 1998
    • Levesque, H.J.1
  • 7
    • 0031146160 scopus 로고    scopus 로고
    • How to progress a database
    • F. Lin and R. Reiter. How to progress a database. Artificial Intelligence, 92(1-2):131-167, 1997.
    • (1997) Artificial Intelligence , vol.92 , Issue.1-2 , pp. 131-167
    • Lin, F.1    Reiter, R.2
  • 8
    • 78751687566 scopus 로고    scopus 로고
    • Levesque. Tractable reasoning in first-order knowledge bases with disjunctive information
    • Y. Liu and H. J. Levesque. Tractable reasoning in first-order knowledge bases with disjunctive information. In Proc. AAAI-05, 2005.
    • Proc. AAAI-05, 2005
    • Liu, Y.1    J, H.2
  • 9
    • 85167394386 scopus 로고    scopus 로고
    • A logic of limited belief for reasoning with disjunctive information
    • Y. Liu, G. Lakemeyer, and H. J. Levesque. A logic of limited belief for reasoning with disjunctive information. In Proc. KR-04, 2004.
    • Proc. KR-04, 2004
    • Liu, Y.1    Lakemeyer, G.2    Levesque, H.J.3
  • 12
    • 77953704322 scopus 로고    scopus 로고
    • On the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture
    • S. Vassos and H. J. Levesque. On the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture. In Proc. AAAI-08, 2008.
    • Proc. AAAI-08, 2008
    • Vassos, S.1    Levesque, H.J.2
  • 13
    • 85079088866 scopus 로고    scopus 로고
    • First-order strong progression for local-effect basic action theories
    • S. Vassos, G. Lakemeyer, and H. J. Levesque. First-order strong progression for local-effect basic action theories. In Proc. KR-08, 2008.
    • Proc. KR-08, 2008
    • Vassos, S.1    Lakemeyer, G.2    Levesque, H.J.3


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