메뉴 건너뛰기




Volumn , Issue , 2001, Pages 597-602

A comparative study of logic programs with preference

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; COMPARATIVE STUDIES; EXTENDED LOGIC PROGRAMMING; IMPLEMENTATION TECHNIQUES; LOGIC PROGRAMS; ORDER PRESERVATION; PREFERENCE INFORMATION; STANDARD LOGIC;

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

References (12)
  • 1
    • 0001998657 scopus 로고
    • How to prefer more specific defaults in terminological default logic
    • F. Baader and B. Hollunder. How to prefer more specific defaults in terminological default logic. In Proc. IJCAI'93, p 669-674, 1993.
    • (1993) Proc. IJCAI'93 , pp. 669-674
    • Baader, F.1    Hollunder, B.2
  • 2
    • 0033522718 scopus 로고    scopus 로고
    • Preferred answer sets for extended logic programs
    • G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297-356, 1999.
    • (1999) Artificial Intelligence , vol.109 , Issue.1-2 , pp. 297-356
    • Brewka, G.1    Eiter, T.2
  • 3
    • 0342779705 scopus 로고    scopus 로고
    • Prioritizing default logic
    • St. Hölldobler, ed, Kluwer, To appear
    • G. Brewka and T. Eiter. Prioritizing default logic. In St. Hölldobler, ed, Intellectics and Computational Logic. Kluwer, 2000. To appear.
    • (2000) Intellectics and Computational Logic
    • Brewka, G.1    Eiter, T.2
  • 4
    • 85028463688 scopus 로고
    • Adding priorities and specificity to default logic
    • L. Pereira and D. Pearce, eds, Springer
    • G. Brewka. Adding priorities and specificity to default logic. In L. Pereira and D. Pearce, eds, Proc. JELIA'94, p 247-260. Springer, 1994.
    • (1994) Proc. JELIA'94 , pp. 247-260
    • Brewka, G.1
  • 5
    • 0242355922 scopus 로고    scopus 로고
    • Logic programs with compiled preferences
    • IOS Press
    • J. Delgrande, T. Schaub, and H. Tompits. Logic programs with compiled preferences. In Proc. ECAI 2000, p 392-398. IOS Press, 2000.
    • (2000) Proc. ECAI 2000 , pp. 392-398
    • Delgrande, J.1    Schaub, T.2    Tompits, H.3
  • 6
    • 77951505493 scopus 로고
    • Classical negation in logic programs and deductive databases
    • M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365-385, 1991.
    • (1991) New Generation Computing , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 7
    • 0342344652 scopus 로고    scopus 로고
    • Reasoning with prioritized defaults
    • J. Dix, L. Pereira, and T. Przymusinski, eds, Springer
    • M. Gelfond and T. Son. Reasoning with prioritized defaults. In J. Dix, L. Pereira, and T. Przymusinski, eds, Workshop on Logic Programming and Knowledge Representation, p 164-223. Springer, 1997.
    • (1997) Workshop on Logic Programming and Knowledge Representation , pp. 164-223
    • Gelfond, M.1    Son, T.2
  • 8
    • 0002320998 scopus 로고
    • On specificity in default logic
    • Morgan Kaufmann
    • J. Rintanen. On specificity in default logic. In Proc. IJCAI'95, p 1474-1479. Morgan Kaufmann, 1995.
    • (1995) Proc. IJCAI'95 , pp. 1474-1479
    • Rintanen, J.1
  • 9
    • 0001856609 scopus 로고    scopus 로고
    • Representing priorities in logic programs
    • M. Maher, ed, MIT Press
    • C. Sakama and K. Inoue. Representing priorities in logic programs. In M. Maher, ed, Proc. JCSLP'96, p 82-96. MIT Press, 1996.
    • (1996) Proc. JCSLP'96 , pp. 82-96
    • Sakama, C.1    Inoue, K.2
  • 10
    • 0348066009 scopus 로고
    • The alternating fixpoint of logic programs with negation
    • A. van Gelder. The alternating fixpoint of logic programs with negation. J. Computer and System Science, 47:185-120, 1993.
    • (1993) J. Computer and System Science , vol.47 , pp. 185-1120
    • Van Gelder, A.1
  • 11
    • 84867764884 scopus 로고    scopus 로고
    • Alternating fixpoint theory for logic programs with priority
    • Springer
    • K. Wang, L. Zhou, and F. Lin. Alternating fixpoint theory for logic programs with priority. In Proc. Int'l Conf. Computational Logic, p 164-178. Springer, 2000.
    • (2000) Proc. Int'l Conf. Computational Logic , pp. 164-178
    • Wang, K.1    Zhou, L.2    Lin, F.3
  • 12
    • 0002548654 scopus 로고    scopus 로고
    • Answer sets for prioritized logic programs
    • J. Maluszynski, ed, MIT Press
    • Y. Zhang and N. Foo. Answer sets for prioritized logic programs. In J. Maluszynski, ed, Proc. ISLP'97, p 69-84. MIT Press, 1997.
    • (1997) Proc. ISLP'97 , pp. 69-84
    • Zhang, Y.1    Foo, N.2


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