اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComparative concept similarity over Minspaces: Axiomatisation and Tableaux Calculus
40
0
0.0
(
0
)
تأليف
Regis Alenda
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the logic of comparative concept similarity $CSL$ introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In this logic we can formulate assertions of the form objects A are more similar to B than to C. The semantics of this logic is defined by structures equipped by distance functions evaluating the similarity degree of objects. We consider here the particular case of the semantics induced by emph{minspaces}, the latter being distance spaces where the minimum of a set of distances always exists. It turns out that the semantics over arbitrary minspaces can be equivalently specified in terms of preferential structures, typical of conditional logics. We first give a direct axiomatisation of this logic over Minspaces. We next define a decision procedure in the form of a tableaux calculus. Both the calculus and the axiomatisation take advantage of the reformulation of the semantics in terms of preferential structures.
قيم البحث
اقرأ أيضاً
ZX-calculus is a graphical language for quantum computing which is complete in the sense that calculation in matrices can be done in a purely diagrammatic way. However, all previous universally complete axiomatisations of ZX-calculus have included at
least one rule involving trigonometric functions such as sin and cos which makes it difficult for application purpose. In this paper we give an algebraic complete axiomatisation of ZX-calculus instead such that there are only ring operations involved for phases. With this algebraic axiomatisation of ZX-calculus, we are able to establish for the first time a simple translation of diagrams from another graphical language called ZH-calculus and to derive all the ZX-translated rules of ZH-calculus. As a consequence, we have a great benefit that all techniques obtained in ZH-calculus can be transplanted to ZX-calculus, which cant be obtained by just using the completeness of ZX-calculus.
In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all the operations of the phases are algebraic ones witho
ut trigonometry functions involved, thus paved the way for generalising complete axiomatisation of qubit ZX-calculus to qudit ZX-calculus and ZX-calculus over commutative semirings. Second, we characterise elementary transformations in terms of ZX diagrams, so a lot of linear algebra stuff can be done purely diagrammatically.
Let $A$, $B$ be Banach $D$-algebras. The map $f:Arightarrow B$ is called differentiable on the set $Usubset A$, if at every point $xin U$ the increment of map $f$ can be represented as $$f(x+dx)-f(x) =frac{d f(x)}{d x}circ dx +o(dx)$$ where $$frac{d
f(x)}{d x}:Arightarrow B$$ is linear map and $o:Arightarrow B$ is such continuous map that $$lim_{arightarrow 0}frac{|o(a)|_B}{|a|_A}=0$$ Linear map $displaystylefrac{d f(x)}{d x}$ is called derivative of map $f$. I considered differential forms in Banach Algebra. Differential form $omegainmathcal{LA}(D;Arightarrow B)$ is defined by map $g:Arightarrow Botimes B$, $omega=gcirc dx$. If the map $g$, is derivative of the map $f:Arightarrow B$, then the map $f$ is called indefinite integral of the map $g$ $$f(x)=int g(x)circ dx=intomega$$ Then, for any $A$-numbers $a$, $b$, we define definite integral by the equality $$int_a^bomega=int_{gamma}omega$$ for any path $gamma$ from $a$ to $b$.
In 1976, King defined certain tableaux model, called King tableaux in this paper, counting weight multiplicities of irreducible representation of the symplectic group $Sp(2m)$ for a given dominant weight. Since Kashiwara defined crystals, it is an op
en problem to provide a crystal structure on King tableaux. In this paper, we present crystal structures on King tableaux and semistandard oscillating tableaux. The semistandard oscillating tableaux naturally appear as $Q$-tableaux in the symplectic version of RSK algorithms. As an application, we discuss Littlewood-Richardson coefficients for $Sp(2m)$ in terms of semistandard oscillating tableaux.
Many methods have been proposed to detect concept drift, i.e., the change in the distribution of streaming data, due to concept drift causes a decrease in the prediction accuracy of algorithms. However, the most of current detection methods are based
on the assessment of the degree of change in the data distribution, cannot identify the type of concept drift. In this paper, we propose Active Drift Detection with Meta learning (Meta-ADD), a novel framework that learns to classify concept drift by tracking the changed pattern of error rates. Specifically, in the training phase, we extract meta-features based on the error rates of various concept drift, after which a meta-detector is developed via a prototypical neural network by representing various concept drift classes as corresponding prototypes. In the detection phase, the learned meta-detector is fine-tuned to adapt to the corresponding data stream via stream-based active learning. Hence, Meta-ADD uses machine learning to learn to detect concept drifts and identify their types automatically, which can directly support drift understand. The experiment results verify the effectiveness of Meta-ADD.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
