Autor(en): | Bell, Siegfried Weber, Steffo |
Titel: | A note on paraconsistent entailment in machine learning |
Sprache (ISO): | en |
Zusammenfassung: | 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 . |
URI: | http://hdl.handle.net/2003/2579 http://dx.doi.org/10.17877/DE290R-14890 |
Erscheinungsdatum: | 1999-10-27 |
Provinienz: | Universität Dortmund |
Enthalten in den Sammlungen: | LS 08 Künstliche Intelligenz |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
weber_bell_94a.pdf | DNB | 252.57 kB | Adobe PDF | Öffnen/Anzeigen |
weber_bell_94a.ps | 702.13 kB | Postscript | Öffnen/Anzeigen |
Diese Ressource ist urheberrechtlich geschützt. |
Diese Ressource ist urheberrechtlich geschützt. rightsstatements.org