نتایج جستجو برای: based logical deduction
تعداد نتایج: 2971357 فیلتر نتایج به سال:
Deduction, induction, and analogy pervade all our thinking. In contrast with deduction, understanding logical aspects of induction and analogy is stil l an important and challenging issue of artificial intelligence. This paper describes a logical formalization, called production, of common conjectural reasoning of both induction and analogy. By introduction of preduction, analogical reasoning i...
In this paper we argue that sequent proofs systems are a better deductive apparatus for introducing proofs to students than are natural deduction systems. Natural deduction derivations of superintuitionistic theorems (theorems of classical logic that are not intuitionistically valid) require indirect and often obtuse constructions. Constructing derivations in sequent systems is uniform, driven ...
We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that combines two refinements of resolution along with some control strategies to introduce state-based descriptions. We show that the logical calculus in which the computational model...
in this paper we turn the attention to a well developed theory of fuzzy/lin-guis-tic models that are interpretable and, moreover, can be learned from the data.we present four different situations demonstrating both interpretability as well as learning abilities of these models.
Constraint propagation is a matter of logical deduction, but this is not usually sufficient to reach a solution to a problem. Heuristic knowledge is usually needed to go on with the solution search when logical deduction becomes inefficient. The way this second type of knowledge is handled has more to do with decision rather than deduction. In this paper we suggest a mechanism to handle heurist...
We present and analyze inference method called Perception-based Logical Deduction (PbLD) aimed at the treatment of fuzzy IF-THEN rules as linguistically expressed genuine logical implications. Besides the original PbLD, we propose a new balancing variant of PbLD, introduce both variants with fuzzy inputs and study them from the point of view of the interpolativity property.
This article considers a method of data mining from text documents by using logical deduction rules. This algorithm is used in information processing of heterogeneous sources. The method allows to mark out a set of data objects from a flow of semistructured full-text information, presented in natural languages, links between data flows, and to form a repository of factual information. This algo...
The worst-case complexity of cut elimination in sequent calculi for first order based logics is investigated in terms of the increase in logical depth of the deduction. It is shown that given a calculus satisfying a general collection of sufficient conditions for cut elimination and given a deduction with cuts, there exists a cut free deduction with a logical depth, in the worst case, hyper-exp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید