Formalizing Default Reasoning

Fuzzy set systems can be used to solve the problem with uncertain knowledge,and default logic can be used to solve the problem with incomplete knowledge,in some sense.In this paper,based on interval-valued fuzzy sets we introduce a method of inference which combines approximate reasoning an default ogic,and give the procedure of transforming monotonic reasoning into default reasoning.     

A causal model for diagnostic reasoning

Up to now,there have many methods for knowledge representation and reasoning in causal networks,but few of them include the research on the coactions of nodes.In practice,ignoring these coactions may influence the accureacy of reasoning and even give rise to incorrect reasoning.In this paper,based on multilayer causal networks.the definitions on coaction nodes are given to construct a new causal network called Coaction Causal Network,which serves to construct a model of nerual network for diagnosis followed by fuzzy reasoning,and then the activation rules are given and neural computing methods are used to finish the diagnostic reasoning,These methods are proved in theory and a method of computing the number of solutions for the diagnostic reasoning is given.Finally,the experiments and the conclusions are presented.     

Truth-value transmittal fuzzy reasoning interpolator

Fuzzy reasoning and interpolation were used independently as two methods of ex- pression functional relationship approximately in the past. The relevancy behind them was discussed firstly in refs. [1―3]. In ref. [1], fuzzy reasoning algorithms used com- monly at present were approximated to some interpolation algorithms. Based on the analysis of rationality of such approximation, the author of ref. [4] put forward the con- cept of the fuzzy reasoning interpolator. In this paper, we keep on re…     

解决证据推理中一类“0绝对化”问题的方法

In fact, evidential reasoning is a kind of commonsensible reasoning, so the reasoning results must be consistent with the basic common senses of human beings. In this paper,regarding to a kind of “0 absolutization” problem in the evidential reasoning, two real examples are given, and the handling method is brought forward. Compared with traditional approaches, this method embodies much more man's decision-making common senses. The "0 absolutization” problems in two examples are solved reasonably, and the results are discussed finally.     

Universal triple I fuzzy reasoning algorithm of function model based on quotient space

Aiming at the deficiencies of analysis capacity from different levels and fuzzy treating method in product function modeling of conceptual design,the theory of quotient space and universal triple I fuzzy reasoning method are introduced,and then the function modeling algorithm based on the universal triple I fuzzy reasoning method is proposed.Firstly,the product function granular model based on the quotient space theory is built,with its function granular representation and computing rules defined at the same time.Secondly,in order to quickly achieve function granular model from function requirement,the function modeling method based on universal triple I fuzzy reasoning is put forward.Within the fuzzy reasoning of universal triple I method,the small-distance-activating method is proposed as the kernel of fuzzy reasoning;how to change function requirements to fuzzy ones,fuzzy computing methods,and strategy of fuzzy reasoning are respectively investigated as well;the function modeling algorithm based on the universal triple I fuzzy reasoning method is achieved.Lastly,the validity of the function granular model and function modeling algorithm is validated.Through our method,the reasonable function granular model can be quickly achieved from function requirements,and the fuzzy character of conceptual design can be well handled,which greatly improves conceptual design.     

A Common Reasoning Model and Its Application in Knowledge-Based System

To use reasoning knowledge accurately and efficiently,many reasoning methods have been proposed.However,the differences in form among the methods may obstruct the systematical analysis and harmonious integration of them.In this paper,a common reasoning model JUM(Judgement Model)is introduced.According to JUM,a common knowledge representation form is abstracted from different reasoning methods and its limitation is reduced.We also propose an algorithm for transforming one type of JUMs into another.In some cases,the algorithm can be used to resolve the key problem of integrating different types of JUM in one system.It is possible that a new architecture of knowledge-based system can be realized under JUM.     

综合推理与智能书法创作

In this paper, we address the demanding task of developing intelligent systems equipped with machine creativity that can perform design tasks automatically. The main challenge is how to model human beings' creativity mathematically and mimic such creativity computationally. We propose a ``synthesis reasoning model" as the underlying mechanism to simulate human beings' creative thinking when they are handling design tasks. We present the theory of the synthesis reasoning model, and the detailed procedure of designing an intelligent system based on the model. We offer a case study of an intelligent Chinese calligraphy generation system which we have developed. Based on implementation experiences of the calligraphy generation system as well as a few other systems for solving real-world problems, we suggest a generic methodology for constructing intelligent systems using the synthesis reasoning model.     

多媒体推理的概念框架

Up to now, AI technology is dominated by the Physical Symbolic System(PSS), in which symbolic information is used as the medium for reasoning, In these approaches, information other than symbols, such as image, graphics, and even video should first be represented by symbols, and after reasoning, the symbolic result is again changed into its original media form. In this paper, we will propose a new form of reasoning method called multimedia reasoning (MR), a kind of reasoning that is based on the different media such as text, image, video, audio and so on. By introducing the concept of multimedia transformation theory (MTT), it presents a conceptual framework for multimedia reasoning, In the end, it discusses the importance and potentials in applications.     

基于空间推理的设计方法及其应用

In this paper,we discuss two main techniques concerning spatial reasoning in the designfield:representation of spatial relation and method of spatial reasoning. Based on this,we present aspatial reasoning model. Finally,we discuss an automatic advertising creation system which acts asan example of this model     

Deliberative discourse and reasoning from generic argument structures

In this article a dialectical model for practical reasoning within a community, based on the Generic/Actual Argument Model (GAAM) is advanced and its application to deliberative dialogue discussed. The GAAM, offers a dynamic template for structuring knowledge within a domain of discourse that is connected to and regulated by a community. The paper demonstrates how the community accepted generic argument structure acts to normatively influence both admissible reasoning and the progression of dialectical reasoning between participants. It is further demonstrated that these types of deliberation dialogues supported by the GAAM comply with criteria for normative principles for deliberation, specifically, Alexy’s rules for discourse ethics and Hitchcock’s Principles of Rational Mutual Inquiry. The connection of reasoning to the community in a documented and transparent structure assists in providing best justified reasons, principles of deliberation and ethical discourse which are important advantages for reasoning communities.     

Using argument schemes for hypothetical reasoning in law

This paper studies the use of hypothetical and value-based reasoning in US Supreme-Court cases concerning the United States Fourth Amendment. Drawing upon formal AI & Law models of legal argument a semi-formal reconstruction is given of parts of the Carney case, which has been studied previously in AI & law research on case-based reasoning. As part of the reconstruction, a semi-formal proposal is made for extending the formal AI & Law models with forms of metalevel reasoning in several argument schemes. The result is compared with Rissland’s (1989) analysis in terms of dimensions and Ashley’s (2008) analysis in terms of his process model of legal argument with hypotheticals.     

A Calculus and logic of resources and processes

Recent advances in logics for reasoning about resources provide a new approach to compositional reasoning in interacting systems. We present a calculus of resources and processes, based on a development of Milner’s synchronous calculus of communication systems, SCCS, that uses an explicit model of resource. Our calculus models the co-evolution of resources and processes with synchronization constrained by the availability of resources. We provide a logical characterization, analogous to Hennessy–Milner logic’s characterization of bisimulation in CCS, of bisimulation between resource processes which is compositional in the concurrent and local structure of systems. An erratum to this article can be found at     

Children’s Application of Theory of Mind in Reasoning and Language

Many social situations require a mental model of the knowledge, beliefs, goals, and intentions of others: a Theory of Mind (ToM). If a person can reason about other people’s beliefs about his own beliefs or intentions, he is demonstrating second-order ToM reasoning. A standard task to test second-order ToM reasoning is the second-order false belief task. A different approach to investigating ToM reasoning is through its application in a strategic game. Another task that is believed to involve the application of second-order ToM is the comprehension of sentences that the hearer can only understand by considering the speaker’s alternatives. In this study we tested 40 children between 8 and 10 years old and 27 adult controls on (adaptations of) the three tasks mentioned above: the false belief task, a strategic game, and a sentence comprehension task. The results show interesting differences between adults and children, between the three tasks, and between this study and previous research.     

Answer Set Programming Based on Propositional Satisfiability

Answer set programming (ASP) emerged in the late 1990s as a new logic programming paradigm that has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced. All these reductions, however, are limited to a subclass of logic programs or introduce new variables or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASPSAT, that (1) deals with any (nondisjunctive) logic program, (2) works on a propositional formula without additional variables (except for those possibly introduced by the clause form transformation), and (3) is guaranteed to work in polynomial space. From a theoretical perspective, we prove soundness and completeness of ASPSAT. From a practical perspective, we have (1) implemented ASPSAT in Cmodels, (2) extended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and (3) conducted an extensive comparative analysis involving other state-of-the-art answer set solvers. The experimental analysis shows that our solver is competitive with the other solvers we considered and that the reasoning strategies that work best on ‘small but hard’ problems are ineffective on ‘big but easy’ problems and vice versa.     

Comparing Alternatives in the law*

This paper argues the thesis that a particular style of reasoning, qualitative comparative reasoning (QCR), plays a role in at least three areas of legal reasoning that are central in AI and law research, namely legal theory construction, case-based reasoning in the form of case comparison, and legal proof. The paper gives an informal exposition of one particular way to deal with QCR, based on the author’s previous work on reason-based logic (RBL). Then it contains a substantially adapted formalisation of RBL, to make RBL suitable for dealing with QCR. The paper concludes with a brief discussion of related work. *This paper is based on the chapters 3 and 4 of Hage 2005.     

Analytic Tableaux for Higher-Order Logic with Choice

While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers so far have not. In order to support automated reasoning in the presence of a choice operator, we present a cut-free ground tableau calculus for Church’s simple type theory with choice. The tableau calculus is designed with automated search in mind. In particular, the rules only operate on the top level structure of formulas. Additionally, we restrict the instantiation terms for quantifiers to a universe that depends on the current branch. At base types the universe of instantiations is finite. Both of these restrictions are intended to minimize the number of rules a corresponding search procedure is obligated to consider. We prove completeness of the tableau calculus relative to Henkin models.     

Symbol system for symmetry of physical systems

Based on the view that symmetry recognition plays an essential role in human reasoning about the laws of physical phenomena, we propose a reasoning paradigm in which symmetry assist in the discovery of physical laws. Within this paradigm, symmetries are used as constraints which enable us to specify, derive, and generalize these equations. The symmetry-based reasoning is extracted and formalized from Einstein's work on relativity. We claim that the reasoning procedure thus formalized provides a general reasoning architecture that is common to dimensional analysis in engineering, mathematical proofs, and common sense reasoning. This symmetry-based reasoning system has been implemented as a symbol-processing system with a production system and a formula-processing system. Using the symmetry-based reasoning system, the equation of Black's Law of specific heat is demonstrated to be specifie, derived, and generalized.     

Local Logics, Non-Monotonicity and Defeasible Argumentation

In this paper we present an embedding of abstract argumentation systems into the framework of Barwise and Seligmans logic of information flow. We show that, taking P.M. Dungs characterization of argument systems, a local logic over states of a deliberation may be constructed. In this structure, the key feature of non-monotonicity of commonsense reasoning obtains as the transition from one local logic to another, due to a change in certain background conditions. Each of Dungs extensions of argument systems leads to a corresponding ordering of background conditions. The relations among extensions becomes a relation among partial orderings of background conditions. This introduces a conceptual innovation in Barwise and Seligmans representation of commonsense reasoning.