Size, allomorphy and guttural-final stems in Modern Hebrew

There is a tendency for syncretism between future and infinitive stems in Modern Hebrew. Verbs with final orthographic gutturals do not follow this trend in one verbal type. In another, they do follow it, but their exponent is different from that of regular verbs. Previous studies have claimed that (i) gutturals are represented in Modern Hebrew as a vowel /a/ (Faust, Noam. 2005. The fate of gutturals in Modern Hebrew. Tel Aviv: Tel Aviv University MA Thesis); (ii) Infinitives are derived in two cycles (Faust, Noam & Vered Silber-Varod. 2014. Distributed Morphology and prosody: The case of prepositions. In Burit Melnik (ed.), Proceedings of IATL29 (MITWPL 72), 71–92. Cambridge (MA): MIT Press); and (iii) stems seek to be no shorter than two syllables (e.g. Bat-El, Outi. 2003. The fate of the consonantal root and the binyan in Optimality Theory. Recherches Linguistiques de Vincennes 32. 31–60.). Relying on these claims, an analysis is proposed involving two allomorphs with a priority relation. Phonological considerations of multiple correspondence, word size and cyclicity may nevertheless override the effect of priority, leading to the selection of the non-default allomorph. In the last section I briefly discuss two alternatives to the priority relation: the autosegmental alternative and the gradient alternative.

Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities

We continue the investigations of the connection between membrane systems and time Petri nets by extending the examined class of systems from simple symbol-object membrane systems to more complex cases: rules with promoters/inhibitors, membrane dissolution, and priority relation on the rules. By constructing the simulating time Petri net, we retain one of the main characteristics of the Petri net model; namely, the firings of the transitions can take place in any order, and there is no need to introduce maximal parallelism in the Petri net semantics. Instead, we substantially exploit the gain in computational strength obtained by the introduction of the timing feature for Petri nets.

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setting, a closely related scenario has been studied and led to the definition of three different notions of optimal repairs (global, Pareto, and completion) of a prioritized inconsistent database. After transferring the notions of globally-, Pareto- and completion-optimal repairs to our setting, we study the data complexity of the core reasoning tasks: query entailment under inconsistency-tolerant semantics based upon optimal repairs, existence of a unique optimal repair, and enumeration of all optimal repairs. Our results provide a nearly complete picture of the data complexity of these tasks for ontologies formulated in common DL-Lite dialects. The second contribution of our work is to clarify the relationship between optimal repairs and different notions of extensions for (set-based) argumentation frameworks. Among our results, we show that Pareto-optimal repairs correspond precisely to stable extensions (and often also to preferred extensions), and we propose a novel semantics for prioritized KBs which is inspired by grounded extensions and enjoys favourable computational properties. Our study also yields some results of independent interest concerning preference-based argumentation frameworks.

Multi-Attribute Decision Making Method Based on Neutrosophic Vague N-Soft Sets

This paper proposes neutrosophic vague N-soft sets which is composed of neutrosophic vague sets and N-soft sets for the first time. The new hybrid model includes a pair of asymmetric functions: truth-membership and false-membership, and an indeterminacy-membership function. Some useful operations and propositions are given and illustrated by examples. Moreover, a method of priority relation ranking based on neutrosophic vague N-soft sets is presented. The validity of the method is verified by comparison. It is more flexible and reasonable to use this method in our daily life. Finally, a potential application of multi-attribute decision making is presented.

Ranked ordering sources and embedded modality

I present an ordering semantics for modality in which possible worlds are ordered by ordering sources augmented with a partial order structure. This extension of Kratzer’s (1991) ordering semantics allows propositions to contribute to the ideal defined by an ordering source with differing degrees of priority and allows this priority relation to vary with the world of evaluation. Although the * operator of Katz et al. (2012) also allows ordering sources to be combined with different degrees of priority, I show that it does not account for a variant of Goble’s (1996) Medicine Problem in which a modal is embedded under an attitude verb. I also extend the investigation by Katz et al. (2012) into the combinatorial structure of complex ordering sources by proposing a generalization of their * operator for partially ordered ordering sources.

Propositional defeasible logic has linear complexity

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.