The study of extension-based semantics within the seminal abstract argumentation model of Dung has largely focused on definitional, algorithmic and complexity issues. In contrast, matters relating to comparisons of representational limits, in particular, the extent to which given collections of extensions are expressible within the formalism, have been under-developed. As such, little is known ...

The logic of bunched implications (BI), introduced by O’Hearn and Pym, is a substructural logic which freely combines additive and multiplicative implications. Boolean BI (BBI) denotes BI with classical interpretation of additives and its model is the commutative monoid. We show that when the monoid is finitely generated and propositions are recursively defined, or the monoid is infinitely gene...

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...

Pretheoretically we hold that we cannot gain justification or knowledge through an epistemically circular reasoning process. Epistemically circular reasoning occurs when a subject forms the belief that p on the basis of an argument A, where at least one of the premises of A already presupposes the truth of p. It has often been argued that process reliabilism does not rule out that this kind of ...

To prove the theorem, we start by encoding a CNF, φ with a polynomial, φ(x1, . . . , xn) over N. The number 1 encodes ⊤, the number 0 encodes ⊥. The formula φ∗ is defined inductively. For the base cases, xi ∗ = xi, and x̄i ∗ = 1−xi. Inductively, we have (a∧b∧c) ∗ = a∗ · b∗ · c∗, and (a∨ b∨ c)∗ = 1− (1− a∗)∗ · (1− b∗) · (1− c∗). It suffices to consider 3-SAT, but it is easy to generalize these no...

We review Andr\'e Luiz Barbosa's paper"P != NP Proof,"in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa's definitions, and show that attempts to resolve this ambiguity lead to flaws in the proof of his main result.

Problem management is the dominating process within corrective maintenance. It not only handles software problems but also provides quantitative feedback important for assessing product quality, crucial for continuous process analysis and improvement and essential for defect prevention. Chapter 2 gives a detailed description of the problem management process and its constituent phases, activiti...

In this paper, we study methods to identify differential coexpression patterns in case-control gene expression data. A differential coexpression pattern consists of a set of genes that have substantially different levels of coherence of their expression profiles across the two sample-classes, i.e., highly coherent in one class, but not in the other. Biologically, a differential coexpression pat...

Complex Problem solving (CPS) is as an area of cognitive science that has received a good amount of attention, but theories in the field have not progressed accordingly. The reasons could be the lack of good definitions and classifications of the tasks (taxonomies). Although complexity is a term used pervasively in psychology and is operationalized in different ways, there are no psychological ...

Statistical decision theory can help to explain and improve the market definition decision in competition cases. A Bayesian decision rule shows that market definition involves balancing (1) the weight of evidence in favour and against substitutability, (2) prior probabilities determined by previous cases and research, and (3) the loss function of the decision-maker. Market definition in differe...