Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
Abstract. In domains such as music and visual art, where the quality of an individual often depends on subjective or hard to express concepts, the automating fitness assignment bec...
Bill Z. Manaris, Penousal Machado, Clayton McCaule...
Abstract. Paraconsistent intuitionistic fuzzy set is an extension of intuitionistic fuzzy set or interval-valued fuzzy set. It relaxes the requirement that t + f ≤ 1, where t is ...