Buscar
Mostrando ítems 1-10 de 233
An alternative approach for quasi-truth
(Oxford University Press, 2014-04-01)
In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which ...
Discovering knowledge from data clustering using automatically defined interval type-2 fuzzy predicates
(Pergamon-Elsevier Science Ltd., 2017-02)
In data clustering fuzzy predicates act as cluster descriptors providing linguistically expressed knowledge which indicates how features are related to each cluster. Fuzzy predicates directly and automatically obtained ...
Reducing the gap between mobile and intelligent software agents
(Int Inst Informatics & Systemics, 2001-01-01)
This paper presents an approach to integrate an artificial intelligence (AI) technique, concretely rule-based processing, into mobile agents. In particular, it focuses on the aspects of designing and implementing an ...
Automatic design of interpretable fuzzy predicate systems for clustering using self-organizing maps
(Elsevier Science, 2015-01)
In the area of pattern recognition, clustering algorithms are a family of unsupervised classifiers designed with the aim to discover unrevealed structures in the data. While this is a never ending research topic, many ...
An alternative approach for quasi-truth
(Oxford University Press, 2014)
Intuitionistic Logic according to Dijkstra’s Calculus of Equational Deduction
(University of Notre Dame, 2008)
Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert’s style of proof and Gentzen’s deductive systems. In this context we call it CED ...
A fully classical truth theory characterized by substructural means
(Cambridge University Press, 2019-08)
We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid ...
Monadic Curry System N-1*
(Springer, 2010-01-01)
This paper is a sequel to [5], [6]. We present the Curry monadic system N-1* which has as extensions the Curry monadic algebras C-1* and P-1*. All those systems are extensions of the classical monadic algebras introduced ...
Construction of a canonical model for a first-order non-Fregean logic with a connective for reference and a total truth predicate
(2012)
Logics with quantifiers that range over a model-theoretic universe of propositions are interesting for several applications. For example, in the context of epistemic logic the knowledge axioms can be expressed by the single ...