A Fixed-Point Semantics for Plausible Logic

There are no files associated with this record.

Title A Fixed-Point Semantics for Plausible Logic
Author Billington, David
Journal Name Lecture Notes in Computer Science
Editor J.G.Carbonell and J.Siekmann
Year Published 2005
Place of publication Germany
Publisher Springer
Abstract Plausible Logic is a non-monotonic logic with an efficient implementation, but no semantics. This paper gives Plausible Logic a fixed-point semantics, similar to the extensions of Reiter's Default Logic. The proof theory is sound but deliberately incomplete with respect to this semantics. This is because the semantics is an attempt to define what follows from a plausible theory, rather than merely giving a different characterisation of what is provable.
Peer Reviewed Yes
Published Yes
Alternative URI http://dx.doi.org/10.1007/11589990_86
Volume 3809
Page from 812
Page to 815
ISSN 0302-9743
Date Accessioned 2006-03-02
Date Available 2010-08-20T06:26:09Z
Language en_AU
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Engineering and Information Technology
Subject PRE2009-Mathematical Logic, Set Theory, Lattices and Combinatorics
URI http://hdl.handle.net/10072/4259
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Brief Record

Griffith University copyright notice