A Defeasible Logic for Clauses

Loading...
Thumbnail Image
File version
Author(s)
Billington, David
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Wang, DH

Reynolds, M

Date
2011
Size

243298 bytes

File type(s)

application/pdf

Location
License
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.

Journal Title

Lecture Notes in Computer science

Conference Title
Book Title
Edition
Volume

7106

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 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

Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence not elsewhere classified

Persistent link to this record
Citation
Collections