Relevant bibliographies by topics / Mani valued logics

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Mani valued logics'

Author: Grafiati
Published: 10 March 2023
Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Mani valued logics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Mani valued logics"

1

Turunen, Esko. "Paraconsistent Many-Valued Logic in GUHA Framework." Acta Informatica Pragensia 7, no. 1 (2018): 104–11. http://dx.doi.org/10.18267/j.aip.116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pawlowski, Pawel. "Tree-Like Proof Systems for Finitely-Many Valued Non-deterministic Consequence Relations." Logica Universalis 14, no. 4 (2020): 407–20. http://dx.doi.org/10.1007/s11787-020-00263-0.

Full text
Abstract:
Abstract The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.
APA, Harvard, Vancouver, ISO, and other styles
3

Ciuni, Roberto, and Massimiliano Carrara. "Normality operators and classical recapture in many-valued logic." Logic Journal of the IGPL 28, no. 5 (2018): 657–83. http://dx.doi.org/10.1093/jigpal/jzy055.

Full text
Abstract:
AbstractIn this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some (or all) of the three properties, namely subclassicality and two properties that we call fixed-point negation property and conservativeness. In the second part of the
APA, Harvard, Vancouver, ISO, and other styles
4

Непейвода, Н. Н. "Formalization as the Immanent Part of Logical Solving." Logical Investigations 24, no. 1 (2018): 129–45. http://dx.doi.org/10.21146/2074-1472-2018-24-1-129-145.

Full text
Abstract:
The work is devoted to the logical analysis of the problem solving by logical means. It starts from general characteristic of the applied logic as a tool: 1. to bound logic with its applications in theory and practice; 2. to import methods and methodologies from other domains into logic; 3. to export methods and methodologies from logic into other domains. The precise solving of a precisely stated logical problem occupies only one third of the whole process of solving real problems by logical means. The formalizing precedes it and the deformalizing follows it. The main topic when considering f
APA, Harvard, Vancouver, ISO, and other styles
5

Iashin, Boris Leonidovich. "Non-Classical Logics in Modern Science." Философская мысль, no. 1 (January 2023): 15–25. http://dx.doi.org/10.25136/2409-8728.2023.1.39350.

Full text
Abstract:
Non-classical logicians have significantly expanded the traditional field of using logical methods. The first of them was the three-digit logic of Y. Lukasevich. Next came the three-digit logic of A. Bochvar, the "quantum logics" of G. Reichenbach and P. Detush-Fevrier, infinite-valued, probabilistic and other logics. The possibilities of non-classical logics have become widely used in various branches of scientific knowledge. Polysemantic, fuzzy, intuitionistic, modal, relevant and paranoherent, temporal and other non-classical logics are widely used today in physics, computational mathematic
APA, Harvard, Vancouver, ISO, and other styles
6

Trzęsicki, Kazimierz. "Indeterministic Temporal Logic." Studies in Logic, Grammar and Rhetoric 42, no. 1 (2015): 139–62. http://dx.doi.org/10.1515/slgr-2015-0034.

Full text
Abstract:
Abstract The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the
APA, Harvard, Vancouver, ISO, and other styles
7

AVRON, ARNON, and YONI ZOHAR. "REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS." Review of Symbolic Logic 12, no. 1 (2018): 173–200. http://dx.doi.org/10.1017/s1755020318000321.

Full text
Abstract:
AbstractThe operations of expansion and refinement on nondeterministic matrices (Nmatrices) are composed to form a new operation called rexpansion. Properties of this operation are investigated, together with their effects on the induced consequence relations. Using rexpansions, a semantic method for obtaining conservative extensions of (N)matrix-defined logics is introduced and applied to fragments of the classical two-valued matrix, as well as to other many-valued matrices and Nmatrices. The main application of this method is the construction and investigation of truth-preserving ¬-paraconsi
APA, Harvard, Vancouver, ISO, and other styles
8

Dr., Sabeena P. S. "Does Jaina Epistemology Indicate a Many-Valued Logic." Kiranavali XV, no. I-IV (2023): 185–92. https://doi.org/10.5281/zenodo.10643141.

Full text
Abstract:
This paper attempts to reconsider the relationship between rationality and consistency and discusses the logical basis of many valued logic. The ontological component of the anekānta vāda thesis proceeds via its logical corollary of a seven-step formulation, sapta-bhaṇgī, within a form of dialectical reasoning or, better, conditioned predication, called syad vāda, (semantics of possibilities). This paper is to offer a new interpretation of syad vada regarding many-valued logic, by means of it try to draw out some of its philosophical implications.
APA, Harvard, Vancouver, ISO, and other styles
9

Kamide, Norihiro. "Inconsistency-Tolerant Multi-Agent Calculus." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 22, no. 06 (2014): 815–29. http://dx.doi.org/10.1142/s0218488514500433.

Full text
Abstract:
Verifying and specifying multi-agent systems in an appropriate inconsistency-tolerant logic are of growing importance in Computer Science since computer systems are generally used by or composed of inconsistency-tolerant multi-agents. In this paper, an inconsistency-tolerant logic for representing multi-agents is introduced as a Gentzen-type sequent calculus. This logic (or calculus) has multiple negation connectives that correspond to each agent, and these negation connectives have the property of paraconsistency that guarantees inconsistency-tolerance. The logic proposed is regarded as a mod
APA, Harvard, Vancouver, ISO, and other styles
10

Ono, Hiroakira, and Yuichi Komori. "Logics without the contraction rule." Journal of Symbolic Logic 50, no. 1 (1985): 169–201. http://dx.doi.org/10.2307/2273798.

Full text
Abstract:
We will study syntactical and semantical properties of propositional logics weaker than the intuitionistic, in which the contraction rule (or, the exchange rule or the weakening rule, in some cases) does not hold. Here, the contraction rule means the rule of inference of the formif we formulate our logics in a Gentzen-type formal system. Some syntactical properties of these logics have been studied firstly by the second author in [11], in connection with the study of BCK-algebras (for information on BCK-algebras, see [9]). There, it turned out that such a syntactical method is a powerful and p
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Mani valued logics"

1

Vitale, Gaetano. "Many valued logics: interpretations, representations and applications." Doctoral thesis, Universita degli studi di Salerno, 2017. http://hdl.handle.net/10556/2590.

Full text
Abstract:
2015 - 2016<br>This thesis, as the research activity of the author, is devoted to establish new connections and to strengthen well-established relations between different branches of mathematics, via logic tools. Two main many valued logics, logic of balance and L ukasiewicz logic, are considered; their associated algebraic structures will be studied with different tools and these techniques will be applied in social choice theory and artificial neural networks. The thesis is structured in three parts. Part I The logic of balance, for short Bal(H), is introduced. It is showed: the relation with `
APA, Harvard, Vancouver, ISO, and other styles
2

Johnson, Cory. "Suggestions for Deontic Logicians." Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/19221.

Full text
Abstract:
The purpose of this paper is to make a suggestion to deontic logic: Respect Hume\'s Law, the answer to the is-ought problem that says that all ought-talk is completely cut off from is-talk. Most deontic logicians have sought another solution: Namely, the solution that says that we can bridge the is-ought gap. Thus, a century\'s worth of research into these normative systems of logic has lead to many attempts at doing just that. At the same time, the field of deontic logic has come to be plagued with paradox. My argument essentially depends upon there being a substantive relation between this b
APA, Harvard, Vancouver, ISO, and other styles
3

Bianchi, M. "ON SOME AXIOMATIC EXTENSIONS OF THE MONOIDAL T-NORM BASED LOGIC MTL: AN ANALYSIS IN THE PROPOSITIONAL AND IN THE FIRST-ORDER CASE." Doctoral thesis, Università degli Studi di Milano, 2010. http://hdl.handle.net/2434/150078.

Full text
Abstract:
The scientific area this thesis belongs to are many-valued logics: in particular, the logic MTL and some of its extensions, in the propositional and in the first-order case (see [8],[9],[6],[7]). The thesis is divided in two parts: in the first one the necessary background about these logics, with some minor new results, are presented. The second part is devoted to more specific topics: there are five chapters, each one about a different problem. In chapter 6 a temporal semantics for Basic Logic BL is presented. In chapter 7 we move to first-order logics, by studying the supersoundness prop
APA, Harvard, Vancouver, ISO, and other styles
4

Falkowski, Bogdan Jaroslaw. "Spectral Methods for Boolean and Multiple-Valued Input Logic Functions." PDXScholar, 1991. https://pdxscholar.library.pdx.edu/open_access_etds/1152.

Full text
Abstract:
Spectral techniques in digital logic design have been known for more than thirty years. They have been used for Boolean function classification, disjoint decomposition, parallel and serial linear decomposition, spectral translation synthesis (extraction of linear pre- and post-filters), multiplexer synthesis, prime implicant extraction by spectral summation, threshold logic synthesis, estimation of logic complexity, testing, and state assignment. This dissertation resolves many important issues concerning the efficient application of spectral methods used in the computer-aided design of digita
APA, Harvard, Vancouver, ISO, and other styles
5

Lu, Weiyun. "Topics in Many-valued and Quantum Algebraic Logic." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35173.

Full text
Abstract:
Introduced by C.C. Chang in the 1950s, MV algebras are to many-valued (Łukasiewicz) logics what boolean algebras are to two-valued logic. More recently, effect algebras were introduced by physicists to describe quantum logic. In this thesis, we begin by investigating how these two structures, introduced decades apart for wildly different reasons, are intimately related in a mathematically precise way. We survey some connections between MV/effect algebras and more traditional algebraic structures. Then, we look at the categorical structure of effect algebras in depth, and in particular see how
APA, Harvard, Vancouver, ISO, and other styles
6

Béjar, Torres Ramón. "Systematic and local search algorithms for regular-SAT." Doctoral thesis, Universitat Autònoma de Barcelona, 2000. http://hdl.handle.net/10803/3018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Valota, D. "DUALITIES AND REPRESENTATIONS FOR MANY-VALUED LOGICS IN THE HIERARCHY OF WEAK NILPOTENT MINIMUM." Doctoral thesis, Università degli Studi di Milano, 2012. http://hdl.handle.net/2434/172442.

Full text
Abstract:
In this thesis we study particular subclasses of WNM algebras. The variety of WNM algebras forms the algebraic semantics of the WNM logic, a propositional many-valued logic that generalizes some well-known case in the setting of triangular norms logics. WNM logic lies in the hierarchy of schematic extensions of MTL, which is proven to be the logic of all left-continuous triangular norms and their residua. In this work, I have extensively studied two extensions of WNM logic, namely RDP logic and NMG logic, from the point of view of algebraic and categorical logic. We develop spectr
APA, Harvard, Vancouver, ISO, and other styles
8

Rahman, Md Raqibur. "Online testing in ternary reversible logic." Thesis, Lethbridge, Alta. : University of Lethbridge, c2011, 2011. http://hdl.handle.net/10133/3208.

Full text
Abstract:
In recent years ternary reversible logic has caught the attention of researchers because of its enormous potential in different fields, in particular quantum computing. It is desirable that any future reversible technology should be fault tolerant and have low power consumption; hence developing testing techniques in this area is of great importance. In this work we propose a design for an online testable ternary reversible circuit. The proposed design can implement almost all of the ternary logic operations and is also capable of testing the reversible ternary network in real time (online). T
APA, Harvard, Vancouver, ISO, and other styles
9

Buchele, Suzanne Fox. "Three-dimensional binary space partitioning tree and constructive solid geometry tree construction from algebraic boundary representations /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Galán, García María Ángeles. "Categorical Unification." Doctoral thesis, Umeå University, Computing Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245.

Full text
Abstract:
<p>This thesis deals with different aspects towards many-valued unification which have been studied in the scope of category theory. The main motivation of this investigation comes from the fact that in logic programming, classical unification has been identified as the provision of coequalizers in Kleisli categories of term monads. Continuing in that direction, we have used categorical instrumentations to generalise the classical concept of a term. It is expected that this approach will provide an appropriate formal framework for useful developments of generalised terms as a basis for many-va
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Mani valued logics"

1

Malinowski, Grzegorz. Many-valued logics. Clarendon Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gottwald, Siegfried. A treatise on many-valued logic. Research Studies Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guiașu, Silviu. Relative logic for intelligence-based systems. Advanced Knowledge International, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bolc, Leonard. Many-valued logics. Springer-Verlag, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Didier, Dubois, Prade Henri M, and Klement E. P, eds. Fuzzy sets, logics, and reasoning about knowledge. Kluwer Academic, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

1934-, Epstein George. Multiple-valued logic design: An introduction. Institute of Physics Pub., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Stojmenović, Ivan. Some combinatorial and algorithmic problems in many-valued logics. University of Novi Sad, Faculty of Science, Institute of Mathematics, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

International Symposium on Multiple-Valued Logic (24th 1994 Boston, Mass.). The twenty-fourth International Symposium on Multiple-Valued Logic: Proceedings, May 25-27, 1994, Boston, Massachusetts. IEEE Computer Society Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Zhaowan. Duo zhi luo ji bo yi yu yi yan jiu. Ke xue chu ban she, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

T, Butler Jon, ed. Multiple-valued logic in VLSI design. IEEE Computer Society Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Mani valued logics"

1

Bolc, Leonard, and Piotr Borowik. "Probability Logics." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bolc, Leonard, and Piotr Borowik. "Approximation Logics." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bolc, Leonard, and Piotr Borowik. "Preliminaries." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bolc, Leonard, and Piotr Borowik. "Many-Valued Propositional Calculi." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bolc, Leonard, and Piotr Borowik. "Survey of Three-Valued Propositional Calculi." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bolc, Leonard, and Piotr Borowik. "Some n-valued Propositional Calculi: A Selection." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bolc, Leonard, and Piotr Borowik. "Intuitionistic Propositional Calculus." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bolc, Leonard, and Piotr Borowik. "First-Order Predicate Calculus for Many-Valued Logics." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bolc, Leonard, and Piotr Borowik. "The Method of Finitely Generated Trees in n-valued Logical Calculi." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bolc, Leonard, and Piotr Borowik. "Fuzzy Propositional Calculi." In Many-Valued Logics. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-08494-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Mani valued logics"

1

Majer, Ondrej, and Igor Sedlár. "On Many-Valued Modal Probabilistic Logics." In 2025 IEEE 55th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2025. https://doi.org/10.1109/ismvl64713.2025.00014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Běhounek, Libor. "A Predicate Variant of Two-Layered Many-Valued Probability Logic." In 2025 IEEE 55th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2025. https://doi.org/10.1109/ismvl64713.2025.00015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cheberiachko, Serhii, Dmytro Radchuk, Yuriy Cheberiachko, Oleg Deryugin, and Mykola Naumov. "Evaluation of the Impact of Wearing a Filtering Half Mask on the Cognitive Indicators of Users." In 8th International Congress "Environment Protection. Energy Saving. Sustainable Environmental Management". Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-1jvlxw.

Full text
Abstract:
Purpose. Study of the influence of users' cognitive indicators on decision-making time when using filtering half masks. Method. 10 men and 5 women who used RPA-DE filtering half masks manufactured by Research and Production Enterprise STANDART took part in the study. During the study, the time and speed of the reaction of half masks users to a stimulus were determined, which allows us to assess the speed of decision-making when performing professional activities in a polluted working environment. The tasks were performed in the absence of physical exertion: once in a half mask, another time wi
APA, Harvard, Vancouver, ISO, and other styles
4

Console, Marco, Paolo Guagliardo, and Leonid Libkin. "Do We Need Many-valued Logics for Incomplete Information?" In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/851.

Full text
Abstract:
One of the most common scenarios of handling incomplete information occurs in relational databases. They describe incomplete knowledge with three truth values, using Kleene's logic for propositional formulae and a rather peculiar extension to predicate calculus. This design by a committee from several decades ago is now part of the standard adopted by vendors of database management systems. But is it really the right way to handle incompleteness in propositional and predicate logics? Our goal is to answer this question. Using an epistemic approach, we first characterize possible levels of part
APA, Harvard, Vancouver, ISO, and other styles
5

Flaminio, Tommaso, Sandro Preto, and Sara Ugolini. "Reasoning about Probability via Continuous Functions." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/28.

Full text
Abstract:
For functional representation in an algebraizable logic we mean a representation of the algebras of formulas of the logic by means of (possibly real-valued) functions. Functional representations have shown to be a key tool for the study of non-classical logics, since they allow to regard formulas as functions and, by means of them, to approach the study of typical proof theoretical properties of the logics by means of their functional semantics. In the realm of (algebraizable) fuzzy logics, possibly the most well-known result in this respect is McNaughton theorem that shows formulas of the inf
APA, Harvard, Vancouver, ISO, and other styles
6

Argelich, J., X. Domingo, Chu-Min Li, F. Manya, and J. Planes. "Towards Solving Many-Valued MaxSAT." In 36th International Symposium on Multiple-Valued Logic (ISMVL'06). IEEE, 2006. http://dx.doi.org/10.1109/ismvl.2006.43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sedlár, Igor. "Decidability and Complexity of Some Finitely-valued Dynamic Logics." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/54.

Full text
Abstract:
Propositional Dynamic Logic, PDL, is a well known modal logic formalizing reasoning about complex actions. We study many-valued generalizations of PDL based on relational models where satisfaction of formulas in states and accessibility between states via action execution are both seen as graded notions, evaluated in a finite Łukasiewicz chain. For each n&gt;1, the logic PDŁn is obtained using the n-element Łukasiewicz chain, PDL being equivalent to PDŁ2. These finitely-valued dynamic logics can be applied in formalizing reasoning about actions specified by graded predicates, reasoning about c
APA, Harvard, Vancouver, ISO, and other styles
8

Argelich, Josep, Chu Min Li, Felip Manya, and Zhu Zhu. "Many-Valued MinSAT Solving." In 2014 IEEE 44th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2014. http://dx.doi.org/10.1109/ismvl.2014.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bo, Chen, Zhao Kang, Ma Changhui, Zhang Bing, Wu Cheng, and Suiyuefei. "The Modalized Many-Valued Logic." In 2018 14th International Conference on Semantics, Knowledge and Grids (SKG). IEEE, 2018. http://dx.doi.org/10.1109/skg.2018.00010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Donnarumma, A., and M. Pappalardo. "Designing in many-valued logic." In Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296). IEEE, 1999. http://dx.doi.org/10.1109/ipmm.1999.792570.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Mani valued logics"

1

Borgwardt, Stefan, Marco Cerami, and Rafael Peñaloza. Subsumption in Finitely Valued Fuzzy EL. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.212.

Full text
Abstract:
Aus der Einleitung: Description Logics (DLs) are a family of knowledge representation formalisms that are successfully applied in many application domains. They provide the logical foundation for the Direct Semantics of the standard web ontology language OWL2. The light-weight DL EL, underlying the OWL2 EL profile, is of particular interest since all common reasoning problems are polynomial in this logic, and it is used in many prominent biomedical ontologies like SNOMEDCT and the Gene Ontology.
APA, Harvard, Vancouver, ISO, and other styles
2

Kozachenko, Nadiia. AGM cognitive actions as modal operators of three-valued logic: presentation. Ruhr-Universität Bochum, 2022. http://dx.doi.org/10.31812/123456789/6687.

Full text
Abstract:
AGM is designed so that its principles can be applied to the development of belief dynamics models, regardless of the field of application. The main idea of this work is to see how we can to represent cognitive actions considered in AGM within a certain three-valued logic, and check what interesting properties can be discovered in this way. To do this, we will consider the basic concepts and principles of AGM. Then we interpret them in a logical schema. And then we see what information about them we can get in the resulting system.
APA, Harvard, Vancouver, ISO, and other styles
3

Küsters, Ralf, and Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.

Full text
Abstract:
Computing the most specific concept (msc) is an inference task that can be used to support the 'bottom-up' construction of knowledge bases for KR systems based on description logics. For description logics that allow for number restrictions or existential restrictions, the msc need not exist, though. Previous work on this problem has concentrated on description logics that allow for universal value restrictions and number restrictions, but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential restrictions. More precise
APA, Harvard, Vancouver, ISO, and other styles
4

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for nu
APA, Harvard, Vancouver, ISO, and other styles
5

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for nu
APA, Harvard, Vancouver, ISO, and other styles
6

Cheung, Mike. Meta-Analytic SEM in R. Instats Inc., 2023. http://dx.doi.org/10.61700/2sgaqfuzkt040469.

Full text
Abstract:
This seminar introduces the logic of meta-analytic structural equation modeling (MASEM) and illustrates how to conduct the analyses with R. Meta-analytic SEM is an incredibly powerful tool for hypothesis and theory testing, relying on pooled correlation matrices from primary studies, and this seminar will teach you the basics of MASEM and how to apply it in your own research, using many hands-on examples with Professor Cheung's R package for MASEM. When purchasing the MASEM seminar you will be freely enrolled in two on-demand seminars that introduce the logic of path analysis and CFA/SEM in R
APA, Harvard, Vancouver, ISO, and other styles
7

Cheung, Mike. Meta-Analytic SEM in R + 2 Free Seminars. Instats Inc., 2022. http://dx.doi.org/10.61700/av62y8z8nlnn6469.

Full text
Abstract:
This seminar introduces the logic of meta-analytic structural equation modeling (MASEM) and illustrates how to conduct the analyses with R. Meta-analytic structural equation modeling (MASEM) is an incredibly powerful tool for hypothesis and theory testing, relying on pooled correlation matrices from primary studies, and this seminar will teach you the basics of MASEM and how to apply it in your own research, using many hands-on examples with Professor Cheung's R package for MASEM. When purchasing the MASEM seminar you will be freely enrolled in two on-demand seminars that introduce the logic o
APA, Harvard, Vancouver, ISO, and other styles
8

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text
Abstract:
An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with exi
APA, Harvard, Vancouver, ISO, and other styles
9

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text
Abstract:
An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with exi
APA, Harvard, Vancouver, ISO, and other styles
10

BESTAEVA, E., and U. TEDEEVA. SOME ASPECTS OF THE WORLDVIEW FOUNDATIONS OF BIOETHICS. Science and Innovation Center Publishing House, 2021. http://dx.doi.org/10.12731/2077-1770-2021-13-3-2-14-24.

Full text
Abstract:
The purpose of the work is to determine the specifics of the worldview foundations of bioethics, their structure, nature and essence of man in the context of the “new experience” in the field of biotechnology. Research methods - philosophical and general logical.”New experience” in the field of biotechnology, as a stimulating discussion of anthropological, axiological and social problems, must be guided by the strategy of personal preservation and the methodology of human integrity and have value-worldview attitudes as real prerequisites. In the new ethics, the fundamental principles of two hi
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Mani valued logics' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography