We present the design and implementation of SPINdle - an open source Java based defeasible logic reasoner capable to perform efficient and scalable reasoning on defeasible logic theories (including theories with over 1 million rules). The implementation covers both the standard and modal extensions to defeasible logics. It can be used as a standalone theory prover and can be embedded into any applications as a defeasible logic rule engine. It allows users or agents to issues queries, on a given knowledge base or a theory generated on the fly by other applications, and automatically produces the conclusions of its consequences. The theory can also be represented using XML. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lam, H. P., & Governatori, G. (2009). The making of SPINdle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5858 LNCS, pp. 315–322). https://doi.org/10.1007/978-3-642-04985-9_29
Mendeley helps you to discover research relevant for your work.