oru.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Towards a many‐valued logic of quantified belief: The information lattice
Department of Computer and Information Science, University of Linköping, Linköping, Sweden. (AASS)ORCID-id: 0000-0002-9477-4044
1991 (Engelska)Ingår i: International Journal of Intelligent Systems, ISSN 0884-8173, Vol. 6, nr 2, s. 135-166Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

In a previous article we introduced extended logical operators, based on the Dubois family of T-norms and their dual T-conorms, to induce a semantics for a language involving and, or, and negation. Thus, given these logical operators and an arbitrary set-up S (a mapping from atomic formulas into a set of truth-values), we extended S to a mapping of all formulas into a set of truth-values defined as belief/disbelief pairs. Then using a particular partial order between belief/disbelief pairs to define entailment we were able to derive a many-valued variant of the so-called relevance logic. Here we introduce the notion of the so-called information lattice built upon another type of partial order between belief/disbelief pairs. Furthermore, we introduce specific meet and join operations and use them to provide answers to three fundamental questions: How does the reasoning machine represent belief and/or disbelief in the validity of the constituents of a complex formula when it is supplied with belief and/or disbelief in the validity of this complex formula as a whole; how does it determine the amount of belief and/or disbelief to be assigned to complex formulas in an epistemic state, that is, a collection of set-ups; and finally, how does it change its present belief and/or disbelief in the validity of formulas already in its data base, when provided with an input bringing in new belief and/or disbelief in the validity of these formulas.

Ort, förlag, år, upplaga, sidor
John Wiley & Sons, 1991. Vol. 6, nr 2, s. 135-166
Nyckelord [en]
symbolic reasoning, reasoning with uncertainty, representation of uncertainty
Nationell ämneskategori
Teknik och teknologier
Forskningsämne
Datavetenskap; Datateknik
Identifikatorer
URN: urn:nbn:se:oru:diva-42522DOI: 10.1002/int.4550060204ISI: A1991FB18100003Scopus ID: 2-s2.0-0026123597OAI: oai:DiVA.org:oru-42522DiVA, id: diva2:786840
Tillgänglig från: 2015-02-06 Skapad: 2015-02-06 Senast uppdaterad: 2017-10-17Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Driankov, Dimiter

Sök vidare i DiVA

Av författaren/redaktören
Driankov, Dimiter
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 433 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf