Propositional Clausal Defeasible Logic

File Size Format
52181_1.pdf 152Kb Adobe PDF View
Title Propositional Clausal Defeasible Logic
Author Billington, David
Journal Name Lecture Notes in Computer Science
Editor Holldobler, Lutz, Wansing
Year Published 2008
Place of publication Germany
Publisher Springer
Abstract Abstract. Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loops, terminates, and has a range of deduction algorithms to cater for a range of intuitions.
Peer Reviewed Yes
Published Yes
Publisher URI http://www.springer.com/series/558
Alternative URI http://dx.doi.org/10.1007/978-3-540-87803-2
Copyright Statement Copyright 2008 Springer-Verlag. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com
Volume 5293
Page from 34
Page to 47
ISSN 0302-9743
Date Accessioned 2008-10-23
Date Available 2009-02-24T22:38:01Z
Language en_AU
Faculty Faculty of Science, Environment, Engineering and Technology
Subject PRE2009-Mathematical Logic, Set Theory, Lattices and Combinatorics
URI http://hdl.handle.net/10072/21424
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice