메뉴 건너뛰기




Volumn 2401 LNCS, Issue , 2002, Pages 393-404

Embedding defeasible logic into logic programs

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; LOGIC PROGRAMMING; PROGRAM TRANSLATORS; SEMANTICS; RECONFIGURABLE HARDWARE;

EID: 84888265093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45619-8_27     Document Type: Conference Paper
Times cited : (10)

References (22)
  • 2
    • 0033876868 scopus 로고    scopus 로고
    • Defeasible logic versus logic programming without negation as failure
    • G. Antoniou, M. J. Maher and D. Billington. Defeasible Logic versus Logic Programming without Negation as Failure, Journal of Logic Programming, 42 (2000): 47-57.
    • (2000) Journal of Logic Programming , vol.42 , pp. 47-57
    • Antoniou, G.1    Maher, M.J.2    Billington, D.3
  • 6
    • 33750037483 scopus 로고    scopus 로고
    • On the relationship between defeasible logic and well-founded semantics
    • LNCS 2173
    • G. Brewka. On the Relationship between Defeasible Logic and Well-Founded Semantics. In Proc. Logic Programming and Nonmonotonic Reasoning Conference, LNCS 2173, 2001, 121-132.
    • (2001) Proc. Logic Programming and Nonmonotonic Reasoning Conference , pp. 121-132
    • Brewka, G.1
  • 7
    • 0012352628 scopus 로고    scopus 로고
    • Logic programs with compiled preferences
    • J. P. Delgrande, T Schaub and H. Tompits. Logic Programs with Compiled Preferences. In Proc. ECAI 2000, 464-468.
    • (2000) Proc. ECAI , pp. 464-468
    • Delgrande, J.P.1    Schaub, T.2    Tompits, H.3
  • 9
    • 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 (1991): 365-385.
    • (1991) New Generation Computing , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 13
    • 0023596784 scopus 로고
    • Negation in logic programming
    • K. Kunen. Negation in Logic Programming. Journal of Logic Programming 4 (1987): 289-308.
    • (1987) Journal of Logic Programming , vol.4 , pp. 289-308
    • Kunen, K.1
  • 15
    • 85008541130 scopus 로고    scopus 로고
    • Propositional defeasible logic has linear complexity
    • M. J. Maher. Propositional Defeasible Logic has Linear Complexity. Theory and Practice of Logic Programming, 1 (6), 691-711, 2001.
    • (2001) Theory and Practice of Logic Programming , vol.1 , Issue.6 , pp. 691-711
    • Maher, M.J.1
  • 19
    • 0032131392 scopus 로고    scopus 로고
    • Inheritance comes of age: Applying nonmonotonic techniques to problems in industry
    • L. Morgenstern. Inheritance Comes of Age: Applying Nonmonotonic Techniques to Problems in Industry. Artificial Intelligence, 103 (1998): 1-34.
    • (1998) Artificial Intelligence , vol.103 , pp. 1-34
    • Morgenstern, L.1
  • 20
    • 0002458809 scopus 로고
    • Defeasible logic
    • D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Oxford University Press
    • D. Nute. Defeasible Logic. In D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 3, Oxford University Press 1994, 353-395.
    • (1994) Handbook of Logic in Artificial Intelligence and Logic Programming , vol.3 , pp. 353-395
    • Nute, D.1


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