نتایج جستجو برای: equality
تعداد نتایج: 21569 فیلتر نتایج به سال:
I claim in this article that several operators in different positions interact to yield the meaning of a nur sentence in German which may receive an evaluative interpretation such as Paul aß nur Kekse ʻPaul only ate cookies (and the speaker considers this little and/or bad)ʼ. The exclusive component of meaning comes from an adverbial particle as in the standard account. For the evaluative compo...
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally...
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints and for a nat...
Equality algebras has recently been introduced. A subclass of equality algebras, called equivalential equality algebras is closely related to BCK-algebras with meet. We show that the variety of equality algebras has nice properties: We shall investigate their congruences and filters and prove that the variety of equality algebras is a 1-regular, arithmetic variety.
One important facet of common-sense reason ing is the ability to draw default conclusions about the state of the world. Such an abil ity enables one to assume, for example, that a given bird flies in the absence of information to the contrary. One drawback of the circum scriptive approach to common-sense reasoning has been its inability to produce default con clusions about equality. For ex...
We consider the problem of finding irredundant bases for inconsistent sets of equalities and disequalities. These are subsets of inconsistent sets which do not contain any literals which do not contribute to the unsatisfiability in an essential way, and can therefore be discarded. The approach we are pursuing here is to decorate derivations with proofs and to extract irredundant sets of assumpt...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید