Results 241 to 250 of about 25,259 (290)
Some of the next articles are maybe not open access.
2023
Chapter 6 explores the transregional popularity of BL visuality across the Sinophone public spheres through the concept of “disjunctive temporalities.” While The Untamed in the PRC captures a form of “unhistorical queerness” whose queer appeal precisely lies in its portrayals of bromance and ...
openaire +1 more source
Chapter 6 explores the transregional popularity of BL visuality across the Sinophone public spheres through the concept of “disjunctive temporalities.” While The Untamed in the PRC captures a form of “unhistorical queerness” whose queer appeal precisely lies in its portrayals of bromance and ...
openaire +1 more source
A Logic for Disjunctive Ignorance
Journal of Philosophical Logic, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On pathological disjunctions and redundant disjunctive conic cuts
Operations Research Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Shahabsafa +2 more
openaire +2 more sources
Branching on general disjunctions [PDF]
Mathematical Programming, 2009 This paper considers a modification of the branch-and-cut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality.
Gérard Cornuéjols
exaly +3 more sources
Disjunction and Disjunctive Syllogism
Canadian Journal of Philosophy, 1998The validity of argument by disjunctive syllogism (henceforth, DS) has been denied by proponents of relevant and paraconsistent logic (who are sometimes one and the same). DS is stigmatised for its role in inferences — most notably C.I. Lewis's derivation of that fallacy of irrelevance ex falso quodlibet (EFQ) — that involve both it and other rules of ...
openaire +1 more source
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
Fundamenta Informaticae, 1996It is wellknown that Minker's semantics GCWA for positive disjunctive programs P, i.e. to decide if a literal is true in all minimal models of P is ΠP2-complete. This is in contrast to the same entailment problem for semantics of non-disjunctive programs such as STABLE and SUPPORTED (both are co-NP-complete) as well as MsuppP and WFS (that are even ...
Jürgen Dix +2 more
openaire +4 more sources
Disjunctive languages and codes
1977* A i A + A i " X + AB = {xylx c A, y ~ B}, A = o and = u A word w ~ is i=0+ i=l called primitive if w = fn, f c X , implies n = i. A non-empty language A such that A ~ X + is called a code if XlX2...x n = ylY2...y m and xi,Y j ~ A for every i and j implies n = m and x i = Yi for all i. A code A is said to be a prefix (suffix) code if A n AX + = ~ (A n
Huei-Jan Shyr, Gabriel Thierrin
openaire +2 more sources