摘要:

We investigate a logic PFD, as introduced in [FA]. In our notation, this logic is enriched with operators P>r(r € [0,1]) where the intended meaning of P>rφ is “the probability of φ (at a given world) is strictly greater than r”. We also adopt the semantics of [FA]: a class of “F-restricted probabilistic kripkean models”. We give a completeness proof that essentially differs from that in [FA]: our “peremptory lemma” (a lemma in PFD rather than about it) facilitates the construction of a canonical model for PFD considerably. We show that this construction can be carried out using only finitary means, and also give a filtration-technique for the intended models. We then define an alternative (in some sense more natural) semantics for the logic, and show some of its properties. Finally, we prove decidability of the logic.

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510916

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

摘要:

Possibilistic states of information are fuzzy sets of possible worlds. They constitute a complete lattice, which can be endowed with a monoidal operation (a t-norm) to produce a quantal. An algebraic semantics is presented which links possibilistic formulae with information states, and gives a natural interpretation of logical connectives as operations on fuzzy sets. Due to the quantal structure of information states, we obtain a system which shares several features with (exponential-free) intuitionistic linear logic. Soundness and completeness are proved, parametrically on the choice of the t-norm operation.

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510917

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

摘要:

In this paper, we propose a formalization of fuzzy logic and obtain some results concerning the composition, exchange and compatibility with propositional connectives of fuzzy quantifiers, modifiers and qualifiers in this setting.

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510918

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

摘要:

This is a continuing attempt in a series of papers [KM 93, Mur 93, Mur 96] to show how computer-represented knowledge can be arranged as elements of an effectively represented semantic (or algebraic) domain in the sense of [GS 90]. We present a direct deductive description of the domain, which was defined semantically in [KM 93], via the Scott's notion of information system. Also, the internal structure of the continuous ampliative operations coordinated with the domain's effective basis is established. Though we always remain in the paradigm of the toleration of contradictory information described in [Bel 75, Bel 76], the approach in question could be extended to include domains for consistency knowledge bases.

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510919

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510920

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510921

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510922

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1997.10510915

出版商:Taylor & Francis Group    

年代:1997

数据来源: Taylor