Statistical and logical reasoning in disambiguation
نویسندگان
چکیده
منابع مشابه
Statistical and Logical Reasoning in Disambiguation†
While recent statistical methods for disambiguation in natural language processing have been very successful, earlier arguments for the position that fully successful disambiguation requires reasoning to new conclusions from old facts still hold. We explore ways of complementing statistical approaches with the use of ‘domain theories’, collections of facts and axioms that characterise the typic...
متن کاملLogical reasoning and schizotypy Logical reasoning in schizotypal personality1
It was examined whether psychotic-like personality traits in a sample of 205 college students could predict logical reasoning deficits, akin to those seen in schizophrenia. The participants were tested on their ability to assess the logical validity of premises (Logical Reasoning Task), and completed a multi-dimensional schizotypy inventory (O-LIFE). Low accuracy was associated with increased l...
متن کاملLogical reasoning
In the psychological literature on reasoning it has always been assumed that if there is such a thing as mental logic, it must be a set of inference rules. This proof-theoretic conception of mental logic is compatible with but doesn’t do justice to what, according to most logicians, logic is about. Thus, the ongoing debate over mental logic is based on a too narrow notion of logic. Adopting the...
متن کاملCombining Logical and Probabilistic Reasoning
This paper describes a family of knowledge representation problems, whose intuitive solutions require reasoning about defaults, the effects of actions, and quantitative probabilities. We describe an extension of the probabilistic logic language P-log (Baral & Gelfond & Rushton 2004), which uses “consistency restoring rules” to tackle the problems described. We also report the results of a preli...
متن کاملLogical Reasoning and Petri Nets
The main result of the paper states that a set F of propositionallogic formulas is contradictory iff in all net representations of F the empty marking is reproducible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
سال: 2000
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2000.0585