Results 11 to 20 of about 25,259 (290)
Stanford Encyclopedia of Philosophy, 2016 In logic, disjunction is a binary connective (∨) classically interpreted as a truth function the output of which is true if at least one of the input sentences (disjuncts) is true, and false otherwise.
Aloni, M.
core +6 more sources
Burge on Perception and the Disjunction Problem [PDF]
Theoria, 2015 The Disjunction Problem states that teleological theories of perception cannot explain why a subject represents an F when an F causes the perception and not the disjunction F v G, given that the subject has mistaken G’s for F’s in the past.
Jon Altschul
doaj +2 more sources
Tracking the best disjunction [PDF]
Machine Learning, 1998 Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of the n variables and does multiplicative updates to its weights.
Manfred K. Warmuth, Peter Auer
core +5 more sources
Comprehension of Linguistic Disjunction
, 2021 Comprehension of Linguistic Disjunction in Simple Existential Sentences in Children and ...
Masoud Jasbi
core +9 more sources
DISJUNCTIONS WITH STOPPING CONDITIONS
The Bulletin of Symbolic Logic, 2021 AbstractWe introduce a tool for analysing models of$\text {CT}^-$, the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan’s theorem that the arithmetical part of models of$\text {CT}^-$are recursively saturated. We also use this tool to provide a new proof of theorem from [8] that all models of$\text {CT}^-$carry a ...
Kossak, Roman, Bartosz Wcisło
openaire +3 more sources
ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
The Bulletin of Symbolic Logic, 2017 AbstractCompleteness and other forms of Zorn’s Lemma are sometimes invoked for semantic proofs of conservation in relatively elementary mathematical contexts in which the corresponding syntactical conservation would suffice. We now show how a fairly general syntactical conservation theorem that covers plenty of the semantic approaches follows from an ...
RINALDI, DAVIDE +2 more
openaire +5 more sources
Generalized disjunction decomposition for the evolution of programmable logic array structures [PDF]
, 2006 Evolvable hardware refers to a self reconfigurable electronic circuit, where the circuit configuration is under the control of an evolutionary algorithm.
Lambert, C +5 more
core +1 more source
Disjunctive normal networks [PDF]
Neurocomputing, 2016 Artificial neural networks are powerful pattern classifiers; however, they have been surpassed in accuracy by methods such as support vector machines and random forests that are also easier to use and faster to train. Backpropagation, which is used to train artificial neural networks, suffers from the herd effect problem which leads to long training ...
Mehdi Sajjadi +2 more
openaire +3 more sources
ACM Transactions on Database Systems, 1997 We consider disjunctive Datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive Datalog is a variant of Datalog where disjunctions may appear in the rule heads; advanced versions also allow for negation in the bodies which can be handled according to a semantics for negation in disjunctive ...
Eiter, T, Gottlob, G, Mannila, H
openaire +1 more source
On the Negative Disjunction Property [PDF]
, 2018 In the field of intermediate logics, the concept of the disjunction property (DP) plays an important part. Lloyd Humberstone has drawn my attention to an analogious principle called the Negative Disjunction Property ( NDP) which applies when ...
McKay, Craig Graham
core +3 more sources