"A Survey of Ranking Theory": The paper gives an up-to-date survey of ranking theory. It carefully explains the basics. It elaborates on the ranking theoretic explication of reasons and their balance. It explains the dynamics of belief statable in ranking terms and indicates how the ranks can thereby be measured. It suggests how the theory of Bayesian nets can be carried over to ranking theory. It indicates what it might mean to objectify ranks. It discusses the formal and the philosophical (...) aspects of the tight relation and the complementarity of ranks and probabilities. It closes with comparative remarks on predecessors and other philosophical proposals as well as formal models developed in AI. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

The primary aim of this chapter is to explain the nature of evidential reasoning, the characteristic difficulties encountered, and the tools to address these difficulties. Our focus is on evidential reasoning in criminal cases. There is an extensive scholarly literature on these topics, and it is a secondary aim of the chapter to provide readers the means to find their way in historical and ongoing debates.

In The Uses of Argument, Stephen Toulmin proposed a model for the layout of arguments: claim, data, warrant, qualifier, rebuttal, backing. Since then, Toulmin’s model has been appropriated, adapted and extended by researchers in speech communications, philosophy and artificial intelligence. This book assembles the best contemporary reflection in these fields, extending or challenging Toulmin’s ideas in ways that make fresh contributions to the theory of analysing and evaluating arguments.

Agents act on the basis of their beliefs and these beliefs change as they interact with other agents. In this book the authors propose and explain general logical tools for handling change. These tools include preferential reasoning, theory revision, and reasoning in inheritance systems, and the authors use these tools to examine nonmonotonic logic, deontic logic, counterfactuals, modal logic, intuitionistic logic, and temporal logic. This book will be of benefit to researchers engaged with artificial intelligence, and in particular agents, multiagent (...) systems and nonmonotonic logic. (shrink)

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

Toulmin’s scheme for the layout of arguments (1958, The Uses of Argument, Cambridge University Press, Cambridge) represents an influential tool for the analysis of arguments. The scheme enriches the traditional premises-conclusion model of arguments by distinguishing additional elements, like warrant, backing and rebuttal. The present paper contains a formal elaboration of Toulmin’s scheme, and extends it with a treatment of the formal evaluation of Toulmin-style arguments, which Toulmin did not discuss at all. Arguments are evaluated in terms of a so-called (...) dialectical interpretation of their assumptions. In such an interpretation, an argument’s assumptions can be evaluated as defeated, e.g., when there is a defeating reason against the assumption. The present work builds on recent research on defeasible argumentation (cf. e.g. the work of Pollock, Reiter, Loui, Vreeswijk, Prakken, Hage and Dung). More specifically, the author’s work on the dialectical logic DEFLOG and the argumentation tool ARGUMED serve as starting points. (shrink)

In a recent paper on Truth, Knowability and Neutrality Timothy Kenyon sets out to defend the coherence of a putative anti-realist truth-predicate, superassertibility, due to Wright (1992, 1999), against a number of Wright’s critics. By his own admission, the success of Kenyon’s defensive strategies turns out to hinge upon a realist conception of absolute warrant which conflicts with the anti-realist character of the original proposal, based, as it was, on a notion of defeasible warrant. Kenyon’s potential success in resisting Wright’s (...) critics brings a pyrrhic victory: either way, realism wins. Here I argue that the link between superassertibility and defeasible warrant can be restored in a way which clarifies the consistency of the pair, provided that the notion of inference to superassertibility is properly understood in logical terms. As one might expect, the requisite notion is not classical in character. As one might not expect, the notion cannot be properly construed in intuitionist terms either. Hence, I propose an alternative logical framework which, I believe, is at least formally adequate to the representation of superassertibility on the basis of defeasible warrant. The price to be paid for rejecting the ‘third way’ proposed here in favour of either of the two more traditional logical options is precisely that indicated by Kenyon’s discussion. (shrink)

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

Natural language contains many expressions with underspecified emotive content. This paper proposes a way to resolve such underspecification. Nonmonotonic inference over a knowledge base is used to derive an expected interpretation for emotive expressions in a particular context. This ‘normal’ meaning is then taken to influence the hearer’s expectations about probable interpretations, and, because of these probable interpretations, the decisions of the speaker about when use of underspecified emotive terms is appropriate.

Natural language contains many expressions with underspecified emotive content. This paper proposes a way to resolve such underspecification. Nonmonotonic inference over a knowledge base is used to derive an expected interpretation for emotive expressions in a particular context. This ‘normal’ meaning is then taken to influence the hearer’s expectations about probable interpretations, and, because of these probable interpretations, the decisions of the speaker about when use of underspecified emotive terms is appropriate.

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

In his influential paper "Epistemology Naturalized" Quine argues that Carnap's failure to define disposition predicates and his subsequent preference for reduction sentences naturally lead to an entirely naturalized epistemology. This conclusion is too hasty, I object. Applying the account of dispositional predicates developed in No. 26 I defend Carnap's aprioristic epistemology against Quine's attacks.

This is a position paper concerning the role of empirical studies of human default reasoning in the formalization of AI theories of default reasoning. We note that AI motivates its theoretical enterprise by reference to human skill at default reasoning, but that the actual research does not make any use of this sort of information and instead relies on intuitions of individual investigators. We discuss two reasons theorists might not consider human performance relevant to formalizing default reasoning: (a) that intuitions (...) are sufficient to describe a model, and (b) that human performance in this arena is irrelevant to a competence model of the phenomenon. We provide arguments against both these reasons. We then bring forward three further considerations against the use of intuitions in this arena: (a) it leads to an unawareness of predicate ambiguity, (b) it presumes an understanding of ordinary language statements of typicality, and (c) it is similar to discredited views in other fields. We advocate empirical investigation of the range of human phenomena that intuitively embody default reasoning. Gathering such information would provide data with which to generate formal default theories and against which to test the claims of proposed theories. Our position is that such data are the very phenomena that default theories are supposed to explain. (shrink)