A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We show that preferential inference can be generated as the sceptical counterpart of an inference mechanism defined directly on partial entrenchment. ... Corollary 14 If ∼ is a rational inference relation, then the relation ≤ defined by (P ) is a rational weakly disjunctive partial entrenchment relation such that, for all α, β in L, α ∼ β iff α ∼ ≤ β. ... Both build on a syntactic condition that translates rational consequence relations to preorders. ...arXiv:cs/0007033v1 fatcat:fviot3kkrjcwljock4h5pbic2i
We show that preferential inference can be generated as the sccptical counterpart of an inference mechanism defined directly on partial entrenchment. @ 1999 Published by Elsevier Science B.V. ... Zf iv is a rational inference relation, then the relation 6 dejined by (P) is a rational weakly disjunctive partial entrenchment relation such that, for all (x, /I in 9, Definition 1 . 1 A binary relation ... It is enough to translate the property of Rational Monotonicity using P: CtV+?&: a ' ' " ctV/3VydclVP (Splitting). Weakly disjunctive relations satisfying Splitting will be called rational. ...doi:10.1016/s0168-0072(98)00036-0 fatcat:6wfyl5cdkfaidongvfpn3jyfgu
I provide arguments that any creatures meeting certain conditions-plausible necessary conditions on rationality-must have certain specific logical concepts and be able to use them in certain specific ways ... I also deal with disjunction, conditionality and negation. ... The first example comes from the theory of rational belief. Theorists of rational belief are divided over whether rational belief is closed under logical consequence. ...doi:10.1093/mind/110.438.335 fatcat:ahdx2m34cbamzbpc7hawyowwyu
Entrenchment relations provide a direct generalization of epistemic entrenchment and expectation ordering introduced by Gardenfors and Makinson for the study of belief revision and expectation inference ... In the following, we give conditions under which inconsistency is maxiconsistently derivable. Lemma 6 Given an entrenchment frame L, ⊢, , then α ∼ ⊥ iff Coh(α) = ∅ iff ⊤ ¬α iff β ¬α, for all β ∈ L. ... We assume a language L of propositional constants closed under the boolean connectives ∨ (disjunction), ∧ (conjunction), ¬ (negation) and → (implication). ...arXiv:cs/0007040v1 fatcat:h5hw72npzbchhbjjevvvyfh3vy
As noted, it permits upward monotonic inferences under the imperative operator. A further comparison, particularly with respect to conditional imperatives, will have to wait for another occasion. ... However, this section has shown that there are two (or three) options, each of which can block Ross's Paradox, and one of which can retain (non-disjunctive) upward monotonic inferences under imperative ...doi:10.3765/sp.13.6 fatcat:jk3ovsfspfemzayufj26tmnhli
Using ideas and formalisms from game theory, I demonstrate that these inferences can be explained in a strictly Gricean sense as rational behavior. ... "simplification of disjunctive antecedents". ... What is rational behavior under this belief? ...doi:10.3765/sp.4.1 fatcat:krcwwaicjjdpfmwdflixzseofa
The Law of Non-Contradiction
Then, trivially, our acceptances are closed upward under classically valid inferences. ... Now we also take rational acceptance to include t. Without an extra condition such as this we have no way to force the rational acceptance of propositions not at the top of the entailment ordering. ...doi:10.1093/acprof:oso/9780199265176.003.0005 fatcat:dbavbymlkrdftgbxylbcd7m3z4
The paper begins by focusing the basic idea that Gestalt phenomena belong not only to the realm of perception but to the realm of inference. ... The main thesis of the paper is that the common feature of such forms of non-deductive reasoning is provided by a rational selection between incompatible conclusions, where rationality lies in the choice ... we could call a rational conditional. ...doi:10.1093/jigpal/jzk017 fatcat:7nqxsctu5bh2pcv4sol46cmw4u
Lecture Notes in Computer Science
It uses definitions, in logic programming manner, for "rational" reduction of goals to subgoals. It uses integrity constraints for reactive, condition-action rule behaviour. ... In this paper we analyse the similarities and differences between rational and reactive agent architectures, and propose a unified architecture that aims to capture both as special cases. ... Whether the action succeeds or fails, the inference rules correctly process the record on every disjunct. ...doi:10.1007/bfb0031739 fatcat:untbj4rqvrdyvlnnmefasroxjq
There are two main theorems: (1) although negation rationality is known to be strictly weaker than disjunctive rationality, every negation rational inference relation that is determined by some injective ... preferential model is disjunctive rational; (2) a represen- tation theorem: a preferential model validates negation rationality iff it satisfies the condition :(min(a A #)) C :(min(a@)) or s(min(a A B ...
Mind & Language
We show how to study general de Finetti truth tables for negations, conjunctions, disjunctions, and conditionals. ... The new Bayesian paradigm in the psychology of reasoning aims to integrate the study of human reasoning, decision making, and rationality. It is supported by two findings. ... The indicative conditional can be represented by the conditional probability and rational degrees of belief in conclusions of conditional inferences can be calculated from subjective probabilities for ...doi:10.1111/mila.12042 fatcat:4ehyrq3o6jcxpcup6repzk4h2i
It was indeed necessary, in the analysis, for the interpreter to recognize that the content of a particular disjunct failed to satisfy the answerhood condition for disjuncts. ... Under embedding verbs The next three cases involve enrichment of clauses under the scope of an attitude verb: At this point, I of course propose the same move as before. ...doi:10.1007/s11098-013-0138-2 fatcat:oigr22yabbeabaswlcwze5jfle
People learn quickly when reasoning about causal relationships, making inferences from limited data and avoiding spurious inferences. ... We developed a hierarchical Bayesian model of the acquisition of knowledge of the functional form of causal relationships and tested it in five experimental studies, considering disjunctive and conjunctive ... disjunctive condition. ...doi:10.1111/j.1551-6709.2009.01058.x pmid:21564208 fatcat:kgminpqqoffx7f5yjy6mbby774
The author seeks the condition under which the following pro- cedure works validly: Given a true categorical proposition B and a categorical proposition A, “adjust A by means of conversion, obversion, ... Rational Mech. ...
In the framework of conditional knowledge bases and default extensions, it implies that any rational inference relation may be considered as the rational closure of a minimal knowledge base. ... An immediate consequence of this is the possibility of replacing any conditional knowledge base by a minimal one that provides the same amount of information. Intelligence 98 (1998) 209-235 211 ... A rational inference relation is a preferential inference relation that satisfies the condition of rational monotony: UW If LY b p, and not (Y b 77, then a A y k p. ...doi:10.1016/s0004-3702(97)00053-2 fatcat:resiiqynsffrleilzyd3ht3y3a
« Previous Showing results 1 — 15 out of 11,065 results