Valid and Invalid Inference Rules for Counterfactuals

2019 ◽  
pp. 207-207
1982 ◽  
Vol 21 (03) ◽  
pp. 127-136 ◽  
Author(s):  
J. W. Wallis ◽  
E. H. Shortliffe

This paper reports on experiments designed to identify and implement mechanisms for enhancing the explanation capabilities of reasoning programs for medical consultation. The goals of an explanation system are discussed, as is the additional knowledge needed to meet these goals in a medical domain. We have focussed on the generation of explanations that are appropriate for different types of system users. This task requires a knowledge of what is complex and what is important; it is further strengthened by a classification of the associations or causal mechanisms inherent in the inference rules. A causal representation can also be used to aid in refining a comprehensive knowledge base so that the reasoning and explanations are more adequate. We describe a prototype system which reasons from causal inference rules and generates explanations that are appropriate for the user.


Author(s):  
Tim Button ◽  
Sean Walsh

Chapters 6-12 are driven by questions about the ability to pin down mathematical entities and to articulate mathematical concepts. This chapter is driven by similar questions about the ability to pin down the semantic frameworks of language. It transpires that there are not just non-standard models, but non-standard ways of doing model theory itself. In more detail: whilst we normally outline a two-valued semantics which makes sentences True or False in a model, the inference rules for first-order logic are compatible with a four-valued semantics; or a semantics with countably many values; or what-have-you. The appropriate level of generality here is that of a Boolean-valued model, which we introduce. And the plurality of possible semantic values gives rise to perhaps the ‘deepest’ level of indeterminacy questions: How can humans pin down the semantic framework for their languages? We consider three different ways for inferentialists to respond to this question.


1981 ◽  
Vol 4 (4) ◽  
pp. 975-995
Author(s):  
Andrzej Szałas

A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.


1988 ◽  
Vol 4 (4) ◽  
pp. 445-462 ◽  
Author(s):  
Leonard G. Monk

Author(s):  
Rahul Renu ◽  
Gregory Mocko

The objective of the research presented is to develop and implement an ontological knowledge representation for Methods-Time Measurement assembly time estimation process. The knowledge representation is used to drive a decision support system that provides the user with intelligent MTM table suggestions based on assembly work instructions. Inference rules are used to map work instructions to MTM tables. An explicit definition of the assembly time estimation domain is required. The contribution of this research, in addition to the decision support system, is an extensible knowledge representation that models work instructions, MTM tables and mapping rules between the two which will enable the establishment of assembly time estimates. Further, the ontology provides an extensible knowledge representation framework for linking time studies and assembly processes.


Disputatio ◽  
2019 ◽  
Vol 11 (54) ◽  
pp. 207-229
Author(s):  
Matthieu Fontaine

Abstract How to interpret singular terms in fiction? In this paper, we address this semantic question from the perspective of the Artifactual Theory of Fiction (ATF). According to the ATF, fictional characters exist as abstract artifacts created by their author, and preserved through the existence of copies of an original work and a competent readership. We pretend that a well-suited semantics for the ATF can be defined with respect to a modal framework by means of Hintikka’s world lines semantics. The question of the interpretation of proper names is asked in relation to two inference rules, problematic when applied in intensional contexts: the Substitution of Identicals and Existential Generalization. The former fails because identity is contingent. The latter because proper names are not necessarily linked to well-identified individuals. This motivates a non-rigid interpretation of proper names in fiction, although cross-fictional reference (e.g. to real entities) is made possible by the interpretative efforts of the reader.


2014 ◽  
Vol 530-531 ◽  
pp. 301-305
Author(s):  
Huan Huan Nie ◽  
Zhen Lu Wu ◽  
Guo Yan Yu

The frame structure of monitoring system is introduced and the network structure of monitoring system is analyzed in this paper. Fault diagnosis expert system is put forward and the fault inference rules are elaborated according to the fault of natural gas compressor of a company. The significance of the system is summarized in the end.


Sign in / Sign up

Export Citation Format

Share Document