Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper, we mainly present an axiom selection method based on symbols' weights. Firstly, the problem of selecting axioms relevant to conjecture and the basic idea of symbol-based axiom selection are simply introduced. Then, some details of our selection method based on symbols' weights are presented follow. We define the weight corresponding to each symbol, and use symbols' weights to compute relevance...
In this paper, an α-resolution automated reasoning method is studied based on the multiary α-resolution principle in lattice-valued first-order logic system LF(X) with truth-value in lattice implication algebra. Concretely, α-lock semantic resolution method is presented in LF(X), its soundness and condition completeness theorems have also been proved. And then α-lock semantic resolution method is...
In order to improve the reasoning efficiency of the resolution principle in propositional logic, in the purpose of reducing the size of clause set and eliminating the number of literal in clause set as soon as possible. In this paper, it presents an elimination resolution method by calculating the number of complementary pairs to pick out resolution literal. This paper proves the completeness of this...
In the present paper, general form of α-ordered linear resolution method is established in lattice-valued logic system with linguistic truth-values. Firstly, general form of α-ordered linear resolution method is investigated in linguistics truth-valued lattice-valued propositional logic system based on linguistics truth-valued lattice implication algebra. It can obtain a resolvent under a linguistic...
Smart homes present complex domains that suit ontological modelling. To be efficient, smart home systems must incorporate domain uncertainty into decision making. But ontologies presently cannot represent and reason under uncertainty. It is thus challenging, developing ontology-based decision-making models that can integrate domain uncertainty. In this paper, we seek a decision network approach as...
This paper focuses on resolution-based automated reasoning theory in a lattice-valued logic system with truth values that are defined in a lattice-valued logical algebraic structure—lattice implication algebras (LIAs)—which essentially aims to extend the classical logic to handle automated deduction under an uncertain environment. Concretely, we investigate a generalization of the known conjunctive...
In this paper we propose a new resolution approach for automated reasoning in artificial intelligence. the general form a-linear resolution method is established in lattice-valued first-order logic system LF(X) based on lattice implication algebra. the soundness theorem is given in LF(X). by using lift lemma, the weak completeness theorem is also investigated in LF(X). This method is to provide a...
As a continuation of research work on a-generalized resolution for lattice-valued logic system, the a-generalized linear resolution method for lattice-valued first-order logic system LF(X) based on lattice implication algebra is presented, which can provide an automated reasoning tool for information processing and knowledge representation. The soundness theorem is established. By use of the lifting...
In this paper, under linguistic truth-valued lattice-valued first-order logic system lF(X) , the Consistency of reasoning rules is obtained, by select the parametric ??,??, T and I of approximate input information from the fuzziness and the incomparability in the intelligent information processing. Secondly, with the representability of inference rules in model (1) investigated, we also study consistent...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.