Abstract
In this paper we report on a Java implementation of a variant of Temporal Defeasible Logic, an extension of Defeasible Logic developed to capture the concept of temporal persistence. The system consists of three elements: a graphical user interface for selecting defeasible theories, and for visualizing conclusions; a parser, which translates sets of rules in TXT or RuleML formats; and the inference engine to compute conclusions. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Rubino, R., & Rotolo, A. (2009). A java implementation of temporal defeasible logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5858 LNCS, pp. 297–304). https://doi.org/10.1007/978-3-642-04985-9_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
