Relevant bibliographies by topics / Mani valued logics

Academic literature on the topic 'Mani valued logics'

Author: Grafiati
Published: 10 March 2023

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

Select a source type:

Contents

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 (June 30, 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 (October 16, 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 (November 29, 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 paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively.
APA, Harvard, Vancouver, ISO, and other styles
4

Непейвода, Н. Н. "Formalization as the Immanent Part of Logical Solving." Logical Investigations 24, no. 1 (May 30, 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 formalization is a choice of a logic. The classical logic is usually the best one for a draft formalization. The given problem and peculiarities of the draft formalization could sometimes advise us to use some other logic. If axioms of the classical formalization have some restricted form this is often the advice to use temporal, modal or multi-valued logic. More precisely, if all binary predicates occur only in premises of implications then it is possible sometimes to replace a predicate classical formalization by a propositional modal or temporal in the appropriate logic. If all predicates are unary and some of them occur only in premises then the classical logic maybe can replaced by a more adequate multi-valued. This idea is inspired by using Rosser–Turkette operator $J_i$in the book [22]. If we are interested not in a bare proof but in construction it gives us it is often to transfer to an appropriate constructive logic. Its choice is directed by our main resource (time, real values, money or any other imaginable resource) and by other restrictions.Logics of different by their nature resources are mutually inconsistent (e.g. nilpotent logics of time and linear logics of money). Also it is shown by example how Arnold’s principle works in logic: too “precise” formalization often becomes less adequate than more “rough”. DOI: 10.21146/2074-1472-2018-24-1-129-145
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 mathematics, computer science, linguistics, jurisprudence, ethics and other fields of natural science and socio-humanitarian knowledge. The recently increased interest in non-classical logics is explained, first of all, by the fact that various philosophical, syntactic, semantic and metalogical problems that were previously discussed in the scientific community are being replaced by practical interests. The main source of such interest is their wide application in computer science, artificial intelligence and programming. The logic of causality is used in the interpretation of the concepts of "law of nature", "ontological necessity" and "determinism"; temporal modal logics - for modeling, specification and verification of software systems of logical control; logics with vector semantics, combining the features of fuzzy and para-contradictory logics - in solving problems of dynamic verification of production knowledge bases and expert systems.
APA, Harvard, Vancouver, ISO, and other styles
6

Trzęsicki, Kazimierz. "Indeterministic Temporal Logic." Studies in Logic, Grammar and Rhetoric 42, no. 1 (September 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 relation of accessibility between them.
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 (October 26, 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 ¬-paraconsistent conservative extensions of Gödel fuzzy logic, in which ¬ has several desired properties. This is followed by some results regarding the relations between the constructed logics.
APA, Harvard, Vancouver, ISO, and other styles
8

Kamide, Norihiro. "Inconsistency-Tolerant Multi-Agent Calculus." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 22, no. 06 (December 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 modified generalization of trilattice logics, which are known to be useful for expressing fine-grained truth-values in computer networks. The completeness, cut-elimination and decidability theorems for the proposed logic (or sequent calculus) are proved as the main results of this paper.
APA, Harvard, Vancouver, ISO, and other styles
9

Ono, Hiroakira, and Yuichi Komori. "Logics without the contraction rule." Journal of Symbolic Logic 50, no. 1 (March 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 promising tool in studying BCK-algebras. Using this method, considerable progress has been made since then (see, e.g., [8], [18], [27]).In this paper, we will study these logics more comprehensively. We notice here that the distributive lawdoes not hold necessarily in these logics. By adding some axioms (or initial sequents) and rules of inference to these basic logics, we can obtain a lot of interesting nonclassical logics such as Łukasiewicz's many-valued logics, relevant logics, the intuitionistic logic and logics related to BCK-algebras, which have been studied separately until now. Thus, our approach will give a uniform way of dealing with these logics. One of our two main tools in doing so is Gentzen-type formulation of logics in syntax, and the other is semantics defined by using partially ordered monoids.
APA, Harvard, Vancouver, ISO, and other styles
10

De Martino, Mario. "Promotion of Political Values through International Programs of Academic Mobility." RUDN Journal of Political Science 22, no. 2 (December 15, 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 academic mobility as a tool to promote values. The rationales of nation-states and international organizations to develop such programs of academic mobility can be very diverse (geopolitical, economic, and civic). The author described the main principles of each rationale (or logic), providing examples of existing educational programs adopted by countries or international organizations and how political values are promoted according to each logic. The boundaries between the four rationales described in the paper are not distinct and rigid. An educational program can respond at the same time to different logics, and the nation-states decide how to allocate resources to achieve specific results ascribable to a particular rationale. Although different rationales push nation-states and international organizations in promoting international programs of academic mobility, in all cases, such programs are instruments to promote political values.
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
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 `-Groups, i.e. lattice ordered abelian groups (Chapter 2); a functional representation (Chapter 3); the algebraic geometry of the variety of `-Groups with constants (Chapter 4). Part II A brief historical introduction of L ukasiewicz logic and its extensions is provided. It is showed: a functional representation via generalized states (Chapter 5); a non-linear model for MV-algebras and a detailed study of it, culminating in a categorical theorem (Chapter 6). Part III Applications to social choice theory and artificial neural network are presented. In particular: preferences will be related to vector lattices and their cones, recalling the relation between polynomials and cones studied in Chapter 4; multilayer perceptrons will be elements of non-linear models introduced in Chapter 6 and networks will take advantages from polynomial completeness, which is studied in Chapter 2. We are going to present: in Sections 1.2 and 1.3 all the considered structures, our approach to them and their (possible) applications; in Section 1.4 a focus on the representation theory for `-Groups and MV-algebras. Note that: algebraic geometry for `-Groups provides a modus operandi which turns out to be useful not only in theoretical field, but also in applications, opening (we hope) new perspectives and intuitions, as we made in this first approach to social theory; non-linear models here presented and their relation to neural networks seem to be very promising, giving both intuitive and formal approach to many concrete problems, for instance degenerative diseases or distorted signals. All these interesting topics will be studied in future works of the author. [edited by author]
Questa tesi, come l’attivit`a di ricerca dell’autore, `e dedicata a stabilire nuove connessioni e a rafforzare le relazioni ben consolidate tra diversi settori della matematica, attraverso strumenti logici. Sono considerate due principali logiche a piu` valori, logic of balance e L ukasiewicz logic; le loro strutture algebriche associate verranno studiate con strumenti diversi e queste tecniche saranno applicate nella teoria della scelta sociale e nelle reti neurali artificiali. La tesi `e strutturata in tre parti. Part I Viene introdotta la Logic of balance. Viene mostrato: la relazione con `-Groups, gruppi abeliani ordinati reticolarmente (Chapter 2); una rappresentazione funzionale (Chapter 3); geometria algebrica della variet`a degli `-Groups con costanti (Chapter 4). Part II Viene fornita una breve introduzione storica della logica di L ukasiewicz e delle sue estensioni. Viene mostrato: una rappresentazione funzionale tramite stati generalizzati (Chapter 5); Un modello non lineare per le MV-algebre e uno studio dettagliato di esso, culminando in un teorema categoriale (Chapter 6). Part III Sono presentate applicazioni alla teoria delle scelte sociali e delle rete neurali artificiali. In particolare: le preferenze saranno correlate ai reticoli vettoriali e ai loro coni, richiamando la relazione tra polinomi e coni studiati nel Capitolo 4; I multilayer perceptrons saranno elementi di modelli non lineari introdotti nel Capitolo 6 e le reti prenderanno vantaggi dalla completezza polinomiale, studiata nel Capitolo 2. La geometria algebrica per gli `-Groups fornisce un modus operandi che risulta utile non solo nel campo teorico, ma anche nelle applicazioni, aprendo (speriamo) nuove prospettive e intuizioni, come abbiamo fatto in questo primo approccio alla teoria sociale; I modelli non lineari qui presentati e la loro relazione con le reti neurali sembrano molto promettenti, offrendo un approccio intuitivo e formale a molti problemi concreti, ad esempio malattie degenerative o segnali distorti. Tutti questi argomenti saranno oggetto di studio in opere future dell’autore. [a cura dell'autore]
XV n.s. (XXIX)
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 betrayal of Hume and the plethora of paradoxes that have appeared in two-adic (binary normative operator), one-adic (unary normative operator), and zero-adic (constant normative operator) deontic systems, expressed in the traditions of von Wright, Kripke, and Anderson, respectively. My suggestion has two motivations: First, to rid the philosophical literature of its puzzles and second, to give Hume\'s Law a proper formalization. Exploring the issues related to this project also points to the idea that maybe we should re-engineer (e.g., further generalize) our classical calculus, which might involve the adoption of many-valued logics somewhere down the line.
Master of Arts
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 property: we have improved some previous works about this theme, by expanding the analysis to many extensions of the first-order version of MTL. Chapter 8 is dedicated to four different families of n-contractive axiomatic extensions of BL, analyzed in the propositional and in the first-order case: completeness, computational and arithmetical complexity, amalgamation and interpolation properties are studied. Finally, chapters 9 and 10 are about Nilpotent Minimum logic (NM, see [8]): in chapter 9 the sets of tautologies of some NM-chains (subalgebras of [0,1]_NM) are studied, compared and the problems of axiomatization and undecidability are tackled. Chapter 10, instead, concerns some logical and algebraic properties of (propositional) Nilpotent Minimum logic. The results (or an extended version of them) of these last chapters have been also presented in papers [1, 4, 5, 2, 3]. ---------------------------------References--------------------------------------------- [1] S. Aguzzoli, M. Bianchi, and V. Marra. A temporal semantics for Basic Logic. Studia Logica, 92(2), 147-162, 2009. doi:10.1007/s11225-009-9192-3. [2] M. Bianchi. First-order Nilpotent Minimum Logics: first steps. Submitted for publication,2010. [3] M. Bianchi. On some logical and algebraic properties of Nilpotent Minimum logic and its relation with Gödel logic. Submitted for publication, 2010. [4] M. Bianchi and F. Montagna. Supersound many-valued logics and Dedekind-MacNeille completions. Arch. Math. Log., 48(8), 719-736, 2009. doi:10.1007/s00153-009-0145-3. [5] M. Bianchi and F. Montagna. n-contractive BL-logics. Arch. Math. Log., 2010. doi:10.1007/s00153-010-0213-8. [6] P. Cintula, F. Esteva, J. Gispert, L. Godo, F. Montagna, and C. Noguera. Distinguished algebraic semantics for t-norm based fuzzy logics: methods and algebraic equivalencies. Ann. Pure Appl. Log., 160(1), 53-81, 2009. doi:10.1016/j.apal.2009.01.012. [7] P. Cintula and P. Hájek. Triangular norm predicate fuzzy logics. Fuzzy Sets Syst., 161(3), 311-346, 2010. doi:10.1016/j.fss.2009.09.006. [8] F. Esteva and L. Godo. Monoidal t-norm based logic: Towards a logic for left-continuous t-norms. Fuzzy sets Syst., 124(3), 271-288, 2001. doi:10.1016/S0165-0114(01)00098-7. [9] P. Hájek. Metamathematics of Fuzzy Logic, volume 4 of Trends in Logic. Kluwer Academic Publishers, paperback edition, 1998. ISBN:9781402003707.
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 digital circuits. The main obstacles in these applications were, up to now, memory requirements for computer systems and lack of the possibility of calculating spectra directly from Boolean equations. By using the algorithms presented here these obstacles have been overcome. Moreover, the methods presented in this dissertation can be regarded as representatives of a whole family of methods and the approach presented can be easily adapted to other orthogonal transforms used in digital logic design. Algorithms are shown for Adding, Arithmetic, and Reed-Muller transforms. However, the main focus of this dissertation is on the efficient computer calculation of Rademacher-Walsh spectra of Boolean functions, since this particular ordering of Walsh transforms is most frequently used in digital logic design. A theory has been developed to calculate the Rademacher-Walsh transform from a cube array specification of incompletely specified Boolean functions. The importance of representing Boolean functions as arrays of disjoint ON- and DC- cubes has been pointed out, and an efficient new algorithm to generate disjoint cubes from non-disjoint ones has been designed. The transform algorithm makes use of the properties of an array of disjoint cubes and allows the determination of the spectral coefficients in an independent way. By such an approach each spectral coefficient can be calculated separately or all the coefficients can be calculated in parallel. These advantages are absent in the existing methods. The possibility of calculating only some coefficients is very important since there are many spectral methods in digital logic design for which the values of only a few selected coefficients are needed. Most of the current methods used in the spectral domain deal only with completely specified Boolean functions. On the other hand, all of the algorithms introduced here are valid, not only for completely specified Boolean functions, but for functions with don't cares. Don't care minterms are simply represented in the form of disjoint cubes. The links between spectral and classical methods used for designing digital circuits are described. The real meaning of spectral coefficients from Walsh and other orthogonal spectra in classical logic terms is shown. The relations presented here can be used for the calculation of different transforms. The methods are based on direct manipulations on Karnaugh maps. The conversion start with Karnaugh maps and generate the spectral coefficients. The spectral representation of multiple-valued input binary functions is proposed here for the first time. Such a representation is composed of a vector of Walsh transforms each vector is defined for one pair of the input variables of the function. The new representation has the advantage of being real-valued, thus having an easy interpretation. Since two types of codings of values of binary functions are used, two different spectra are introduced. The meaning of each spectral coefficient in classical logic terms is discussed. The mathematical relationships between the number of true, false, and don't care minterms and spectral coefficients are stated. These relationships can be used to calculate the spectral coefficients directly from the graphical representations of binary functions. Similarly to the spectral methods in classical logic design, the new spectral representation of binary functions can find applications in many problems of analysis, synthesis, and testing of circuits described by such functions. A new algorithm is shown that converts the disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm that generates the GRME, based on the factorization of the Reed-Muller transform matrix, always starts from the truth table (minterms) of a Boolean function, then the described method has advantages due to a smaller required computer memory. Moreover, for Boolean functions, described by only a few disjoint cubes, the method is much more efficient than the fast algorithm. By investigating a family of elementary second order matrices, new transforms of real vectors are introduced. When used for Boolean function transformations, these transforms are one-to-one mappings in a binary or ternary vector space. The concept of different polarities of the Arithmetic and Adding transforms has been introduced. New operations on matrices: horizontal, vertical, and vertical-horizontal joints (concatenations) are introduced. All previously known transforms, and those introduced in this dissertation can be characterized by two features: "ordering" and "polarity". When a transform exists for all possible polarities then it is said to be "generalized". For all of the transforms discussed, procedures are given for generalizing and defining for different orderings. The meaning of each spectral coefficient for a given transform is also presented in terms of standard logic gates. There exist six commonly used orderings of Walsh transforms: Hadamard, Rademacher, Kaczmarz, Paley, Cal-Sal, and X. By investigating the ways in which these known orderings are generated the author noticed that the same operations can be used to create some new orderings. The generation of two new Walsh transforms in Gray code orderings, from the straight binary code is shown. A recursive algorithm for the Gray code ordered Walsh transform is based on the new operator introduced in this presentation under the name of the "bi-symmetrical pseudo Kronecker product". The recursive algorithm is the basis for the flow diagram of a constant geometry fast Walsh transform in Gray code ordering. The algorithm is fast (N 10g2N additions/subtractions), computer efficient, and is implemented
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 the partiality of their operations cause things to be vastly more complicated than their totally defined classical analogues. In the final chapter, we discuss coordinatization of MV algebras and prove some new theorems and construct some new concrete examples, connecting these structures up (requiring a detour through effect algebras!) to boolean inverse semigroups.
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 spectral dualities between the varieties of algebras corresponding to RDP logic and NMG logic, and suitable defined combinatorial categories. Categorical dualities allow to give algorithmic construction of products in the dual categories obtaining computable descriptions of coproducts (which are notoriously hard to compute working only in the algebraic side) for the corresponding finite algebras. As a byproduct, representation theorems for finite algebras and free finitely generated algebras in the considered varieties are obtained. This latter characterization is especially useful to provide explicit construction of a number of objects relevant from the point of view of the logical interpretation of the varieties of algebras: normal forms, strongest deductive interpolants and most general unifiers.
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). The error detection unit is also constructed in a reversible manner, which results in an overall circuit which meets the requirements of reversible computing. We have also proposed an upgrade of the initial design to make the design more optimized. Several ternary benchmark circuits have been implemented using the proposed approaches. The number of gates required to implement the benchmarks for each approach have also been compared. To our knowledge this is the first such circuit in ternary with integrated online testability feature.
xii, 92 leaves : ill. ; 29 cm
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:

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-valued logic programming involving an extended notion of terms.

As a first step a concept for generalised terms has been studied. A generalised term is given by a composition of monads that again yields a monad, i.e. compositions of powerset monads with the term monad provide definitions for generalised terms. A composition of monads does, however, not always produce a monad. In this sense, techniques for monads composition provide a helpful tool for our concerns and therefore the study of these techniques has been a focus of this research.

The composition of monads make use of a lot of equations. Proofs become complicated, not to mention the challenge of understanding different steps of the equations. In this respect, we have studied visual techniques and show how a graphical approach can provide the support we need.

For the purpose of many-valued unification, similarity relations, generalised substitutions and unifiers have been defined for generalised terms.

APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Mani valued logics"

1

Malinowski, Grzegorz. Many-valued logics. Oxford [England]: Clarendon Press, 1993.

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

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

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

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

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

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

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

Jianquan, Ouyang, ed. Duo zhi luo ji han shu jie gou li lun yan jiu. Beijing: Ke xue chu ban she, 2010.

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

Duo zhi luo ji de fang fa he li lun: Fei zheng gui duo zhi luo ji yan jiu. Beijing: Ke xue chu ban she, 2009.

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

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

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

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

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

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

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

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

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, 231–54. Berlin, Heidelberg: 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, 209–30. Berlin, Heidelberg: 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, 1–21. Berlin, Heidelberg: 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, 23–61. Berlin, Heidelberg: 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, 63–77. Berlin, Heidelberg: 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, 79–94. Berlin, Heidelberg: 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, 95–103. Berlin, Heidelberg: 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, 105–22. Berlin, Heidelberg: 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, 123–41. Berlin, Heidelberg: 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, 143–207. Berlin, Heidelberg: 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

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}. California: 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 partial knowledge about propositions, which leads to six truth values. We impose rationality conditions on the semantics of the connectives of the propositional logic, and prove that Kleene's logic is the maximal sublogic to which the standard optimization rules apply, thereby justifying this design choice. For extensions to predicate logic, however, we show that the additional truth values are not necessary: every many-valued extension of first-order logic over databases with incomplete information represented by null values is no more powerful than the usual two-valued logic with the standard Boolean interpretation of the connectives. We use this observation to analyze the logic underlying SQL query evaluation, and conclude that the many-valued extension for handling incompleteness does not add any expressiveness to it.
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

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
4

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}. California: 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>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 costs of actions, and as a framework for certain graded description logics with transitive closure of roles. Generalizing techniques used in the case of PDL we obtain completeness and decidability results for all PDŁn. A generalization of Pratt's exponential-time algorithm for checking validity of formulas is given and EXPTIME-hardness of each PDŁn validity problem is established by embedding PDL into PDŁn.
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

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
7

Eklund, Patrik, and Magnus Löfstrand. "Many-valued logic in manufacturing." In 2016 Federated Conference on Computer Science and Information Systems. PTI, 2016. http://dx.doi.org/10.15439/2016f73.

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

Ferguson, Thomas Macaulay. "Non-Deterministic Many-Valued Modal Logic." In 2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2022. http://dx.doi.org/10.1109/ismvl52857.2022.00023.

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

Ferguson, Thomas Macaulay. "Lukasiewicz Negation and Many-Valued Extensions of Constructive Logics." In 2014 IEEE 44th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2014. http://dx.doi.org/10.1109/ismvl.2014.29.

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

Argelich, Josep, Chu Min Li, and Felip Manya. "Exploiting Many-Valued Variables in MaxSAT." In 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2017. http://dx.doi.org/10.1109/ismvl.2017.42.

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, July 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 precisely, we show that, for the description logic ALE (which allows for conjunction, universal value restrictions, existential restrictions, negation of atomic concepts) the msc of an ABox-individual only exists in case of acyclic ABoxes. For cyclic ABoxes, we show how to compute an approximation of the msc. Our approach for computing the (approximation of the) msc is based on representing concept descriptions by certain trees and ABoxes by certain graphs, and then characterizing instance relationships by homomorphisms from trees into graphs. The msc/approximation operation then mainly corresponds to unraveling the graphs into trees and translating them back into concept descriptions.
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 number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
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 number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
APA, Harvard, Vancouver, ISO, and other styles
6

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 existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).
APA, Harvard, Vancouver, ISO, and other styles
7

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 existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).
APA, Harvard, Vancouver, ISO, and other styles
8

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 historically established systems - individualism and conciliarism (collectivism) are considered in the form of complement, not contradictory. We are only talking about their ratio and the degree of demand. At the same time, the state and society, and not “personal law”, are of decisive importance.
APA, Harvard, Vancouver, ISO, and other styles
9

McKenna, Patrick, and Mark Evans. Emergency Relief and complex service delivery: Towards better outcomes. Queensland University of Technology, June 2021. http://dx.doi.org/10.5204/rep.eprints.211133.

Full text
Abstract:
Emergency Relief (ER) is a Department of Social Services (DSS) funded program, delivered by 197 community organisations (ER Providers) across Australia, to assist people facing a financial crisis with financial/material aid and referrals to other support programs. ER has been playing this important role in Australian communities since 1979. Without ER, more people living in Australia who experience a financial crisis might face further harm such as crippling debt or homelessness. The Emergency Relief National Coordination Group (NCG) was established in April 2020 at the start of the COVID-19 pandemic to advise the Minister for Families and Social Services on the implementation of ER. To inform its advice to the Minister, the NCG partnered with the Institute for Governance at the University of Canberra to conduct research to understand the issues and challenges faced by ER Providers and Service Users in local contexts across Australia. The research involved a desktop review of the existing literature on ER service provision, a large survey which all Commonwealth ER Providers were invited to participate in (and 122 responses were received), interviews with a purposive sample of 18 ER Providers, and the development of a program logic and theory of change for the Commonwealth ER program to assess progress. The surveys and interviews focussed on ER Provider perceptions of the strengths, weaknesses, future challenges, and areas of improvement for current ER provision. The trend of increasing case complexity, the effectiveness of ER service delivery models in achieving outcomes for Service Users, and the significance of volunteering in the sector were investigated. Separately, an evaluation of the performance of the NCG was conducted and a summary of the evaluation is provided as an appendix to this report. Several themes emerged from the review of the existing literature such as service delivery shortcomings in dealing with case complexity, the effectiveness of case management, and repeat requests for service. Interviews with ER workers and Service Users found that an uplift in workforce capability was required to deal with increasing case complexity, leading to recommendations for more training and service standards. Several service evaluations found that ER delivered with case management led to high Service User satisfaction, played an integral role in transforming the lives of people with complex needs, and lowered repeat requests for service. A large longitudinal quantitative study revealed that more time spent with participants substantially decreased the number of repeat requests for service; and, given that repeat requests for service can be an indicator of entrenched poverty, not accessing further services is likely to suggest improvement. The interviews identified the main strengths of ER to be the rapid response and flexible use of funds to stabilise crisis situations and connect people to other supports through strong local networks. Service Users trusted the system because of these strengths, and ER was often an access point to holistic support. There were three main weaknesses identified. First, funding contracts were too short and did not cover the full costs of the program—in particular, case management for complex cases. Second, many Service Users were dependent on ER which was inconsistent with the definition and intent of the program. Third, there was inconsistency in the level of service received by Service Users in different geographic locations. These weaknesses can be improved upon with a joined-up approach featuring co-design and collaborative governance, leading to the successful commissioning of social services. The survey confirmed that volunteers were significant for ER, making up 92% of all workers and 51% of all hours worked in respondent ER programs. Of the 122 respondents, volunteers amounted to 554 full-time equivalents, a contribution valued at $39.4 million. In total there were 8,316 volunteers working in the 122 respondent ER programs. The sector can support and upskill these volunteers (and employees in addition) by developing scalable training solutions such as online training modules, updating ER service standards, and engaging in collaborative learning arrangements where large and small ER Providers share resources. More engagement with peak bodies such as Volunteering Australia might also assist the sector to improve the focus on volunteer engagement. Integrated services achieve better outcomes for complex ER cases—97% of survey respondents either agreed or strongly agreed this was the case. The research identified the dimensions of service integration most relevant to ER Providers to be case management, referrals, the breadth of services offered internally, co-location with interrelated service providers, an established network of support, workforce capability, and Service User engagement. Providers can individually focus on increasing the level of service integration for their ER program to improve their ability to deal with complex cases, which are clearly on the rise. At the system level, a more joined-up approach can also improve service integration across Australia. The key dimensions of this finding are discussed next in more detail. Case management is key for achieving Service User outcomes for complex cases—89% of survey respondents either agreed or strongly agreed this was the case. Interviewees most frequently said they would provide more case management if they could change their service model. Case management allows for more time spent with the Service User, follow up with referral partners, and a higher level of expertise in service delivery to support complex cases. Of course, it is a costly model and not currently funded for all Service Users through ER. Where case management is not available as part of ER, it might be available through a related service that is part of a network of support. Where possible, ER Providers should facilitate access to case management for Service Users who would benefit. At a system level, ER models with a greater component of case management could be implemented as test cases. Referral systems are also key for achieving Service User outcomes, which is reflected in the ER Program Logic presented on page 31. The survey and interview data show that referrals within an integrated service (internal) or in a service hub (co-located) are most effective. Where this is not possible, warm referrals within a trusted network of support are more effective than cold referrals leading to higher take-up and beneficial Service User outcomes. However, cold referrals are most common, pointing to a weakness in ER referral systems. This is because ER Providers do not operate or co-locate with interrelated services in many cases, nor do they have the case management capacity to provide warm referrals in many other cases. For mental illness support, which interviewees identified as one of the most difficult issues to deal with, ER Providers offer an integrated service only 23% of the time, warm referrals 34% of the time, and cold referrals 43% of the time. A focus on referral systems at the individual ER Provider level, and system level through a joined-up approach, might lead to better outcomes for Service Users. The program logic and theory of change for ER have been documented with input from the research findings and included in Section 4.3 on page 31. These show that ER helps people facing a financial crisis to meet their immediate needs, avoid further harm, and access a path to recovery. The research demonstrates that ER is fundamental to supporting vulnerable people in Australia and should therefore continue to be funded by government.
APA, Harvard, Vancouver, ISO, and other styles
10

Bano, Masooda, and Daniel Dyonisius. Community-Responsive Education Policies and the Question of Optimality: Decentralisation and District-Level Variation in Policy Adoption and Implementation in Indonesia. Research on Improving Systems of Education (RISE), August 2022. http://dx.doi.org/10.35489/bsg-rise-wp_2022/108.

Full text
Abstract:
Decentralisation, or devolving authority to the third tier of government to prioritise specific policy reforms and manage their implementation, is argued to lead to pro-poor development for a number of reasons: local bureaucrats can better gauge the local needs, be responsive to community demands, and, due to physical proximity, can be more easily held accountable by community members. In the education sector, devolving authority to district government has thus been seen as critical to introducing reforms aimed at increasing access and improving learning outcomes. Based on fieldwork with district-level education bureaucracies, schools, and communities in two districts in the state of West Java in Indonesia, this article shows that decentralisation has indeed led to community-responsive policy-development in Indonesia. The district-level education bureaucracies in both districts did appear to prioritise community preferences when choosing to prioritise specific educational reforms from among many introduced by the national government. However, the optimality of these preferences could be questioned. The prioritised policies are reflective of cultural and religious values or immediate employment considerations of the communities in the two districts, rather than being explicitly focused on improving learning outcomes: the urban district prioritised degree completion, while the rural district prioritised moral education. These preferences might appear sub-optimal if the preference is for education bureaucracies to focus directly on improving literacy and numeracy outcomes. Yet, taking into account the socio-economic context of each district, it becomes easy to see the logic dictating these preferences: the communities and the district government officials are consciously prioritising those education policies for which they foresee direct payoffs. Since improving learning outcomes requires long-term commitment, it appears rational to focus on policies promising more immediate gains, especially when they aim, indirectly and implicitly, to improve actual learning outcomes. Thus, more effective community mobilisation campaigns can be developed if the donor agencies funding them recognise that it is not necessarily the lack of information but the nature of the local incentive structures that shapes communities’ expectations of education. Overall, decentralisation is leading to more context-specific educational policy prioritisation in Indonesia, resulting in the possibility of significant district-level variation in outcomes. Further, looking at the school-level variation in each district, the paper shows that public schools ranked as high performing had students from more privileged socio-economic backgrounds and were catering for communities that had more financial resources to support activities in the school, compared with schools ranked as low performing. Thus, there is a gap to bridge within public schools and not just between public and private schools.
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