Relevant bibliographies by topics / Truth-functions

Contents

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

Academic literature on the topic 'Truth-functions'

Author: Grafiati
Published: 4 June 2021
Last updated: 24 February 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Truth-functions.'

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 "Truth-functions"

1

Fichot, Jean. "Truth, Proofs and Functions." Synthese 137, no. 1/2 (November 2003): 43–58. http://dx.doi.org/10.1023/a:1026274716840.

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

Scanlan, Michael. "Wittgenstein, Truth-Functions, and Generality." Journal of Philosophical Research 20 (1995): 175–93. http://dx.doi.org/10.5840/jpr_1995_27.

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

Mughazy, Mustafa. "Metalinguistic negation and truth functions." Journal of Pragmatics 35, no. 8 (August 2003): 1143–60. http://dx.doi.org/10.1016/s0378-2166(02)00177-7.

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

Leblanc, Hugues. "On Characterizing Unary Probability Functions and Truth-Value Functions." Canadian Journal of Philosophy 15, no. 1 (March 1985): 19–24. http://dx.doi.org/10.1080/00455091.1985.10716406.

Full text
Abstract:
Consider a language SL having as its primitive signs one or more atomic statements, the two connectives ‘∼’ and ‘&,’ and the two parentheses ‘(’ and ‘)’; and presume the extra connectives ‘V’ and ‘≡’ defined in the customary manner. With the statements of SL substituting for sets, and the three connectives ‘∼,’ ‘&,’and ‘V’ substituting for the complementation, intersection, and union signs, the constraints that Kolmogorov places in [1] on (unary) probability functions come to read:K1. 0 ≤ P(A),K2. P(∼(A & ∼A)) = 1,K3. If ⊦ ∼(A & B), then P(A ∨ B) = P(A) + P(B),K4. If ⊦ A ≡ B, then P(A) = P(B).2
APA, Harvard, Vancouver, ISO, and other styles
5

ALTUNAY, DERYA, and TURHAN ÇİFTÇİBAŞI. "DECOMPOSITION OF MULTIUNIVERSE FUZZY TRUTH FUNCTIONS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 09, no. 05 (October 2001): 623–43. http://dx.doi.org/10.1142/s0218488501001095.

Full text
Abstract:
This paper focuses on the decomposition problem of fuzzy relations using the concepts of multiuniverse fuzzy propositional logic. Given two fuzzy propositions in different universes, it is always possible to construct a fuzzy relation in the common universe through a prescribed combination. However, the converse is not so obvious, if possible at all. In other words, given a fuzzy relation, how would we know if it really represents a certain relationship between some fuzzy propositions? It is important to recognize whether the given fuzzy relation is a meaningful representation of information according to certain criteria applicable to some fuzzy propositions that constitute the fuzzy relation itself. Two basic structures of decomposition are investigated. Necessary and sufficient conditions for decomposition of multiuniverse fuzzy truth functions in terms of one-universe truth functions are presented. An algorithm for decomposition is proposed.
APA, Harvard, Vancouver, ISO, and other styles
6

Lu, Chenguang. "Using the Semantic Information G Measure to Explain and Extend Rate-Distortion Functions and Maximum Entropy Distributions." Entropy 23, no. 8 (August 15, 2021): 1050. http://dx.doi.org/10.3390/e23081050.

Full text
Abstract:
In the rate-distortion function and the Maximum Entropy (ME) method, Minimum Mutual Information (MMI) distributions and ME distributions are expressed by Bayes-like formulas, including Negative Exponential Functions (NEFs) and partition functions. Why do these non-probability functions exist in Bayes-like formulas? On the other hand, the rate-distortion function has three disadvantages: (1) the distortion function is subjectively defined; (2) the definition of the distortion function between instances and labels is often difficult; (3) it cannot be used for data compression according to the labels’ semantic meanings. The author has proposed using the semantic information G measure with both statistical probability and logical probability before. We can now explain NEFs as truth functions, partition functions as logical probabilities, Bayes-like formulas as semantic Bayes’ formulas, MMI as Semantic Mutual Information (SMI), and ME as extreme ME minus SMI. In overcoming the above disadvantages, this paper sets up the relationship between truth functions and distortion functions, obtains truth functions from samples by machine learning, and constructs constraint conditions with truth functions to extend rate-distortion functions. Two examples are used to help readers understand the MMI iteration and to support the theoretical results. Using truth functions and the semantic information G measure, we can combine machine learning and data compression, including semantic compression. We need further studies to explore general data compression and recovery, according to the semantic meaning.
APA, Harvard, Vancouver, ISO, and other styles
7

Hintikka, Jaakko. "Truth Definitions, Skolem Functions and Axiomatic Set Theory." Bulletin of Symbolic Logic 4, no. 3 (September 1998): 303–37. http://dx.doi.org/10.2307/421033.

Full text
Abstract:
§1. The mission of axiomatic set theory. What is set theory needed for in the foundations of mathematics? Why cannot we transact whatever foundational business we have to transact in terms of our ordinary logic without resorting to set theory? There are many possible answers, but most of them are likely to be variations of the same theme. The core area of ordinary logic is by a fairly common consent the received first-order logic. Why cannot it take care of itself? What is it that it cannot do? A large part of every answer is probably that first-order logic cannot handle its own model theory and other metatheory. For instance, a first-order language does not allow the codification of the most important semantical concept, viz. the notion of truth, for that language in that language itself, as shown already in Tarski (1935). In view of such negative results it is generally thought that one of the most important missions of set theory is to provide the wherewithal for a model theory of logic. For instance Gregory H. Moore (1994, p. 635) asserts in his encyclopedia article “Logic and set theory” thatSet theory influenced logic, both through its semantics, by expanding the possible models of various theories and by the formal definition of a model; and through its syntax, by allowing for logical languages in which formulas can be infinite in length or in which the number of symbols is uncountable.
APA, Harvard, Vancouver, ISO, and other styles
8

Ozelim, Luan Carlos de Sena Monteiro, and Andre Luis Brasil Cavalcante. "The Iota-Delta Function as an Alternative to Boolean Formalism." International Journal of Foundations of Computer Science 29, no. 03 (April 2018): 415–23. http://dx.doi.org/10.1142/s0129054118500120.

Full text
Abstract:
Representing binary truth tables is an easy task to Boolean functions. When the number of Boolean variables increases, the complexity of the Boolean functions also increases. Thus, alternative ways of representing binary truth tables are necessary. It is known that this can be accomplished by means of other approaches, such as real polynomials. In the present paper it is shown that the recently introduced iota-delta function can be used to represent every binary truth table.
APA, Harvard, Vancouver, ISO, and other styles
9

Gomathisankaran, Mahadevan, and Akhilesh Tyagi. "Relating Boolean gate truth tables to one-way functions." Integrated Computer-Aided Engineering 16, no. 2 (March 20, 2009): 141–50. http://dx.doi.org/10.3233/ica-2009-0307.

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

Pollard, Stephen. "The Expressive Unary Truth Functions of n-valued Logic." Notre Dame Journal of Formal Logic 46, no. 1 (January 2005): 93–105. http://dx.doi.org/10.1305/ndjfl/1107220676.

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

Dissertations / Theses on the topic "Truth-functions"

1

Avendano, Diego de Souza. "O ocaso da noção de combinatória do Tractatus." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/6763.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2017-01-19T10:20:09Z No. of bitstreams: 2 Dissertação - Diego de Souza Avendano - 2016.pdf: 2770544 bytes, checksum: 621a0eef262e3cc91e4fab9e3a64f74a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-01-19T10:21:18Z (GMT) No. of bitstreams: 2 Dissertação - Diego de Souza Avendano - 2016.pdf: 2770544 bytes, checksum: 621a0eef262e3cc91e4fab9e3a64f74a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-01-19T10:21:18Z (GMT). No. of bitstreams: 2 Dissertação - Diego de Souza Avendano - 2016.pdf: 2770544 bytes, checksum: 621a0eef262e3cc91e4fab9e3a64f74a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-11-21
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
The aim of this dissertation is outline the course by which the concept of rule "arises" in Wittgenstein's thought. I shall consider that the origin of the approach to the concept of "rule" lies in the rapid development of the author's thinking between 1929-1934. His immediate problem was to remedy the glaring error, presented by Ramsey, on the Tractarian remarks about the logical necessity. In order to correct this error, Wittgenstein introduces two major innovations with which he believes that can solve the problem and still preserve the rigid tractarian demarcation between logical truth and empirical truth. First, he will replace the combinatorial model underlying the natural language that prevailed in the Tractatus by a conception which he describes as a system of propositions (Satzsysteme), in which language would be considered as a complex system of autonomous propositional calculi. This change make possible preserves the thesis that all necessity is a logical necessity, however, it will be necessary to abandon the referential conception of meaning and the logical independence of elementary propositions. Thus, our proposal in this dissertation is to establish all aspects of the Tractarian philosophy that precede and sustain the proposal of language as correspondence, emphasizing that the abandonment shall result in changes such as: 1) a word has its meaning only in the context of its propositional system; 2) the meaning of any word is the totality of the rules governing its use in this system; 3) The meaning of a proposition is the method of its verification. Finally, in order to understand the context of these changes, it seems to be the case, that in one hand, we need to establish the essence and general form of the proposition in the Tractatus, and thereby elucidate some aspects of what are the essential traits of language and the world; On the other, to establish the limits and the scope of analysis, so we can understand its mutation outlined in accordance with the new criterion of sense – the rules – since what counts as the object of analysis will not be determined by a general form, but displayed by a “possible calculus”.
Em minha dissertação buscarei esboçar o percurso pelo qual o conceito de regra “surge” no pensamento de Wittgenstein. Irei considerar que a origem da abordagem do conceito de “regra” encontra-se no rápido desenvolvimento do pensamento do autor entre 1929 – 1934. Nesta época, seu problema imediato era remediar o erro das considerações Tractarianas acerca da necessidade lógica apresentado por Ramsey. Para corrigir este erro, Wittgenstein introduz duas inovações com as quais ele acredita poder resolver o problema e, ainda, preservar a rígida demarcação tractariana entre verdade lógica e verdade empírica. Primeiro, ele irá substituir o modelo único de cálculo subjacente à linguagem natural que imperava no Tractatus por uma concepção que ele descrever como sistema de proposições (Satzsysteme), no qual a linguagem seria vista como um complexo emaranhado de sistemas proposicionais autônomos, cada qual constituindo um espaço lógico distinto. Desta maneira, ele preserva a tese de que toda necessidade é uma necessidade lógica, contudo, será preciso abandonar a concepção referencial de significado e a independência lógica das proposições elementares. Assim, nossa proposta nesta dissertação é estabelecer todos os aspectos da filosofia do Tractatus que antecedem e fundamentam a proposta da linguagem enquanto correspondência, enfatizando que o abandono desta última resulta em mudanças como: 1) uma palavra só tem significado no contexto do seu sistema proposicional; 2) o significado de uma palavra qualquer é a totalidade das regras que governam seu uso neste sistema; 3) o sentido de uma proposição é o método de sua verificação. Por fim, para que possamos compreender o contexto dessas mudanças, parece ser o caso de, por um lado, estabelecer a essência e a forma geral da proposição no Tractatus e, com isso, elucidar alguns aspectos do que, segundo o autor, são traços essências da linguagem e do mundo; por outro, estabelecer os limites do âmbito da análise, para que possamos compreender a sua mutação esboçada em conformidade com o novo critério do sentido, as regras, pois o que conta como objeto de análise será menos determinado por uma forma geral e mais exibido por um “cálculo” possível.
APA, Harvard, Vancouver, ISO, and other styles
2

CHO, Ming-Ko, and 卓旻科. "Reconstructing Cell Functions from Sequential Truth Tables Using Pattern Matching and Symmetries." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/65156231585544963114.

Full text
Abstract:
碩士
國立臺灣大學
電機工程學研究所
104
Unknown value (Xs) may exist in a design due to uninitialized registers or blocks that are powered down. Such Xs may cause X bugs known as X-pessimism and X-optimism. When we are solving X-pessimism problems, we have to trace along the fan-ins of a register''s input. By reconstructing cell functions, the procedure above will get extra information of the cells encountered and thus can reduce its search space. To analyze the cell properly and provide the exact cell functions information, we proposed a methodology including pattern matching and symmetry detecting techniques which reveals the functional information about SUDP inputs. Our experimental results on commercial designs show that the proposed method is effective and efficient.
APA, Harvard, Vancouver, ISO, and other styles
3

Wilson, Maria Marshall. "The use of null values in a relational database to represent incomplete and inapplicable information." 1985. http://hdl.handle.net/2097/27590.

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

Jodłowski, Jan. "Zasada prawdy materialnej i jej ograniczenia w postępowaniu karnym w perspektywie funkcji prawa karnego." Praca doktorska, 2014. https://ruj.uj.edu.pl/xmlui/handle/item/55307.

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

Books on the topic "Truth-functions"

1

Nørreklit, Lennart. Formale strukturer i den sociale logik: Et studie i udsagnslogik. Aalborg, Denmark: Aalborg universitetsforlag, 1987.

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

Desire and truth: Functions of plot in eighteenth-century English novels. Chicago: University of Chicago Press, 1990.

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

Emiliani, Alessandro. Significati e verità dei linguaggi delle teorie deduttive. Milano: F. Angeli, 1990.

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

Smith, Elwood H., 1941- illustrator, ed. Truth about poop and pee: All the facts on the ins and outs of bodily functions. New York: Puffin Books, 2014.

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

Faris, J. A. Truth-Functional Logic. Taylor & Francis Group, 2019.

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

Faris, J. A. Truth-Functional Logic. Taylor & Francis Group, 2019.

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

Faris, J. A. Truth-Functional Logic. Taylor & Francis Group, 2021.

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

Truth-Functional Logic. Taylor & Francis Group, 2019.

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

Spacks, Patricia Meyer. Desire and Truth: Functions of Plot in Eighteenth-Century English Novels. University Of Chicago Press, 1994.

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

Segal, Gabriel. Truth and Meaning. Edited by Ernest Lepore and Barry C. Smith. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780199552238.003.0009.

Full text
Abstract:
This article says something about previous work related to truth and meaning, goes on to discuss Davidson (1967) and related papers of his, and then discusses some issues arising. It begins with the work of Gottlob Frege. Much work in the twentieth century developed Frege's ideas. A great deal of that work continued with the assumption that semantics is fundamentally concerned with the assignments of entities (objects, sets, functions, and truth-values) to expressions. So, for example, those who tried to develop a formal account of sense did so by treating senses as functions of various kinds; the sense of a predicate, for example, was often seen as a function from possible worlds to extensions.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Truth-functions"

1

Martin, Norman M., and Stephen Pollard. "Truth Functions." In Closure Spaces and Logic, 205–24. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-2506-3_9.

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

Campbell, Richard. "The Functions Truth Serves." In The Concept of Truth, 45–61. London: Palgrave Macmillan UK, 2011. http://dx.doi.org/10.1057/9780230307803_3.

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

Pokorný, Pavel, and Daniel Ševčík. "An Application for Solving Truth Functions." In Intelligent Algorithms in Software Engineering, 341–51. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51965-0_30.

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

Sandu, Gabriel. "The Dependence and Independence of Quantifiers: Truth, Proof and Choice Functions." In The History and Philosophy of Polish Logic, 49–72. London: Palgrave Macmillan UK, 2014. http://dx.doi.org/10.1057/9781137030894_3.

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

Jain, Akshay, Tianqi Jiang, and James M. Keller. "Impact of the Shape of Membership Functions on the Truth Values of Linguistic Protoform Summaries." In Information Processing and Management of Uncertainty in Knowledge-Based Systems, 204–13. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40596-4_18.

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

Fletcher, Peter. "Calculus of Proof Functions." In Truth, Proof and Infinity, 323–25. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-3616-9_28.

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

Fletcher, Peter. "Second-Order Calculus of Proof Functions." In Truth, Proof and Infinity, 415–16. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-3616-9_42.

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

Fletcher, Peter. "From Logic to the Calculus of Proof Functions." In Truth, Proof and Infinity, 290–322. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-3616-9_27.

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

Forman, Sylvia, and Agnes M. Rash. "Numerical Functions and Special Congruences." In The Whole Truth About Whole Numbers, 201–27. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11035-6_7.

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

Fletcher, Peter. "From Calculus of Proof Functions to the Logic of Partial Terms." In Truth, Proof and Infinity, 326–48. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-3616-9_29.

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

Conference papers on the topic "Truth-functions"

1

Lukac, Martin, Claudio Moraga, and Michitaka Kameyama. "Properties of Bent Functions in the Truth Domain." In 2019 International Conference on Information and Digital Technologies (IDT). IEEE, 2019. http://dx.doi.org/10.1109/dt.2019.8813751.

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

Gomathisankaran, Mahadevan, and Akhilesh Tyagi. "Relating Boolean gate truth tables to one-way functions." In 2008 IEEE International Conference on Electro/Information Technology (EIT 2008). IEEE, 2008. http://dx.doi.org/10.1109/eit.2008.4554258.

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

Mateev, Vladimir. "Virtual instrument for truth table construction of analytically-defined Boolean functions." In the 9th International Conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1500879.1500944.

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

Nieto, Susana, and Higinio Ramos. "Constructing extended Boolean functions from truth tables using the Mathematica system." In 2016 International Symposium on Computers in Education (SIIE). IEEE, 2016. http://dx.doi.org/10.1109/siie.2016.7751828.

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

Morawiecki, Pawel, Mariusz Rawski, and Henry Selvaraj. "Input Variable Partitioning Method for Functional Decomposition of Functions Specified by Large Truth Tables." In International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007). IEEE, 2007. http://dx.doi.org/10.1109/iccima.2007.349.

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

Bei, Xiaohui, Ning Chen, Guangda Huzhang, Biaoshuai Tao, and Jiajun Wu. "Cake Cutting: Envy and Truth." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/507.

Full text
Abstract:
We study envy-free cake cutting with strategic agents, where each agent may manipulate his private information in order to receive a better allocation. We focus on piecewise constant utility functions and consider two scenarios: the general setting without any restriction on the allocations and the restricted setting where each agent has to receive a connected piece. We show that no deterministic truthful envy-free mechanism exists in the connected piece scenario, and the same impossibility result for the general setting with some additional mild assumptions on the allocations. Finally, we study a large market model where the economy is replicated and demonstrate that truth-telling converges to a Nash equilibrium.
APA, Harvard, Vancouver, ISO, and other styles
7

Couceiro, Miguel, Nicolas Hug, Henri Prade, and Gilles Richard. "Analogy-preserving functions: A way to extend Boolean samples." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/218.

Full text
Abstract:
Training set extension is an important issue in machine learning. Indeed when the examples at hand are in a limited quantity, the performances of standard classifiers may significantly decrease and it can be helpful to build additional examples. In this paper, we consider the use of analogical reasoning, and more particularly of analogical proportions for extending training sets. Here the ground truth labels are considered to be given by a (partially known) function. We examine the conditions that are required for such functions to ensure an error-free extension in a Boolean setting. To this end, we introduce the notion of Analogy Preserving (AP) functions, and we prove that their class is the class of affine Boolean functions. This noteworthy theoretical result is complemented with an empirical investigation of approximate AP functions, which suggests that they remain suitable for training set extension.
APA, Harvard, Vancouver, ISO, and other styles
8

Kerarmi, Abdelouadoud, Assia Kamal-idrissi, and Amal El Fallah Seghrouchni. "An Optimized Fuzzy Logic Model for Proactive Maintenance." In 12th International Conference on Artificial Intelligence, Soft Computing and Applications. Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.122303.

Full text
Abstract:
Fuzzy logic has been proposed in previous studies for machine diagnosis, to overcome different drawbacks of the traditional diagnostic approaches used. Among these approaches Failure Mode and Effect Critical Analysis method(FMECA) attempts to identify potential modes and treat failures before they occur based on subjective expert judgments. Although several versions of fuzzy logic are used to improve FMECA or to replace it, since it is an extremely costintensive approach in terms of failure modes because it evaluates each one of them separately, these propositions have not explicitly focused on the combinatorial complexity nor justified the choice of membership functions in Fuzzy logic modeling. Within this context, we develop an optimization-based approach referred to Integrated Truth Table and Fuzzy Logic Model (ITTFLM) thats martly generates fuzzy logic rules using Truth Tables. The ITTFLM was tested on fan data collected in real-time from a plant machine. In the experiment, three types of membership functions (Triangular, Trapezoidal, and Gaussian) were used. The ITTFLM can generate outputs in 5ms, the results demonstrate that this model based on the Trapezoidal membership functions identifies the failure states with high accuracy, and its capability of dealing with large numbers of rules and thus meets the real-time constraints that usually impact user experience.
APA, Harvard, Vancouver, ISO, and other styles
9

Čepek, Ondřej, and Miloš Chromý. "Switch-List Representations in a Knowledge Compilation Map." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/229.

Full text
Abstract:
In this paper we focus on a less usual way to represent Boolean functions, namely on representations by switch-lists. Given a truth table representation of a Boolean function f the switch-list representation (SLR) of f is a list of Boolean vectors from the truth table which have a different function value than the preceding Boolean vector in the truth table. The main aim of this paper is to include the language SL of all SLR in the Knowledge Compilation Map [Darwiche and Marquis, 2002] and to argue, that SL may in certain situations constitute a reasonable choice for a target language in knowledge compilation. First we compare SL with a number of standard representation languages (such as CNF, DNF, and OBDD) with respect to their relative succinctness. As a by-product of this analysis we also give a short proof of a long standing open question from [Darwiche and Marquis, 2002], namely the incomparability of MODS (models) and PI (prime implicates) languages. Next we analyze which standard transformations and queries (those considered in [Darwiche and Marquis, 2002] can be performed in poly-time with respect to the size of the input SLR. We show that this collection is quite broad and the combination of poly-time transformations and queries is quite unique.
APA, Harvard, Vancouver, ISO, and other styles
10

Ristić, Branko S. "TRANSPOZICIJA MITOLOŠKIH PREDSTAVA U PROZI ZA DECU TIODORA ROSIĆA KNjIŽEVNOST ZA DECU U NAUCI I NASTAVI." In KNjIŽEVNOST ZA DECU U NAUCI I NASTAVI. University of Kragujevac, Faculty of Education in Jagodina, 2022. http://dx.doi.org/10.46793/kdnn21.135r.

Full text
Abstract:
Using analytical-synthetic and comparative procedures, the paper discusses T. Rosić’s novels for children, with special attention to the transposition of mythological representations. The writer deliberately reaches a character-religious supernorm, as well as the aesthetic absolute, and the perfection of cosmic harmony. In his narration, the divine character preserves the functions of a higher corrective of human presence to the world. Tiodor Rosić systematizes the religious feeling, the feeling of God in Serbian cultural tradition – as a predestination of the values that have the power of enrichment his narration with mythological elements. The aim of this paper is to define the problem of transposition of mythological elements in T. Rosić’s novels for children, and to shed some light on man’s search for God’s truth and justice, to point to the value and beauty of narration of this Serbian writer.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Truth-functions' for particular source types:
Journal articles 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