메뉴 건너뛰기




Volumn , Issue , 2004, Pages 1-6

A-Prolog with CR-Rules and Ordered Disjunction

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTROL SYSTEMS; DECISION SUPPORT SYSTEMS; INTELLIGENT AGENTS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; ROUTERS; SEMANTICS; SENSORS; SET THEORY; SPACE SHUTTLES;

EID: 1942451807     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (17)
  • 2
    • 9444230698 scopus 로고    scopus 로고
    • Logic programs with consistency-restoring rules
    • Patrick Doherty, John McCarthy, and Mary-Anne Williams, editors, AAAI 2003 Spring Symposium Series, Mar
    • Marcello Balduccini and Michael Gelfond. Logic programs with consistency-restoring rules. In Patrick Doherty, John McCarthy, and Mary-Anne Williams, editors, International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, Mar 2003.
    • (2003) International Symposium on Logical Formalization of Commonsense Reasoning
    • Balduccini, M.1    Gelfond, M.2
  • 4
    • 0036926274 scopus 로고    scopus 로고
    • Logic programming with ordered disjunction
    • Gerhard Brewka. Logic programming with ordered disjunction. In Proceedings of AAAI-02, 2002.
    • (2002) Proceedings of AAAI-02
    • Brewka, G.1
  • 8
    • 0041110124 scopus 로고
    • Epistemic approach to formalization of commonsense reasoning
    • University of Texas at El Paso
    • Michael Gelfond. Epistemic approach to formalization of commonsense reasoning. Technical Report TR-91-2, University of Texas at El Paso, 1991
    • (1991) Technical Report , vol.TR-91-2
    • Gelfond, M.1
  • 10
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, pages 365-385, 1991.
    • (1991) New Generation Computing , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 11
    • 0032639194 scopus 로고    scopus 로고
    • Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe petri nets
    • K. Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe petri nets. Fundamenta Informaticae, 37(3):247-268, 1999.
    • (1999) Fundamenta Informaticae , vol.37 , Issue.3 , pp. 247-268
    • Heljanko, K.1
  • 12
    • 0003212564 scopus 로고
    • Generalized stable models: A semantics for abduction
    • IOS Press
    • Antonis C. Kakas and Paolo Mancarella. Generalized stable models: a semantics for abduction. In Proceedings of ECAI-90, pages 385-391. IOS Press, 1990.
    • (1990) Proceedings of ECAI-90 , pp. 385-391
    • Kakas, A.C.1    Mancarella, P.2
  • 13
    • 0036923682 scopus 로고    scopus 로고
    • Assat: Computing answer sets of a logic program by sat solvers
    • Fangzhen Lin and Yuting Zhao. Assat: Computing answer sets of a logic program by sat solvers. In Proceedings of AAAI-02, 2002.
    • (2002) Proceedings of AAAI-02
    • Lin, F.1    Zhao, Y.2
  • 16
    • 1942545151 scopus 로고    scopus 로고
    • Non-monotonic reasoning on beowulf platforms
    • Veronica Dahl and Philip Wadler, editors, PADL 2003, Jan
    • Enrico Pontelli, Marcello Balduccini, and F. Bermudez. Non-monotonic reasoning on beowulf platforms. In Veronica Dahl and Philip Wadler, editors, PADL 2003, volume 2562 of Lecture Notes in Artificial Intelligence (LNCS), pages 37-57, Jan 2003.
    • (2003) Lecture Notes in Artificial Intelligence (LNCS) , vol.2562 , pp. 37-57
    • Pontelli, E.1    Balduccini, M.2    Bermudez, F.3


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