A Defeasible Logic for Clauses

File Size Format
74872_1.pdf 237Kb Adobe PDF View
Title A Defeasible Logic for Clauses
Author Billington, David
Journal Name Lecture Notes in Computer Science
Editor Dianhui Wang, Mark Reynolds
Year Published 2011
Place of publication Germany
Publisher Springer
Abstract Abstract. A new non-monotonic logic called clausal defeasible logic (CDL) is defined and explained. CDL is the latest in the family of defeasible logics, which, it is argued, is important for knowledge representation and reasoning. CDL increases the expressive power of defeasible logic by allowing clauses where previous defeasible logics only allowed literals. This greater expressiveness allows the representation of the Lottery Paradox, for example. CDL is well-defined, consistent, and has other desirable properties.
Peer Reviewed Yes
Published Yes
Alternative URI http://dx.doi.org/10.1007/978-3-642-25832-9_48
Copyright Statement Copyright 2011 Springer Berlin / Heidelberg. 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 7106
Page from 472
Page to 480
ISSN 0302-9743
Date Accessioned 2012-01-02
Language en_US
Faculty Faculty of Science, Environment, Engineering and Technology
Subject Artificial Intelligence and Image Processing
URI http://hdl.handle.net/10072/43946
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice