메뉴 건너뛰기




Volumn 5858 LNCS, Issue , 2009, Pages 297-304

A java implementation of temporal defeasible logic

Author keywords

[No Author keywords available]

Indexed keywords

DEFEASIBLE LOGIC; JAVA IMPLEMENTATION; TEMPORAL PERSISTENCE;

EID: 70649097234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04985-9_27     Document Type: Conference Paper
Times cited : (5)

References (18)
  • 1
    • 0021466185 scopus 로고
    • Towards a general theory of action and time
    • Allen, J.: Towards a general theory of action and time. Artificial Intelligence 23 (1984)
    • (1984) Artificial Intelligence , vol.23
    • Allen, J.1
  • 4
    • 0033876868 scopus 로고    scopus 로고
    • Defeasible logic versus logic programming without negation as failure
    • Antoniou, G., Maher, M.J., Billington, D.: Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming 42, 47-57 (2000)
    • (2000) Journal of Logic Programming , vol.42 , pp. 47-57
    • Antoniou, G.1    Maher, M.J.2    Billington, D.3
  • 8
    • 38349074391 scopus 로고    scopus 로고
    • Governatori, G., Hulstijn, J., Riveret, R., Rotolo, A.: Characterising deadlines in temporal modal defeasible logic. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), 4830, pp. 486-496. Springer, Heidelberg (2007)
    • Governatori, G., Hulstijn, J., Riveret, R., Rotolo, A.: Characterising deadlines in temporal modal defeasible logic. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 486-496. Springer, Heidelberg (2007)
  • 9
    • 33646832881 scopus 로고    scopus 로고
    • Governatori, G., Pham, H.D.: A semantic web based architecture for e-contracts in defeasible logic. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, 3791, pp. 145-159. Springer, Heidelberg (2005)
    • Governatori, G., Pham, H.D.: A semantic web based architecture for e-contracts in defeasible logic. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 145-159. Springer, Heidelberg (2005)
  • 10
    • 70649111529 scopus 로고    scopus 로고
    • Governatori, G., Rotolo, A.: Temporal defeasible logic has linear complexity. Technical report, NICTA, Queensland Research Laboratory, Australia (2009), http://www.governatori.net/publications.html
    • Governatori, G., Rotolo, A.: Temporal defeasible logic has linear complexity. Technical report, NICTA, Queensland Research Laboratory, Australia (2009), http://www.governatori.net/publications.html
  • 11
    • 77955144731 scopus 로고    scopus 로고
    • Changing legal systems: Legal abrogations and annulments in defeasible logic
    • forthcoming
    • Governatori, G., Rotolo, A.: Changing legal systems: Legal abrogations and annulments in defeasible logic. The Logic Journal of IGPL (forthcoming)
    • The Logic Journal of IGPL
    • Governatori, G.1    Rotolo, A.2
  • 12
    • 77950411147 scopus 로고    scopus 로고
    • Governatori, G., Rotolo, A., Sartor, G.: Temporalised normative positions in defeasible logic. In: ICAIL 2005, pp. 25-34. ACM Press, New York (2005)
    • Governatori, G., Rotolo, A., Sartor, G.: Temporalised normative positions in defeasible logic. In: ICAIL 2005, pp. 25-34. ACM Press, New York (2005)
  • 13
    • 38349075318 scopus 로고    scopus 로고
    • Governatori, G., Terenziani, P.: Temporal extensions to defeasible logic. In: Orgun, M.A., Thornton, J. (eds.) AI2007. LNCS (LNAI), 4830, pp. 476-485. Springer, Heidelberg (2007)
    • Governatori, G., Terenziani, P.: Temporal extensions to defeasible logic. In: Orgun, M.A., Thornton, J. (eds.) AI2007. LNCS (LNAI), vol. 4830, pp. 476-485. Springer, Heidelberg (2007)
  • 14
    • 0442311943 scopus 로고    scopus 로고
    • Representing e-commerce rules via situated courteous logic programs in RuleML
    • Grosof, B.N.: Representing e-commerce rules via situated courteous logic programs in RuleML. Electronic Commerce Research and Applications 3(1), 2-20 (2004)
    • (2004) Electronic Commerce Research and Applications , vol.3 , Issue.1 , pp. 2-20
    • Grosof, B.N.1
  • 15
    • 85008541130 scopus 로고    scopus 로고
    • Propositional defeasible logic has linear complexity
    • Maher, M.: Propositional defeasible logic has linear complexity. Theory and Practice of Logic Programming 1, 691-711 (2001)
    • (2001) Theory and Practice of Logic Programming , vol.1 , pp. 691-711
    • Maher, M.1
  • 18
    • 0031123870 scopus 로고    scopus 로고
    • Representing actions in logic programs and default theories: A situation calculus approach
    • Turner, H.: Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming 31(1-3), 245-298 (1997)
    • (1997) Journal of Logic Programming , vol.31 , Issue.1-3 , pp. 245-298
    • Turner, H.1


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