To see the other types of publications on this topic, follow the link: Mani valued logics.

Journal articles on the topic 'Mani valued logics'

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

Select a source type:

Consult the top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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
11

De Martino, Mario. "Promotion of Political Values through International Programs of Academic Mobility." RUDN Journal of Political Science 22, no. 2 (2020): 312–19. http://dx.doi.org/10.22363/2313-1438-2020-22-2-312-319.

Full text
Abstract:
Nation-states and international organizations widely use educational programs to foster students’ mobility abroad. The majority of scientific literature agrees in considering exchange programs as soft power instruments used by countries to promote their values in geopolitically and economically crucial regions. However, a more in-depth analysis of the reasons motivating nation-states to adopt such initiatives is needed to understand their political goals better. The current study consists of analysing the main formulations proposed by scholars, who delved into the topic of international academ
APA, Harvard, Vancouver, ISO, and other styles
12

DROSTE, MANFRED, and BUNDIT PIBALJOMMEE. "WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS." International Journal of Foundations of Computer Science 25, no. 05 (2014): 641–66. http://dx.doi.org/10.1142/s0129054114500269.

Full text
Abstract:
Nested words have been introduced by Alur and Madhusudan as a model for e.g. recursive programs or XML documents and have received much recent interest. In this paper, we investigate a quantitative automaton model and a quantitative logic for nested words. The behavior resp. the semantics map nested words to weights which are taken from a strong bimonoid. Strong bimonoids can be viewed as semirings without requiring the distributivity assumption which was essential in the classical theory of formal power series; strong bimonoids include e.g. all bounded lattices and many other structures from
APA, Harvard, Vancouver, ISO, and other styles
13

Chiriţă, Carmen. "Tense θ-valued Moisil propositional logic". International Journal of Computers Communications & Control 5, № 5 (2010): 642. http://dx.doi.org/10.15837/ijccc.2010.5.2220.

Full text
Abstract:
In this paper we study the tense θ-valued Moisil propositional calculus, a logical system obtained from the θ-valued Moisil propositional logic by adding two tense operators. The main result is a completeness theorem for tense θ-valued Moisil propositional logic. The proof of this theorem is based on the representation theorem of tense θ-valued Łukasiewicz-Moisil algebras, developed in a previous paper.
APA, Harvard, Vancouver, ISO, and other styles
14

Alekseev, Valerii Borisovich. "Closed classes in partial k-valued logic." Mathematical Problems of Cybernetics, no. 22 (2024): 14–50. https://doi.org/10.20948/mvk-2024-14.

Full text
Abstract:
The article gives an overview of the main known results on closed classes in partial k-valued logic. The main emphasis is on intervals of closed classes in partial k-valued logic, generated by some closed class A in the set of everywhere defined k-valued functions. Results on Lau intervals are presented, as well as recent results on intervals Int(A) introduced by the author. Some results are given with full proofs.
APA, Harvard, Vancouver, ISO, and other styles
15

Tajsin, Emilia A. "On Two-Valued and Multiple-Valued Logic and on Paradoxes of Verity." Dialogue and Universalism 33, no. 1 (2023): 143–61. http://dx.doi.org/10.5840/du20233319.

Full text
Abstract:
The phenomena of truth, truthfulness, veracity and “truthiness” discussed widely in logic, epistemology as theory of science and gnoseology as general theory of knowledge, have received many interpretations—and not a single one to be generally accepted. Discussions continue not only upon narrow technical, operational questions of the predicate calculus and/or propositions calculus, but also on logic-gnoseological problems, one of which casts doubt on the maxim “logic is the house of truth,” and the other highlights the laxity of the opposition of “truth—falsehood” meanings as the main categori
APA, Harvard, Vancouver, ISO, and other styles
16

Gottwald, Siegfried. "Mathematical Fuzzy Logics." Bulletin of Symbolic Logic 14, no. 2 (2008): 210–39. http://dx.doi.org/10.2178/bsl/1208442828.

Full text
Abstract:
AbstractThe last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics.The paper discusses the mathematical background for the interest in such systems of mathematical fuzzy logics, as well as the most important ones of them. It concentrates on the propositional cases, and mentions the first-order systems more superficially. The main ideas, however, become clear already in this restricted setting.
APA, Harvard, Vancouver, ISO, and other styles
17

Kalimulina, Elmira Yu. "Finiteness of One-Valued Function Classes in Many-Valued Logic." Fractal and Fractional 8, no. 1 (2023): 29. http://dx.doi.org/10.3390/fractalfract8010029.

Full text
Abstract:
This paper addresses the theoretical issues in k-valued logic, which are crucial for developing solutions in various fields of science and technology. One of the fundamental issues is a complete description of the closed classes of functions of three-valued logic. The explicit description of closed classes in multivalued logic is an open problem. In this study, we consider a special case of the finite generation of all closed classes of three-valued logic through the operation of superposition. Previously, we considered the issue of the finite generation of classes containing a subset of singl
APA, Harvard, Vancouver, ISO, and other styles
18

Stampacchia, Paolo, Marco Tregua, and Mariarosaria Coppola. "Zooming-in value-in-use through basic individual values." Journal of Customer Behaviour 19, no. 2 (2020): 97–125. http://dx.doi.org/10.1362/147539220x15929906305116.

Full text
Abstract:
To overcome the vagueness that Service-Dominant Logic (SDL) scholars have found in conceptualisations of value-in-use due to the existence of different denominations and perspectives, this conceptual paper analyses the SDL literature, finding both value-in-use proposed as a comprehensive denomination, and resources, institutions, and time proposed as its main elements.<br/> Focusing on individuals as beneficiaries of value-in-use, the paper infuses the theory of basic individual values from social psychology in SDL, leading to three propositions that stress the ways in which basic indivi
APA, Harvard, Vancouver, ISO, and other styles
19

Pavlova, Alexandra. "Game-theoretical interpretation of abelian logic A." Logical Investigations 25, no. 2 (2019): 75–93. http://dx.doi.org/10.21146/2074-1472-2019-25-2-75-93.

Full text
Abstract:
In the present paper we introduce a variation of Giles's game that captures the semantics of Slaney and Meyer's Abelian logic. This is a variation of the game earlier proposed for the Łukasiewicz infinitely-valued logic. We discuss two possible interpretations of this game. One of the interpretations involves a reference to different types of agents. We also give a brief description of the Abelian logic which as well corresponds to one of the comparative logics proposed by Casari. By different types of agents, we understand agents with diverse cognitive presumptions and capabilities. This refl
APA, Harvard, Vancouver, ISO, and other styles
20

Malinin, Len. "Technology selection based on main parameters of value and fuzzy logic." International Journal of Business Innovation and Research 11, no. 3 (2016): 431. http://dx.doi.org/10.1504/ijbir.2016.078876.

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

Malinin, Len. "Technology selection based on main parameters of value and fuzzy logic." International Journal of Business Innovation and Research 11, no. 3 (2016): 431. http://dx.doi.org/10.1504/ijbir.2016.10000079.

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

Koilo, Viktoriia. "Developing new business models: Logic of network value or cross-industry approach." Problems and Perspectives in Management 19, no. 2 (2021): 291–307. http://dx.doi.org/10.21511/ppm.19(2).2021.24.

Full text
Abstract:
Digital transition in the maritime industry creates new organizational models and affects the relationship between actors. New relationships require new business models (BMs). In addition, due to the paradigm of green shifts towards a zero-emission future of maritime shipping in 2050, stricter regulations require new solutions, and “business as usual” is not actual anymore. Thus, the study aims to investigate key drivers for creating new BMs and factors for their effective implementation by companies. The results of the study point to the main reasons for creating BMs. It was revealed that the
APA, Harvard, Vancouver, ISO, and other styles
23

FLAMINIO, TOMMASO, HYKEL HOSNI, and FRANCO MONTAGNA. "STRICT COHERENCE ON MANY-VALUED EVENTS." Journal of Symbolic Logic 83, no. 1 (2018): 55–69. http://dx.doi.org/10.1017/jsl.2017.34.

Full text
Abstract:
AbstractWe investigate the property of strict coherence in the setting of many-valued logics. Our main results read as follows: (i) a map from an MV-algebra to [0,1] is strictly coherent if and only if it satisfies Carnap’s regularity condition, and (ii) a [0,1]-valued book on a finite set of many-valued events is strictly coherent if and only if it extends to a faithful state of an MV-algebra that contains them. Remarkably this latter result allows us to relax the rather demanding conditions for the Shimony-Kemeny characterisation of strict coherence put forward in the mid 1950s in this Journ
APA, Harvard, Vancouver, ISO, and other styles
24

Liu, Hai Yan. "Coding and Decoding Device Design of Three-Value Quantum Computer." Applied Mechanics and Materials 713-715 (January 2015): 1015–18. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.1015.

Full text
Abstract:
A quantum computer is the computer technology and the micro physical scientists will combine the technology achievements. Quantum computer is the processing of information by using the quantum properties of particle, a new concept quantum laws to control information transmission and processing of computer. Light has the advantages in space time parallel and high-frequency radiation, which makes the optical become the main target of research model the future of computers. This did not prevent the three valued logic calculus is still an important part of the three values of optical computer. It
APA, Harvard, Vancouver, ISO, and other styles
25

Wang, Haiyan, Qiuzhen Lin, Jianyong Chen, et al. "On Stability of Multi-Valued Nonlinear Feedback Shift Registers." Complexity 2019 (February 21, 2019): 1–11. http://dx.doi.org/10.1155/2019/8765970.

Full text
Abstract:
Nonlinear feedback shift registers (NFSRs) are the main building blocks in many convolutional decoders, and a stable NFSR can limit decoding error propagation. Due to lack of efficient algebraic tools, the stability of multi-valued NFSRs has been much less studied. This paper studies the stability of multi-valued NFSRs using a logic network approach. A multi-valued NFSR can be viewed as a logic network. Based on its logic network representation, some sufficient and necessary conditions are provided for globally (locally) stable multi-valued NFSRs, explicit forms are given for the set of basins
APA, Harvard, Vancouver, ISO, and other styles
26

MALININ, Len. "On Application of Main Parameters of Value and Fuzzy Logic to Technology Selection." Open Journal of Industrial and Business Management 2, no. 2 (2014): 23. http://dx.doi.org/10.12966/ojibm.05.02.2014.

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

Jiang, Yaozhi. "Atomic Proposition and 1-Order Predicate Function for Dialectical Logic." Journal of Mathematics Research 11, no. 3 (2019): 50. http://dx.doi.org/10.5539/jmr.v11n3p50.

Full text
Abstract:
This paper has completed main fields of making dialectical logic pure mathematically, it is involved both atomic proposition and 1-order predicate function for dialectical logic, and by state-dual, true-valued function vector, state-contradiction law into basic logic law. In addition, also defines true-valued function for logic operators so that more easy to represent atomic proposition. Some examples are given and shown that Boolean algebra, as a special case of dialectical logic, is how to operate hybridize-able with dialectical logic.
APA, Harvard, Vancouver, ISO, and other styles
28

Iashin, Boris Leonidovich. "Paradoxes in scientific cognition and nonclassical logics." Философская мысль, no. 2 (February 2020): 53–64. http://dx.doi.org/10.25136/2409-8728.2020.2.32172.

Full text
Abstract:
The subject of this research is the scientific paradoxes and such means for its resolution as nonclassical logics. The author defends a thesis that paradoxes often stimulate the scientific development. It is demonstrated that most vividly the problem of paradoxes manifested in crises in the fundamentals of mathematics; the attempts for its resolution in many ways contributes to the emergence of nonclassical logics. It is substantiated that nonclassical logics helped to resolve and explain the paraded occurring in scientific cognition. Comparative analysis is conducted on the capabilities of &a
APA, Harvard, Vancouver, ISO, and other styles
29

Otto, Martin. "The expressive power of fixed-point logic with counting." Journal of Symbolic Logic 61, no. 1 (1996): 147–76. http://dx.doi.org/10.2307/2275602.

Full text
Abstract:
AbstractWe study the expressive power in the finite of the logic Fixed-Point+Counting, the extension of first-order logic which is obtained through adding both the fixed-point constructor and the ability to count.To this end an isomorphism preserving (‘generic’) model of computation is introduced whose PTime restriction exactly corresponds to this level of expressive power, while its PSpace restriction corresponds to While+Counting. From this model we obtain a normal form which shows a rather clear separation of the relational vs. the arithmetical side of the algorithms involved.In parallel, w
APA, Harvard, Vancouver, ISO, and other styles
30

Kozachenko, Nadiia P. "Modelling of AGM-style doxastic operations in three-valued setting." CTE Workshop Proceedings 10 (March 21, 2023): 326–45. http://dx.doi.org/10.55056/cte.553.

Full text
Abstract:
The goal of our work is to show how a theoretical approach to modeling of reasoning can be analyzed to identify controversial issues that reveal prospects for further research. We will consider one of the basic approaches to modeling of reasoning based on the concept of belief revision AGM, which is viewed as classical because it formulates the basic concepts of belief, introduces the main ways of representing beliefs, cognitive actions, systems of postulates for cognitive actions and the basic principles for constructing epistemic systems. However, this conceptual foundation raises many contr
APA, Harvard, Vancouver, ISO, and other styles
31

Grekovich, K. V., V. V. Rybakiov, and V. V. Rimatskiy. "Intransitive Temporal Multi-agent Logic with Agents’ Multi-valuations. Decidability." Bulletin of Irkutsk State University. Series Mathematics 51 (2025): 141–50. https://doi.org/10.26516/1997-7670.2025.51.141.

Full text
Abstract:
We study intransitive temporal multi-agent logic with agents’ multi-valuations for letters and formulas. In previous wide accepted research the time and knowledge primarily were modeled by Kripke models with structure looking as simply a single time cluster with multi-relations for agents’ accessibility relations. Here we develop this approach and use Kripke models with linear intransitive time and states represented by arbitrary time clusters for agents accessibility multi-relations. This logic is defined in a semantic way, as a set of formulas, which are true at linear models with multi-valu
APA, Harvard, Vancouver, ISO, and other styles
32

Ghorani, Maryam. "State hyperstructures of tree automata based on lattice-valued logic." RAIRO - Theoretical Informatics and Applications 52, no. 1 (2018): 23–42. http://dx.doi.org/10.1051/ita/2018004.

Full text
Abstract:
In this paper, an association is organized between the theory of tree automata on one hand and the hyperstructures on the other hand, over complete residuated lattices. To this end, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply L-valued tree automaton) is introduced along with several equivalence relations in the set of the states of an L-valued tree automaton. We obtain two main results from this study: one of the relations can lead to the creation of Kleene’s theorem for L-valued tree automata, and the other one leads to the creation of a m
APA, Harvard, Vancouver, ISO, and other styles
33

Fatić, Aleksandar. "Personality as an ecology of values." Socium i vlast 4 (2021): 18–25. http://dx.doi.org/10.22394/1996-0522-2021-2-18-25.

Full text
Abstract:
The paper examines the concept of individual and collective value identities based an emotionalist understanding of values. The main perspective it discusses is one where emotions are the most important practical instruments for the clarification of individual and collective values. The argument implies that moral emotions are not irrational, but have a logic of their own which can reliably pinpoint the persons’ value system; emotions are thus crucial building blocks of an ethics which is able to enhance personal and moral identity. This particular ecology of moral emotions is pivotal in crisi
APA, Harvard, Vancouver, ISO, and other styles
34

Reiser, Renata Hax Sander, and Benjamin Bedregal. "Correlation in Interval-Valued Atanassov’s Intuitionistic Fuzzy Sets — Conjugate and Negation Operators." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 25, no. 05 (2017): 787–819. http://dx.doi.org/10.1142/s0218488517500349.

Full text
Abstract:
This paper studies the conjugate functions related to main connectives of the Intervalvalued Atanassov’s Intuitionistic Fuzzy Logic. The relationships among automorphism classes are formalized by the ϕ-representability theorem, passing from automorphisms to interval-valued intuitionistic automorphisms, also visiting other two ones, intuitionistic automorphisms and interval-valued automorphisms. Additionally, the ϕ-conjugate of an interval-valued Atanassov’s intuitionistic fuzzy negation can be obtained either from an interval-valued fuzzy negation or from an Atanassov’s intuitionistic fuzzy ne
APA, Harvard, Vancouver, ISO, and other styles
35

NEVELEV, A. B. "THE LOGICAL STRUCTURE OF VALUE: THE ENERGY COMPONENT." Bulletin of Chelyabinsk State University 491, no. 9 (2024): 86–91. https://doi.org/10.47475/1994-2796-2024-491-9-86-91.

Full text
Abstract:
Formal logic is limited to the objective side of human existence and thinking. In her view, a person is subjectively internalized and reduced, at best, to a relationship. More is not expected from formal logic. But in the history of philosophy and logic, in their main tradition, dating back to Aristotle, there is an opportunity to bring to consideration not only the subject, but also the activity, energy component. Human activity, for example, duplicates two subject aspects (elements) of the logical structure of the concept: the scope of the concept and the content of the concept. The objectiv
APA, Harvard, Vancouver, ISO, and other styles
36

Hamdi, Thouraya, Adel Ghith, and Faten Fayala. "Fuzzy Logic Method for Predicting the Effect of Main Fabric Parameters Influencing Drape Phenomenon." Autex Research Journal 20, no. 3 (2020): 220–27. http://dx.doi.org/10.2478/aut-2019-0034.

Full text
Abstract:
AbstractThe main aspect of this research was to predict the drape parameters and describe clearly the drape phenomenon using fuzzy logic method. Forecasting features allow manufacturers to save time and improve their productivity. The bending rigidity, (in warp, weft, and skew direction), shear rigidity, and weight of fabric samples were used as the key input variables for the model, whereas drape coefficient, drape distance ratio, folds depth index, and node number were used as output/response variables. The results show that changing the values of fabric parameters significantly affected the
APA, Harvard, Vancouver, ISO, and other styles
37

PAWLOWSKI, PAWEL, and RAFAL URBANIAK. "MANY-VALUED LOGIC OF INFORMAL PROVABILITY: A NON-DETERMINISTIC STRATEGY." Review of Symbolic Logic 11, no. 2 (2018): 207–23. http://dx.doi.org/10.1017/s1755020317000363.

Full text
Abstract:
AbstractMathematicians prove theorems in a semi-formal setting, providing what we’ll call informal proofs. There are various philosophical reasons not to reduce informal provability to formal provability within some appropriate axiomatic theory (Leitgeb, 2009; Marfori, 2010; Tanswell, 2015), but the main worry is that we seem committed to all instances of the so-called reflection schema: B(φ) → φ (where B stands for the informal provability predicate). Yet, adding all its instances to any theory for which Löb’s theorem for B holds leads to inconsistency.Currently existing approaches (Shapiro,
APA, Harvard, Vancouver, ISO, and other styles
38

Mintrop, Rick, Miguel Ordenes, Erin Coghlan, Laura Pryor, and Cristobal Madero. "Teacher Evaluation, Pay for Performance, and Learning Around Instruction: Between Dissonant Incentives and Resonant Procedures." Educational Administration Quarterly 54, no. 1 (2017): 3–46. http://dx.doi.org/10.1177/0013161x17696558.

Full text
Abstract:
Purpose: The study examines why the logic of a performance management system, supported by the federal Teacher Incentive Fund, might be faulty. It does this by exploring the nuances of the interplay between teaching evaluations as formative and summative, the use of procedures, tools, and artifacts obligated by the local Teacher Incentive Fund system, and bonus payments as extrinsic motivators. Research Methods: The study is a qualitative longitudinal study in three public charter schools that were selected as a presumably conducive environment for incentive-driven performance management. Eigh
APA, Harvard, Vancouver, ISO, and other styles
39

Frické, Martin. "Boolean Logic." KNOWLEDGE ORGANIZATION 48, no. 2 (2021): 177–91. http://dx.doi.org/10.5771/0943-7444-2021-2-177.

Full text
Abstract:
The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to know­ledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and logic gates, computer programming languages, probability theory
APA, Harvard, Vancouver, ISO, and other styles
40

Agati, Giuliano, Domenico Borello, Michele Vincenzo Migliarese Caputi, et al. "Effect of the Degree of Hybridization and Energy Management Strategy on the Performance of a Fuel Cell/Battery Vehicle in Real-World Driving Cycles." Energies 17, no. 3 (2024): 729. http://dx.doi.org/10.3390/en17030729.

Full text
Abstract:
The study utilizes open-access data to generate power demand curves for a hybrid automotive system, testing twelve configurations with three different energy management strategies and four values for the degree of hybridization (DOH), the latter representing the share of the total power of the vehicle powertrain supplied by the battery. The first control logic (Battery Main—BTM) uses mainly batteries to satisfy the power demand and fuel cells as backup, while in the other two controllers, fuel cells operate continuously (Fuel Cell Main—FCM) or within a fixed range (Fuel Cell Fixed—FCF) using b
APA, Harvard, Vancouver, ISO, and other styles
41

Шалак, В. И. "Some Remarks on A. Tamminga’s Paper “Correspondence Analysis for Strong Three-valued Logic”." Logical Investigations 23, no. 2 (2017): 96–97. http://dx.doi.org/10.21146/2074-1472-2017-23-2-96-97.

Full text
Abstract:
In this note we present two remarks to the A. Tamminga’s paper. The first remark relates to incorrect Definition 1, and the second remark relates to the main theorem of the paper. We propose the necessary corrections. DOI: 10.21146/2074-1472-2017-23-2-96-97
APA, Harvard, Vancouver, ISO, and other styles
42

GOODMAN, I. R., and H. T. NGUYEN. "MATHEMATICAL FOUNDATIONS OF CONDITIONALS AND THEIR PROBABILISTIC ASSIGNMENTS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 03, no. 03 (1995): 247–339. http://dx.doi.org/10.1142/s0218488595000165.

Full text
Abstract:
This paper addresses the mathematical modeling of information as originally expressed in natural language in conditional form. A number of different conditional event algebras—all avoiding the Lewis triviality result—are briefly surveyed, including the main body of those proposed previously, classified as Type I, and the newly expanded Type II product space approach (PS) originally independently offered by Van Fraasen. The issue of higher order conditionals and triviality is also discussed. In addition, this work considers two basic results of McGee: Firstly, this paper provides a new general
APA, Harvard, Vancouver, ISO, and other styles
43

Schang, Fabien. "The Football of Logic." Studia Humana 6, no. 1 (2017): 50–60. http://dx.doi.org/10.1515/sh-2017-0006.

Full text
Abstract:
Abstract An analogy is made between two rather different domains, namely: logic, and football (or soccer). Starting from a comparative table between the two activities, an alternative explanation of logic is given in terms of players, ball, goal, and the like. Our main thesis is that, just as the task of logic is preserving truth from premises to the conclusion, footballers strive to keep the ball as far as possible until the opposite goal. Assuming this analogy may help think about logic in the same way as in dialogical logic, but it should also present truth-values in an alternative sense of
APA, Harvard, Vancouver, ISO, and other styles
44

Ion, C. Baianu, Georgescu George, F. Glazebrook James, and Brown Ronald. "BRAIN Journal - Lukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems." Brain Journal 1, SPECIAL ISSUE ON COMPLEXITY IN SCIENCES AND ARTIFICIAL INTELLIGENCE (2010): 1–11. https://doi.org/10.5281/zenodo.1037321.

Full text
Abstract:
ABSTRACT The fundamentals of ÃLukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces [1]. Their next-state functions operate through transitions between quantum states defined by the quantum equations of motions in the Schr¨odinger representation, with both initial and boundary
APA, Harvard, Vancouver, ISO, and other styles
45

Moussa, Soumaya, Saoussen Bel Hadj Kacem, and Moncef Tagina. "Unification of Imprecise Data." International Journal of Fuzzy System Applications 11, no. 1 (2022): 1–27. http://dx.doi.org/10.4018/ijfsa.292459.

Full text
Abstract:
Inference systems are a well-defined technology derived from knowledge-based systems. Their main purpose is to model and manage knowledge as well as expert reasoning to insure a relevant decision making while getting close to human induction. Although handled knowledge are usually imperfect, they may be treated using a non classical logic as fuzzy logic or symbolic multi-valued logic. Nonetheless, it is required sometimes to consider both fuzzy and symbolic multi-valued knowledge within the same knowledge-based system. For that, we propose in this paper an approach that is able to standardize
APA, Harvard, Vancouver, ISO, and other styles
46

Tang, Yuyao. "An Optimized 4-bits Absolute Value Detector." Transactions on Computer Science and Intelligent Systems Research 5 (August 12, 2024): 345–54. http://dx.doi.org/10.62051/0jwh7s16.

Full text
Abstract:
The binary absolute value detector is crucial in today's computer domain, especially in computer storage and analysis systems. It ensures the integrity and accuracy of data. Therefore, this paper proposes an optimized design of a 4-bit absolute value detector aimed at finding the circuit with the lowest energy consumption. Firstly, this paper introduces a design different from the traditional absolute value calculator, resulting in a reduced total number of stages in the circuit. Secondly, this paper calculates the delay of the main path can be using the logic effort formula and determine the
APA, Harvard, Vancouver, ISO, and other styles
47

STÄRK, ROBERT F. "CUT-PROPERTY AND NEGATION AS FAILURE." International Journal of Foundations of Computer Science 05, no. 02 (1994): 129–64. http://dx.doi.org/10.1142/s0129054194000086.

Full text
Abstract:
What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A rule based sequent calculus is used in which a sequent is provable if, and only if, it is true in all three-valued models of the completion of a logic program. The main theorem is that proofs in the sequent calculus can be transformed into SLDNF-computations if, and only if, a program has the cut-property. A fragment of the sequent calculus leads to a sound and complete semantics for SLDNF-resolution with substitutions. It turns out that this version of SLDNF-resoluti
APA, Harvard, Vancouver, ISO, and other styles
48

Bogaerts, Bart, Maxime Jakubowski, and Jan Van den Bussche. "Postulates for Provenance: Instance-based provenance for first-order logic." Proceedings of the ACM on Management of Data 2, no. 2 (2024): 1–16. http://dx.doi.org/10.1145/3651596.

Full text
Abstract:
Instance-based provenance is an explanation for a query result in the form of a subinstance of the database. We investigate different desiderata one may want to impose on these subinstances. Concretely we consider seven basic postulates for provenance. Six of them relate subinstances to provenance polynomials, three-valued semantics, and Halpern-Pearl causality. Determinism of the provenance mechanism is the seventh basic postulate. Moreover, we consider the postulate of minimality, which can be imposed with respect to any set of basic postulates. Our main technical contribution is an analysis
APA, Harvard, Vancouver, ISO, and other styles
49

Iorgulescu, Afrodita. "Connections Between MVn Algebras and n-valued Lukasiewicz-Moisil Algebras - IV." JUCS - Journal of Universal Computer Science 6, no. (1) (2000): 139–54. https://doi.org/10.3217/jucs-006-01-0139.

Full text
Abstract:
We introduce two chains of unary operations in the MVn algebra of Revaz Grigolia; they will be used in establishing many connections between these algebras and n-valued Lukasiewicz-Moisil algebras (LMn algebras for short). The study has four parts. It is by and large self-contained. The main result of the first part is that MV4 algebras coincide with LM4 algebras. The larger class of ``relaxed''-MVn algebras is also introduced and studied. This class is related to the class of generalized LMn pre-algebras. The main results of the second part are that, for n 5, any MVn algebra is an LMn algebra
APA, Harvard, Vancouver, ISO, and other styles
50

Chotikunnan, Phichitphon, and Yutthana Pititheeraphab. "Adaptive P Control and Adaptive Fuzzy Logic Controller with Expert System Implementation for Robotic Manipulator Application." Journal of Robotics and Control (JRC) 4, no. 2 (2023): 217–26. http://dx.doi.org/10.18196/jrc.v4i2.17757.

Full text
Abstract:
This study aims to develop an expert system implementation of P controller and fuzzy logic controller to address issues related to improper control input estimation, which can arise from incorrect gain values or unsuitable rule-based designs. The research focuses on improving the control input adaptation by using an expert system to resolve the adjustment issues of the P controller and fuzzy logic controller. The methodology involves designing an expert system that captures error signals within the system and adjusts the gain to enhance the control input estimation from the main controller. In
APA, Harvard, Vancouver, ISO, and other styles
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!