Search results for "Intelligence"

showing 10 items of 6959 documents

Categories of lattice-valued sets as categories of arrows

2006

In this paper we introduce a category X(A) which is a generalization of the category of lattice-valued subsets of sets Set(JCPos) introduced by us earlier. We show the necessary and sufficient conditions for X(A) to be topological over XxA.

Discrete mathematicsHigher category theoryClosed categoryArtificial IntelligenceLogicMathematics::Category TheoryCategoryConcrete categoryCategory of topological spacesCategory of setsTopological category2-categoryMathematicsFuzzy Sets and Systems
researchProduct

L -valued bornologies on powersets

2016

In M. Abel and A. ostak (2011) [1], the concept of an L-fuzzy bornology was introduced. Actually, an L-fuzzy bornology on a set X is a certain ideal in the family LX of L-fuzzy subsets of a set X. Here we propose an alternative approach to fuzzification of the concept of bornology. We define an L-valued bornology on a set X as an L-fuzzy subset B of the powerset 2X satisfying L-valued analogues of the axioms of a bornology. Basic properties of L-valued bornological spaces are studied. Our special interest concerns L-valued bornologies induced by fuzzy metrics and relative compactness-type L-valued bornologies in ChangGoguen L-topological spaces.

Discrete mathematicsIdeal (set theory)Logic010102 general mathematicsFuzzy set02 engineering and technology01 natural sciencesFuzzy logicFuzzy topologyAlgebraSet (abstract data type)Artificial Intelligence0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0101 mathematicsAxiomMathematicsFuzzy Sets and Systems
researchProduct

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs

2014

In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …

Discrete mathematicsImplicit functionBinary decision diagram010102 general mathematics02 engineering and technologyFunction (mathematics)Computer Science::Artificial IntelligenceComputer Science::Computational Complexity01 natural sciencesCombinatoricsNondeterministic algorithmComputer Science::Logic in Computer SciencePartial function0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0101 mathematicsBoolean functionQuantumQuantum computerMathematics
researchProduct

Centering and Compound Conditionals under Coherence

2016

There is wide support in logic , philosophy , and psychology for the hypothesis that the probability of the indicative conditional of natural language, \(P(\textit{if } A \textit{ then } B)\), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that \(P(\textit{if } A \textit{ then } B)= P(B|A)\) with de Finetti’s conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds a…

Discrete mathematicsIndicative conditionalcenteringSettore MAT/06 - Probabilita' E Statistica Matematica05 social sciencesClassical logicConditional probabilityInference02 engineering and technologyCoherence (philosophical gambling strategy)p-entailmentn-conditional event050105 experimental psychologycoherenceLogical biconditionalp-validity0202 electrical engineering electronic engineering information engineeringbiconditional event020201 artificial intelligence & image processing0501 psychology and cognitive sciencesProbabilistic analysis of algorithmsArithmeticMathematicsEvent (probability theory)Conditional
researchProduct

Extensions and intentions in the rough set theory

1998

Abstract The approach to rough set theory proposed in this paper is based on the mutual correspondence of the concepts of extension and intension. It is different from the well-known approaches in the literature in that the upper approximations and the lower approximations of ‘unknown’ sets are considered as certain families of ‘known’ sets. This approach makes it possible to formulate necessary and sufficient conditions for the existence of operations on rough sets, which are analogous to classical operations on sets. The basic results presented in this paper, based on certain ideas of the second author, were formulated by the first author in his doctoral dissertation prepared under the su…

Discrete mathematicsInformation Systems and ManagementApproximations of πDominance-based rough set approachIntensionExtension (predicate logic)Computer Science ApplicationsTheoretical Computer ScienceAlgebraArtificial IntelligenceControl and Systems EngineeringApproximation operatorsRough setDoctoral dissertationSoftwareUpper approximationMathematicsInformation Sciences
researchProduct

Sobriety and spatiality in categories of lattice-valued algebras

2012

The paper provides an analogue of the famous equivalence between the categories of sober topological spaces and spatial locales for the framework of (L,M)-fuzzy topology of Kubiak and Sostak (and partly to that of Guido). To be more general, we replace locales with localic lattice-valued algebras in the sense of Di Nola and Gerla and use the respective generalized topological setting. As a result, it appears that the shift from crisp algebras to lattice-valued algebras weakens (resp. strengthens) considerably the classical (including the point-set lattice-theoretic setting of Rodabaugh) notion of sobriety (resp. spatiality).

Discrete mathematicsInterior algebraSobrietyArtificial IntelligenceLogicMathematics::General TopologyGeneral topologyTopological spaceEquivalence (formal languages)MathematicsFuzzy Sets and Systems
researchProduct

Spatial reasoning withRCC8and connectedness constraints in Euclidean spaces

2014

The language RCC 8 is a widely-studied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of non-empty, regular closed sets of n-dimensional Euclidean space, here denoted RC + ( R n ) , and its non-logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key question is the satisfiability problem: given a finite set of atomic RCC 8 -constraints in m variables, determine whether there exists an m-tuple of elements of RC + ( R n ) satisfying them. These problems are known to coincide for all n � 1 , so that RCC 8 -satisfiability is independent of dimension. This c…

Discrete mathematicsLinguistics and LanguageClosed setEuclidean spaceSocial connectednessLanguage and LinguisticsSatisfiabilityDecidabilityCombinatoricsArtificial IntelligenceEuclidean geometryBoolean satisfiability problemFinite setMathematicsArtificial Intelligence
researchProduct

Best Proximity Point Results in Non-Archimedean Fuzzy Metric Spaces

2013

We consider the problem of finding a best proximity point which achieves the minimum distance between two nonempty sets in a non-Archimedean fuzzy metric space. First we prove the existence and uniqueness of the best proximity point by using di fferent contractive conditions, then we present some examples to support our best proximity point theorems.

Discrete mathematicsLogicApplied MathematicsMinimum distanceBest proximity pointComputational intelligenceNon-Archimedean fuzzy metric spaceManagement Science and Operations ResearchTopologyIndustrial and Manufacturing EngineeringFuzzy metric spaceTheoretical Computer ScienceArtificial IntelligenceControl and Systems EngineeringSettore MAT/05 - Analisi MatematicaPoint (geometry)Best approximationUniquenessInformation SystemsMathematics
researchProduct

Heyting-valued interpretations for Constructive Set Theory

2006

AbstractWe define and investigate Heyting-valued interpretations for Constructive Zermelo–Frankel set theory (CZF). These interpretations provide models for CZF that are analogous to Boolean-valued models for ZF and to Heyting-valued models for IZF. Heyting-valued interpretations are defined here using set-generated frames and formal topologies. As applications of Heyting-valued interpretations, we present a relative consistency result and an independence proof.

Discrete mathematicsLogicConstructive set theoryFormal topologyHeyting-valued modelsConstructive set theoryHeyting algebraConsistency (knowledge bases)ConstructiveAlgebraMathematics::LogicPointfree topologyConstructive set theory Heyting algebras independence proofsMathematics::Category TheoryComputer Science::Logic in Computer ScienceIndependence (mathematical logic)Heyting algebraFrame (artificial intelligence)FrameSet theoryFormal topologyMathematicsAnnals of Pure and Applied Logic
researchProduct

Extremal problems of approximation theory in fuzzy context

1999

Abstract The problem of approximation of a fuzzy subset of a normed space is considered. We study the error of approximation, which in this case is characterized by an L -fuzzy number. In order to do this we define the supremum of an L -fuzzy set of real numbers as well as the supremum and the infimum of a crisp set of L -fuzzy numbers. The introduced concepts allow us to investigate the best approximation and the optimal linear approximation. In particular, we consider approximation of a fuzzy subset in the space L p m of differentiable functions in the L q -metric. We prove the fuzzy counterparts of duality theorems, which in crisp case allows effectively to solve extremal problems of the…

Discrete mathematicsLogicFuzzy setMathematical analysisApproximation algorithmEssential supremum and essential infimumFuzzy logicInfimum and supremumComputingMethodologies_PATTERNRECOGNITIONArtificial IntelligenceApproximation errorFuzzy numberLinear approximationMathematicsFuzzy Sets and Systems
researchProduct