메뉴 건너뛰기
19th Workshop on (Constraint) Logic Programming, W(C)LP 2005
Volumn , Issue , 2005, Pages 163-166
Cmodels for tight disjunctive logic programs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 33646060973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)
References (7)
  • 1
    • 23944497180 scopus 로고    scopus 로고
    • Character-based cladistics and answer set programming
    • In, [BEMR05]
    • [BEMR05] D. R. Brooks, E. Erdem, J. W. Minett, and D. Ringe. Character-based cladistics and answer set programming. In Proc. PADL'05, pages 37-51, 2005.
    • (2005) Proc. PADL'05 , pp. 37-51
    • Brooks, D.R.1    Erdem, E.2    Minett, J.W.3    Ringe, D.4
  • 2
    • 0000826543 scopus 로고
    • Negation as failure
    • In Herve Gallaire and Jack Minker, editors, Plenum Press, New York, [Cla78]
    • [Cla78] Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
    • (1978) Logic and Data Bases , pp. 293-322
    • Clark, K.1
  • 3
    • 33750084885 scopus 로고    scopus 로고
    • Rectilinear steiner tree construction using answer set programming
    • In, [EW04]
    • [EW04] E. Erdem and M. D. F. Wong. Rectilinear steiner tree construction using answer set programming. In Proc. ICLP'04, pages 386-399, 2004.
    • (2004) Proc. ICLP'04 , pp. 386-399
    • Erdem, E.1    Wong, M.D.F.2
  • 4
    • 77951505493 scopus 로고
    • Classical negation in logic pro-grams and disjunctive databases
    • [GL91]
    • [GL91] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic pro-grams and disjunctive databases. New Generation Computing, 9: 365-385, 1991.
    • (1991) New Generation Computing , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 5
    • 9444267655 scopus 로고    scopus 로고
    • Sat-based answer set programming
    • In, [GLM04]
    • [GLM04] Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea. Sat-based answer set programming. In Proc. AAAI-04, pages 61-66, 2004.
    • (2004) Proc. AAAI-04 , pp. 61-66
    • Giunchiglia, E.1    Lierler, Y.2    Maratea, M.3
  • 6
    • 0346264951 scopus 로고    scopus 로고
    • Loop formulas for disjunctive logic programs
    • In, [LL03]
    • [LL03] Joohyung Lee and Vladimir Lifschitz. Loop formulas for disjunctive logic programs. In Proc. ICLP-03, pages 451-465, 2003.
    • (2003) Proc. ICLP-03 , pp. 451-465
    • Lee, J.1    Lifschitz, V.2
  • 7
    • 0036923682 scopus 로고    scopus 로고
    • ASSAT: Computing answer sets of a logic program by SAT solvers
    • In, [LZ02]
    • [LZ02] Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-02, pages 112-117, 2002.
    • (2002) Proc. AAAI-02 , pp. 112-117
    • Lin, F.1    Zhao, Y.2

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