Truth Space Research Articles

Online-Offline Higher-Order Rumor Propagation Model Based on Quantum Cellular Automata Considering Social Adaptation

With the development of the Internet, the influence of rumors is more widespread. Studying the propagation law of rumors is an effective way to reduce the damage of rumors. We therefore propose a new two-layer rumor propagation model, which simultaneously introduces simplicial complexes into the online and offline network layers and considers the social adaptation of individuals. We derive the basic regeneration number, the rumor-free equilibrium, and the rumor-prevalence equilibrium using mean-field theory, and verify their accuracy through extensive computer simulations. The results show that the inclusion of higher-order interactions in both layers leads to richer dynamical phenomena. Specifically, higher-order interactions lead to bistable states, discontinuous transitions, and the coexistence of multiple rumor-prevalence equilibria, and increasing the infection parameter within a certain range reduces the outbreak size of rumors in another layer. In addition, a higher speed and degree of social adaptation, a stronger strength of coupled propagation enhancement effect, and a weaker strength of coupled recovery enhancement effect significantly increase the spread speed and size of rumors. Finally, we present and analyze two intervention strategies: improving public media literacy and building a truth space. We find that both intervention strategies can reduce the spread size and speed of rumors, but the synergy of two intervention strategies is more effective.

Cordel Corrido: What Are the Implications of Creating a New Narrative Voice for Education?

In this article the author proposes queering the teaching of Brazilian and Mexican popular poetry, cordel and corrido, for students in high school or freshmen in college engaging with a curriculum of the brown bodies and aesthetic currere. The author criticizes the teaching of canonic literature in classrooms usually written by white, straight, and middle-class men, and proposes teaching popular poetry from Latin America as a project to interrupt that canon. Teaching and encouraging students to write poetry is a way to oppose the epistemicide in classrooms, and students of color (African descendants, Native peoples, and with roots in Latin America) have “sacred truth spaces” to be who they are.

Practical aspects of equivalence of Baldwin’s and Zadeh’s fuzzy inference

The article presents a thorough analysis of fuzzy inference introduced by Baldwin and compares this approach to Zaheh’s compositional rule of inference. The comparison is performed in order to analyze the equivalence of the two methods and describe practical aspects of this fact for simple and compound premises, indicating advantages and disadvantages of both approaches. The main aim of the analysis is focus on the computational complexity of the methods. The most important feature of Baldwin’s inference is transfer of the inference process into a truth space, unified for all input variables. Such environment allows to obtain one fuzzy truth value describing a compound premise in a sequence of low dimensional computations. The article proves equality of such approach with the compositional rule of inference. Therefore, this solution is much more computationally efficient in case of compound cases, for which compositional rule of inference is multidimensional.

A semantics and a logic for Fuzzy Arden Syntax

Fuzzy programming languages, such as the Fuzzy Arden Syntax (FAS), are used to describe behaviours which evolve in a fuzzy way and thus cannot be characterized neither by a Boolean outcome nor by a probability distribution. This paper introduces a semantics for FAS, focusing on the weighted parallel interpretation of its conditional statement. The proposed construction is based on the notion of a fuzzy multirelation which associates with each state in a program a fuzzy set of weighted possible evolutions. The latter is parametric on a residuated lattice which models the underlying semantic ‘truth space’. Finally, a family of dynamic logics, equally parametric on the residuated lattice, is introduced to reason about FAS programs.

Gendered Genocide

The remarkable gendered renaissance of post–Khmer Rouge (KR) New Cambodian Cinema is evidenced in recent years through first- and second- generation post-traumatic films. This article analyzes one prominent example—Lida Chan and Guillaume P. Suon’s Noces Rouges (Red Wedding, Cambodia/France, 2012)—showing how the Cambodian genocide is for the first time dealt with as a gendered genocide, breaking the taboo issues of forced marriage (a unique form of genocide in the world) and rape. A detailed analysis of Red Wedding describes how the meaning of forced marriage and rape is framed by both the cinema and the relevant national and international discourses embodied by the KR tribunal (also known as the ECCC) and the controversies its proceedings caused. The article compares the cinematic testimony per se and that testimony transferred into legal testimony in court to reflect on the role of cinema in promoting women’s history. Furthermore, it raises highly controversial subjects, such as how to analyze the layers of gendered silencing surrounding both women’s traumatic history and women perpetrators of these sexual crimes; the influence of former KR cadres within current Cambodian society; and the necropolitical function of the killing fields as “truth spaces.” Female testimony, putting forth necrophagic ethics, ultimately becomes the foundation of traumatic history. The conclusion suggests that these intense, embodied first-generation memories resist remembering and instead continue to haunt the individual and the collective; it thus proposes some reflections on the unique role of gendered cinema in healing post- traumatic society in a postgenocide era.

A response-matrix-centred approach to presenting cross-section measurements

The current canonical approach to publishing cross-section data is to unfold the reconstructed distributions. Detector effects like efficiency and smearing are undone mathematically, yielding distributions in true event properties. This is an ill-posed problem, as even small statistical variations in the reconstructed data can lead to large changes in the unfolded spectra. This work presents an alternative or complementary approach: the response-matrix-centred forward-folding approach. It offers a convenient way to forward-fold model expectations in truth space to reconstructed quantities. These can then be compared to the data directly, similar to what is usually done with full detector simulations within the experimental collaborations. For this, the detector response (efficiency and smearing) is parametrised as a matrix. The effects of the detector on the measurement of a given model is simulated by simply multiplying the binned truth expectation values by this response matrix. Systematic uncertainties in the detector response are handled by providing a set of matrices according to the prior distribution of the detector properties and marginalising over them. Background events can be included in the likelihood calculation by giving background events their own bins in truth space. To facilitate a straight-forward use of response matrices, a new software framework has been developed: the Response Matrix Utilities (\\ReMU). \\ReMU is a Python package distributed via the Python Package Index. It only uses widely available, standard scientific Python libraries and does not depend on any custom experiment-specific software. It offers all methods needed to build response matrices from Monte Carlo data sets, use the response matrix to forward-fold truth-level model predictions, and compare the predictions to real data using Bayesian or frequentist statistical inference.

Daddy Diary for the daughter of the future: a sound-based archive

PurposeThe purpose of this paper is to explore a range of questions and problems pertaining to a sound-based project that the author began half-way through 2011. Called Daddy Diary, this archive-in-progress takes the form of a series of free-association audio monologues, produced by a first-time father, that are addressed to his adult-daughter of the future and that reflect upon their evolving familial relationship.Design/methodology/approachAs is often the case with creative projects that are embedded in a plurality of ideological, material and temporal conditions, Daddy Diary requires an eclectic and para-humanities approach to its theorisation. By drawing from ethical, sociological, historical and pedagogical assemblages, this paper shows how Daddy Diary activates a non-hegemonic truth space wherein familial knowledge (tacit knowledge captured in the raw material of the voice recordings) participates in the sustainable and counter-institutional negotiation of self-concept.FindingsSound recording technologies have made accessible new ways of documenting human life-narratives, thus augmenting how notions of the self can be written, reviewed and shared with a creative learning community. Just as photography has been used in creative practice reinforce parental worth, playing into the experience of holding and letting go, so too does an audio diary provide the apparatus through which a parent may reflexively navigate death anxiety and the possibility of loss. Thus, this paper contains insight that may prove useful for other first-time fathers. It’s insight may also be of benefit to practice-led researchers wishing to understand how to translate non-institutional activity into a creative learning experience.Originality/valueJust as the foregrounding of sound poses a challenge to the so-called dominance of visual cultural communication, so too can “listening” engage an alternative sensory perspective from which we “see” ourselves.

A Family of Graded Epistemic Logics

Multi-Agent Epistemic Logic has been investigated in Computer Science [Fagin, R., J. Halpern, Y. Moses and M. Vardi, “Reasoning about Knowledge,” MIT Press, USA, 1995] to represent and reason about agents or groups of agents knowledge and beliefs. Some extensions aimed to reasoning about knowledge and probabilities [Fagin, R. and J. Halpern, Reasoning about knowledge and probability, Journal of the ACM 41 (1994), pp. 340–367] and also with a fuzzy semantics have been proposed [Fitting, M., Many-valued modal logics, Fundam. Inform. 15 (1991), pp. 235–254; Maruyama, Y., Reasoning about fuzzy belief and common belief: With emphasis on incomparable beliefs, in: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16–22, 2011, 2011, pp. 1008–1013]. This paper introduces a parametric method to build graded epistemic logics inspired in the systematic method to build Multi-valued Dynamic Logics introduced in [Madeira, A., R. Neves and M. A. Martins, An exercise on the generation of many-valued dynamic logics, J. Log. Algebr. Meth. Program. 85 (2016), pp. 1011–1037. URL http://dx.doi.org/10.1016/j.jlamp.2016.03.004; Madeira, A., R. Neves, M. A. Martins and L. S. Barbosa, A dynamic logic for every season, in: C. Braga and N. Martí-Oliet, editors, Formal Methods: Foundations and Applications – 17th Brazilian Symposium, SBMF 2014, Maceió, AL, Brazil, September 29-October 1, 2014. Proceedings, Lecture Notes in Computer Science 8941 (2014), pp. 130–145. URL http://dx.doi.org/10.1007/978-3-319-15075-8_9]. The parameter in both methods is the same: an action lattice [Kozen, D., On action algebras, Logic and Information Flow (1994), pp. 78–88]. This algebraic structure supports a generic space of agent knowledge operators, as choice, composition and closure (as a Kleene algebra), but also a proper truth space for possible non bivalent interpretation of the assertions (as a residuated lattice).

Reduced basis methods with adaptive snapshot computations

We use asymptotically optimal adaptive numerical methods (here specifically a wavelet scheme) for snapshot computations within the offline phase of the Reduced Basis Method (RBM). The resulting discretizations for each snapshot (i.e., parameter-dependent) do not permit the standard RB `truth space', but allow for error estimation of the RB approximation with respect to the exact solution of the considered parameterized partial differential equation. The residual-based a posteriori error estimators are computed by an adaptive dual wavelet expansion, which allows us to compute a surrogate of the dual norm of the residual. The resulting adaptive RBM is analyzed. We show the convergence of the resulting adaptive greedy method. Numerical experiments for stationary and instationary problems underline the potential of this approach.

An exercise on the generation of many-valued dynamic logics

In the last decades, dynamic logics have been used in different domains as a suitable formalism to reason about and specify a wide range of systems. On the other hand, logics with many-valued semantics are emerging as an interesting tool to handle devices and scenarios where uncertainty is a prime concern. This paper contributes towards the combination of these two aspects through the development of a method for the systematic construction of many-valued dynamic logics. Technically, the method is parameterised by an action lattice that defines both the computational paradigm and the truth space (corresponding to the underlying Kleene algebra and residuated lattices, respectively).

Сравнение областей истинности запросов к реляционной базе данных

We propose new methods and algorithms of analytical truth space comparison for Relational Database queries. Such a comparison aims to define the possibility of partial or full cache usage. The cache is stored on user’s computer and Database server is supposed to be remote. In case user query’s result is contained in cache we can simply take the data from there avoiding any server requests. The suggested method may also be used for defining data missing in cache and performing query to only receive that data. Analytical computations are also used to achieve this and it differs our approach from existing ones. Query comparison algorithms are based on the Predicate Logic theory. Formulas are presented by logical constraints in SQL and predicates correspond to SQL operations.

A minimum-residual mixed reduced basis method: Exact residual certification and simultaneous finite-element reduced-basis refinement

We present a reduced basis method for parametrized partial differential equations certified by a dual-norm bound of the residual computed not in the typical finite-element truth space but rather in an infinite-dimensional function space. The bound builds on a finite element method and an associated reduced-basis approximation derived from a minimum-residual mixed formulation. The offline stage combines a spatial mesh adaptation for finite elements and a greedy parameter sampling strategy for reduced bases to yield a reliable online system in an efficient manner; the online stage provides the solution and the associated dual-norm bound of the residual for any parameter value in complexity independent of the finite element resolution. We assess the effectiveness of the approach for a parametrized reaction-diffusion equation and a parametrized advection-diffusion equation with a corner singularity; not only does the residual bound provide reliable certificates for the solutions, the associated mesh adaptivity significantly reduces the offline computational cost for the reduced-basis generation and the greedy parameter sampling ensures quasi-optimal online complexity.

Truth Space Method for Caching Database Queries

We propose a new method of client-side data caching for relational databases with a central server and distant clients. Data are loaded into the client cache based on queries executed on the server. Every has the corresponding DB table – the result of the execution. These queries have a special form called universal relational query based on three fundamental Relational Algebra operations: selection, projection and natural join. We have to mention that such a form is the closest one to the natural language and the majority of database search queries can be expressed in this way. Besides, this form allows us to analyze correctness by checking lossless join property. A subsequent may be executed in a client’s local cache if we can determine that the result is entirely contained in the cache. For this we compare truth spaces of the logical restrictions in a new user’s and the results of the queries execution in the cache. Such a comparison can be performed analytically , without need in additional Database queries. This method may be used to define lacking data in the cache and execute the on the server only for these data. To do this the analytical approach is also used, what distinguishes our paper from the existing technologies. We propose four theorems for testing the required conditions. The first and the third theorems conditions allow us to define the existence of required data in cache. The second and the fourth theorems state conditions to execute queries with cache only. The problem of cache data actualizations is not discussed in this paper. However, it can be solved by cataloging queries on the server and their serving by triggers in background mode. The article is published in the author’s wording.

Truth, Narrative, and Opening Space

This paper identifies the difficulties in confronting novel history from both a rigorous scientific and artistic literary perspectives and suggests a practical reconciliation—in the form of a discussion and metaphorical opening space—between the two apparent poles of historical understanding and their accompanying genres, types, and tropes.

On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs

Unlike monotone single-valued functions, multivalued mappings may have zero, one, or (possibly infinitely) many minimal fixed-points. The contribution of this work is twofold. First, we overview and investigate the existence and computation of minimal fixed-points of multivalued mappings, whose domain is a complete lattice and whose range is its power set. Second, we show how these results are applied to a general form of logic programs, where the truth space is a complete lattice. We show that a multivalued operator can be defined whose fixed-points are in one-to-one correspondence with the models of the logic program.

Any-world assumptions in logic programming

Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The stable model semantics, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is false. There is a second well-known assumption, called Open World Assumption (OWA), which asserts that the truth of the atoms is supposed to be unknown by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from an arbitrary truth space. The topic of this paper is to allow any assignment (i.e. interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the “everywhere false” default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well.

Multiple objective evolutionary algorithm for temporal linguistic rule extraction

Autonomous temporal linguistic rule extraction is an application of growing interest for its relevance to both decision support systems and fuzzy controllers. In the presented work, rules are evaluated using three qualitative metrics based on their representation on the truth space diagram. Performance metrics are then treated as competing objectives and the multiple objective evolutionary algorithm is used to search for an optimal set of nondominant rules. Novel techniques for data pre-processing and rule set post-processing are designed that deal directly with the delays involved in dynamic systems. Data collected from a simulated hot and cold water mixer are used to validate the proposed procedure.

Frame constructions, truth invariance and validity preservation in many-valued modal logic

In this paper we define and examine frame constructions for the family of manyvalued modal logics introduced by M. Fitting in the '90s. Every language of this family is built on an underlying space of truth values, a Heyting algebra H. We generalize Fitting's original work by considering complete Heyting algebras as truth spaces and proceed to define a suitable notion of H-indexed families of generated subframes, disjoint unions and bounded morphisms. Then, we provide an algebraic generalization of the canonical extension of a frame and model, and prove a preservation result inspired from Fitting's canonical model argument in [FIT 92a]. The analog of a complex algebra and of a principal ultrafilter is defined and the embedding of a frame into its canonical extension is presented.

An inference engine based on fuzzy logic for uncertain and imprecise expert reasoning

This paper addresses the development and computational implementation of an inference engine based on a full fuzzy logic, excluding only imprecise quantifiers, for handling uncertainty and imprecision in rule-based expert systems. The logical model exploits some connectives of Lukasiewicz's infinite multi-valued logic and is mainly founded on the work of L.A. Zadeh and J.F. Baldwin. As it is oriented to expert systems, the inference engine was developed to be as knowledge domain independent as possible, while having satisfactory computational efficiency. This is achieved firstly by using the same linguistic term set in every universe of discourse. Thus, it is possible to add a dictionary to the knowledge base, which translates the usual linguistic values of the domain to those of the term set. Secondly, the logical operations of negation and conjunction and the modus ponens rule of inference are implemented exclusively in the truth space. The approach provides, firstly, a realistic and unambiguous solution to the combination of evidence problem and, secondly, offers two alternative versions of implementation. The full version uses the algorithms of the operations involved. In a more efficient version, which places a small constraint on the use of linguistic modifiers and is confined to knowledge bases whose inference chains are no longer than three links, the above algorithms are replaced by pre-computed tables.

Bilattices and Reasoning in ArtificialIntelligence: Concepts and Foundations

The past few decades have seen a resurgence of reasoning techniques in artificial intelligence involving both classical and non-classical logics. In his paper, ``Multi-valued Logics: A Uniform Approach to Reasoning in Artificial Intelligence'', Ginsberg has shown that through the use of bilattices, several reasoning techniques can be unified under a single framework. A bilattice is a structure that can be viewed as a class of truth values that can accommodate incomplete and inconsistent information and in certain cases default information. In bilattice theory, knowledge is ordered along two dimensions: truth/falsity and certainty/uncertainty. By defining the corresponding bilattices as truth spaces, Ginsberg has shown that the same theorem prover can be used to simulate reasoning in first order logic, default logic, prioritized default logic and assumption truth maintenance system. Although this is a significant contribution, Ginsberg's paper was lengthy and involved. This paper summarizes some of the essential concepts and foundations of bilattice theory. Furthermore, it discusses the connections of bilattice theory and several other existing multi-valued logics such as the various three-valued logics and Belnap's four-valued logic. It is noted that the set of four truth values in Belnap's logic form a lattice structure that is isomorphic to the simplest bilattice. Subsequently, Fitting proposed a conflation operation that can be used to select sub-sets of truth values from this and other bilattices. This method of selecting sub-sets of truth values provides a means for identifying sub-logic in a bilattice.