نتایج جستجو برای: semantic formula

تعداد نتایج: 197780  

2016
Manuela Lanwermeyer Karen Henrich Marie J. Rocholl Hanni T. Schnell Alexander Werth Joachim Herrgen Jürgen E. Schmidt

This event-related potential (ERP) study examines the influence of dialectal competence differences (merged vs. unmerged dialect group) on cross-dialectal comprehension between Southern German dialects. It focuses on the question as to whether certain dialect phonemes (/[Formula: see text]/, /[Formula: see text]/), which are attributed to different lexemes in two dialect areas (Central Bavarian...

2013
Yuval Filmus Massimo Lauria

In this note we argue that semantic cutting planes refutations are stronger than syntactic ones. In particular, we give a formula for which any refutation in syntactic cutting planes requires exponential length, while there is a polynomial length refutation in semantic cutting planes. This means that syntactic cutting planes does not p-simulate (nor simulate) semantic cutting planes. We also gi...

Journal: :CoRR 2015
Howard S. Cohl Moritz Schubotz Marjorie A. McClain Bonita V. Saunders Cherry Y. Zou Azeem S. Mohammed Alex A. Danoff

One initial goal for the DRMF is to seed our digital compendium with fundamental orthogonal polynomial formulae. We had used the data from the NIST Digital Library of Mathematical Functions (DLMF) as initial seed for our DRMF project. The DLMF input LTEX source already contains some semantic information encoded using a highly customized set of semantic LTEX macros. Those macros could be convert...

Journal: :CoRR 2016
Gaëlle Fontaine Yde Venema

This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal μ-calculus. For each of these properties we provide a corresponding syntactic fragment, in the sense that a μ-formula ξ has the given property iff it is equivalent to a formula ξ′ in the correspon...

1992
Dov M. Gabbay Hans Jürgen Ohlbach

An algorithm is presented which eliminates second–order quantifiers over predicate variables in formulae of type ∃P1, . . . , Pnψ where ψ is an arbitrary formula of first– order predicate logic. The resulting formula is equivalent to the original formula – if the algorithm terminates. The algorithm can for example be applied to do interpolation, to eliminate the second–order quantifiers in circ...

2017
Marlena Bartczak Barbara Bokus

Using the Semantic Distance Task, we investigated the semantic distances between ME and five metaphorically conceptualized notions: PAST, FUTURE, JOY, SADNESS, and HAPPINESS. Three Polish-speaking groups participated in the study: depressive subjects ([Formula: see text]), patients in remission ([Formula: see text]), and non-depressed individuals ([Formula: see text]). T-test and the Kruskal-Wa...

Journal: :FO & DM 2014
Xingfang Zhang Xiang Li

In this paper, we provide a semantic study of the first-order predicate logic for situations involving uncertainty. We introduce the concepts of uncertain predicate proposition, uncertain predicate formula, uncertain interpretation and degree of truth in the framework of uncertainty theory. Compared with classical predicate formula taking true value in {0, 1}, the degree of truth of uncertain p...

1996
Leora Morgenstern

We examine a commercial application, a large portion of whose domain knowledge is taxonomic in nature, and investigate the suit-ability of inheritance networks for the task of reasoning about knowledge in this area. We claim that standard inheritance networks are not suuciently expressive to capture domain knowledge, and introduce formula-augmented semantic networks (FANs), a semantic network w...

2004
Christoph Wernhard

Some operations to decompose a knowledge base (considered as a first order logic formula) in ways so that only its semantics determines the results are investigated. Intended uses include the extraction of “parts” relevant to an application, the exploration and utilizing of implicit possibilities of structuring a knowledge base and the formulation of query answers in terms of a signature demand...

Journal: :CoRR 2007
András Gyorgy Békés Péter Szeredi

The SINTAGMA information integration system is an infrastructure for accessing several different information sources together. Besides providing a uniform interface to the information sources (databases, web services, web sites, RDF resources, XML files), semantic integration is also needed. Semantic integration is carried out by providing a highlevel model and the mappings to the models of the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید