Non-deterministic matrices, a natural generalization of manyvalued matrices, are semantic structures in which the value assigned to a complex formula may be chosen non-deterministically from a given set of options. We show that by combining Nmatrices and preferential metrics-based considerations, one obtains a family of logics that are useful for reasoning with uncertainty. We investigate the b...

In our contribution we will present a strictly semantic approach to scope phenomena which is based on (Dynamic) Dependence Logic (DL) [Vää07, Gal13] and ideas from Dynamic Semantics [Fer93]. Formulas as well as quantifiers are interpreted as relations between sets of assignments. Scopal ambiguities are analyzed as a form of non-determinism: processing a formula in an input context X can lead to...

Objectives: Wernicke’s aphasia is one of the most prominent focal brain deficits affecting the comprehension abilities of patients while preserving their production abilities. Although a lot of studies in different languages have been conducted to analyze the nature of this deficit, still some controversies exist in this regard. While some research studies attribute this defect to a performance...

Officially, the ConQuest server system is now part of a larger product suite available from Excalibur called RetrievalWare. We ran TREC-4 with early versions of RetrievalWare 5.0, which is now fully released and available as of December 1995. Many of the improvements and advances which we discovered as part of our TREC-4 evaluations (term grouping, new semantic network weights, a new relevancy ...

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...

The primary goal of our participation in DUC 2005 is two-fold. One is to benchmark the performance of a method of computing sentence semantic similarity. The other is to test the effectiveness of a new redundancy minimization formula inspired by Maximal Marginal Relevance(MMR). By using only these two features and eschewing other heuristics, our system performed competitively, achieving the top...

We provide a semantic characterization of AGM belief contraction based on frames consisting Kripke relation and Stalnaker-Lewis selection function. The central idea is as follows. Let K be the initial set K-A by formula A; then B belongs to if only if, at actual state, agent believes that not-A (were) case (would be) case.

Monte Carlo Tree Search (MCTS) is a sampling best-first method to search for optimal decisions. The success of MCTS depends heavily on how the tree built and selection process plays fundamental role in this. One particular mechanism that has proved be reliable based Upper Confidence Bounds Trees (UCT). UCT attempts balance exploration exploitation by considering values stored statistical MCTS. ...

The aim of this study is to determine the effect of word clustering method on vocabulary learning of Iranian EFL learners through a case of semantic versus phonological clustering. To this effect, 80 homogeneous students from four intermediate classes at an English institute in Torbat e Heydariyeh participated in this research. They were assigned to four groups according to semantic versus phon...