Results 1  10
of
102
unknown title
"... Abstract Sound and complete modal propositional logic C is presented, in which 2P has the interpretation "P is true in all states". This interpretation is already known as the Carnapian extension of S5. The new axiomatization for C provides two insights. First, introducing an infer ..."
Abstract
 Add to MetaCart
Abstract Sound and complete modal propositional logic C is presented, in which 2P has the interpretation "P is true in all states". This interpretation is already known as the Carnapian extension of S5. The new axiomatization for C provides two insights. First, introducing
Analogical Predictions for Explicit Similarity
"... This paper concerns exchangeable analogical predictions based on similarity relations between predicates, and deals with a restricted class of such relations. It describes a system of Carnapian λγ rules on underlying predicate families to model the analogical predictions for this restricted class. ..."
Abstract
 Add to MetaCart
This paper concerns exchangeable analogical predictions based on similarity relations between predicates, and deals with a restricted class of such relations. It describes a system of Carnapian λγ rules on underlying predicate families to model the analogical predictions for this restricted class
Scientific rigour, an answer to a pragmatic question: a linguistic framework for software engineering’ AM Haeberer
"... armando @ haeberer.com Discussions of the role of mathematics in software engineering are common and have probably not changed much over the last few decades. There is now much discussion about the “intuitive ” nature of software construction and analogies are drawn (falsely) with graphic design, ..."
Abstract
 Add to MetaCart
armando @ haeberer.com Discussions of the role of mathematics in software engineering are common and have probably not changed much over the last few decades. There is now much discussion about the “intuitive ” nature of software construction and analogies are drawn (falsely) with graphic design
Members of the Thesis Committee:
, 2012
"... The topic of this thesis is the relationship between formal and informal proofs. Chapter One opens the discussion by examining what a proof is, when two proofs are identical, what the purpose of proving is and how to distinguish the two categories of proof. Chapters Two and Three focus in on informa ..."
Abstract
 Add to MetaCart
the practicalities of formalisation to argue in favour of the weak reading of the Formalisability Thesis, which I take to be closely related to Carnapian explication, but against the strong reading, which corresponds to the Formalists ’ approach to formalisation. Thanks
Probabilistic logic and probabilistic networks
, 2008
"... While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches ..."
Abstract

Cited by 24 (17 self)
 Add to MetaCart
While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches to probabilistic logic fit into a simple unifying framework: logically complex evidence can be used to associate probability intervals or probabilities with sentences. Specifically, we show in Part I that there is a natural way to present a question posed in probabilistic logic, and that various inferential procedures provide semantics for that question: the standard probabilistic semantics (which takes probability functions as models), probabilistic argumentation (which considers the probability of a hypothesis being a logical consequence of the available evidence), evidential probability (which handles reference classes and frequency data), classical statistical inference
On Software Certification: We Need ProductFocused Approaches ⋆
"... Abstract. In this paper we begin by examining the “certification ” of a consumer product, a baby walker, that is productfocused, i.e., the certification process requires the performance of precisely defined tests on the product with measurable outcomes. We then review current practices in software ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
certification and contrast the software regime’s processoriented approach to certification with the productoriented approach typically used in other engineering disciplines. We make the case that productfocused certification is required to produce reliable software intensive systems. These techniques
Inferring Conservation Laws in Particle Physics: A Case Study
 in the Problem of Induction”, The British Journal for the Philosophy of Science, Forthcoming
, 2001
"... This paper develops a meansends analysis of an inductive problem that arises in particle physics: how to infer from observed reactions conservation principles that govern all reactions among elementary particles. I show that there is a reliable inference procedure that is guaranteed to arrive at an ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
This paper develops a meansends analysis of an inductive problem that arises in particle physics: how to infer from observed reactions conservation principles that govern all reactions among elementary particles. I show that there is a reliable inference procedure that is guaranteed to arrive at an empirically adequate set of conservation principles as more and more evidence is obtained. An interesting feature of reliable procedures for finding conservation principles is that in certain precisely defined circumstances they must introduce hidden particles. Among the reliable inductive methods there is a unique procedure that minimizes convergence time as well as the number of times that the method revises its conservation principles. Thus the aims of reliable, fast and steady convergence to an empirically adequate theory single out a unique optimal inference for a given set of observed reactions–including prescriptions for when exactly to introduce hidden particles.
F. Bacchus, Representing and Reasoning with Probabilistic Knowledge: A
"... Artificial intelligence has its roots in symbolic logic, and for many years it showed little interest in probability. But during the past decade, disinterest has been replaced by engagement. The flowering of expert systems during the 1980s strengthened ties between AI and areas of engineering and bu ..."
Abstract
 Add to MetaCart
Artificial intelligence has its roots in symbolic logic, and for many years it showed little interest in probability. But during the past decade, disinterest has been replaced by engagement. The flowering of expert systems during the 1980s strengthened ties between AI and areas of engineering
Adaptative DecisionMaking by Systems of Cooperating Intelligent Agents Organized on Rough Mereological Principles
, 1996
"... We propose a new approach to tasks of Distributed Artificial Intelligence (DAI). This approach is based on a novel idea of rough mereology which offers a framework for a rigorous (numerical) treatment of relations of being a part in a degree and allows for approximate reasoning about complex objects ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
We propose a new approach to tasks of Distributed Artificial Intelligence (DAI). This approach is based on a novel idea of rough mereology which offers a framework for a rigorous (numerical) treatment of relations of being a part in a degree and allows for approximate reasoning about complex objects in particular for organizing systems of intelligent agents into schemes (assembling teams) for the purpose of synthesis from (elementary) parts of complex objects conforming to a given (possibly incomplete) specification in satisfactory degree. The above topics are illustrated by an example. Our example is a tiny fragment of a real animation system constructing subsequent scenes (or movie takes) from a database of elementary pictures. We expect that our general approach can be applied to practical tasks like manufacturing, design, control, management, etc. Key words: distributed AI, adaptative decision making, cooperative multiagent systems, adaptive systems, approximate reasoning, reason...
A CategorialModal Architecture of Informativity
, 2001
"... This document has been typeset by the author using L ATEX 2εwith the bookufal class (which extends the standard L ATEX 2ε book class). Other packages that have been used are.... Finally, the indexes have been created using MakeIndex and F.W. Long’s multind package. A categorialmodal logical archite ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This document has been typeset by the author using L ATEX 2εwith the bookufal class (which extends the standard L ATEX 2ε book class). Other packages that have been used are.... Finally, the indexes have been created using MakeIndex and F.W. Long’s multind package. A categorialmodal logical architecture of informativity Dependency grammar logic & information structure GeertJan M. Kruijff Here is one more system of philosophy. If the reader is tempted to smile, I can assure him that I smile with him, and that my system [...] differs widely in spirit and pretensions from what usually goes by that name. [...] I am merely attempting to express for the reader the principles to which he appeals when he smiles. George Santayana, Scepticism and Animal Faith (1955)
Results 1  10
of
102