A note on paraconsistent entailment in machine learning
dc.contributor.author | Bell, Siegfried | de |
dc.contributor.author | Weber, Steffo | de |
dc.date.accessioned | 2004-12-06T12:53:30Z | |
dc.date.available | 2004-12-06T12:53:30Z | |
dc.date.created | 1994 | de |
dc.date.issued | 1999-10-27 | de |
dc.description.abstract | Recent publications witness that there is a growing interest in multi-valued logics for machine learning; some of them arose as a more or less formal description of a computer program's inferential behaviour. The referred origin of these systems is Belnap's fourvalued logic, which has been adopted for the various needs of knowledge representation in a machine learning system. However, it is unclear what an inconsistent knowledge base entails. We investigate Mobal's logic < and show how to interpret the term `paraconsistent inference' of this system. It turns out that the meaning of the basic connective ! of < can be represented as a combination of two systems of Kleene's strong three-valued logic, where the two systems differ in the set of designated truth values. The resulting logic is functionally complete but the entailment relation is not axiomatizable. This drawback yields a fundamental difference between nonmontonicity within belief-revision and non-monotonic reasoning systems like Servi's refinement 1 of Gabbay's . | en |
dc.format.extent | 258634 bytes | |
dc.format.extent | 718982 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.issn | 0943-4135 | de |
dc.identifier.uri | http://hdl.handle.net/2003/2579 | |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-14890 | |
dc.language.iso | en | de |
dc.publisher | Universität Dortmund | de |
dc.relation.ispartofseries | Forschungsberichte des Lehrstuhls VIII, Fachbereich Informatik der Universität Dortmund ; 10 | de |
dc.subject.ddc | 004 | de |
dc.title | A note on paraconsistent entailment in machine learning | en |
dc.type | Text | de |
dc.type.publicationtype | report | |
dcterms.accessRights | open access |