Log in

Relevant bibliographies by topics / Relational calculi / Journal articles

To see the other types of publications on this topic, follow the link: Relational calculi.

Journal articles on the topic 'Relational calculi'

Author: Grafiati

Published: 4 June 2021

Last updated: 7 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Relational calculi.'

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

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

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

1

de Freitas, R., P. A. S. Veloso, S. R. M. Veloso, and P. Viana. "On Positive Relational Calculi." Logic Journal of IGPL 15, no. 5-6 (September 26, 2007): 577–601. http://dx.doi.org/10.1093/jigpal/jzm054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sáenz-Pérez, Fernando. "Relational calculi in a deductive system." Expert Systems with Applications 97 (May 2018): 106–16. http://dx.doi.org/10.1016/j.eswa.2017.12.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kahl, W. "Relational matching for graphical calculi of relations." Information Sciences 119, no. 3-4 (October 2, 1999): 253–73. http://dx.doi.org/10.1016/s0020-0255(99)00018-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Libkin, Leonid, and Limsoon Wong. "Conservativity of nested relational calculi with internal generic functions." Information Processing Letters 49, no. 6 (March 1994): 273–80. http://dx.doi.org/10.1016/0020-0190(94)90099-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gherardi, Guido, and Eugenio Orlandelli. "Super-Strict Implications." Bulletin of the Section of Logic 50, no. 1 (January 20, 2021): 1–34. http://dx.doi.org/10.18778/0138-0680.2021.02.

Full text

Abstract:

This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the modal cube. it is shown that all logics of super-strict implications are connexive logics in that they validate Aristotle's Theses and (weak) Boethius's Theses. A proof-theoretic characterisation of logics of super-strict implications is given by means of G3-style labelled calculi, and it is proved that the structural rules of inference are admissible in these calculi. It is also shown that validity in the S5-based logic of super-strict implications is equivalent to validity in G. Priest's negation-as-cancellation-based logic. Hence, we also give a cut-free calculus for Priest's logic.

APA, Harvard, Vancouver, ISO, and other styles

6

Pascucci, Matteo. "Propositional quantifiers in labelled natural deduction for normal modal logic." Logic Journal of the IGPL 27, no. 6 (April 25, 2019): 865–94. http://dx.doi.org/10.1093/jigpal/jzz008.

Full text

Abstract:

Abstract This article concerns the treatment of propositional quantification in a framework of labelled natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a detailed analysis of a basic calculus that can be used for a proof-theoretic rendering of minimal normal multimodal systems with quantification over stable domains of propositions. Furthermore, we consider variations of the basic calculus obtained via relational theories and domain theories allowing for quantification over possibly unstable domains of propositions. The main result of the article is that fragments of the labelled calculi not exploiting reductio ad absurdum enjoy the Church–Rosser property and the strong normalization property; such result is obtained by combining Girard’s method of reducibility candidates and labelled languages of lambda calculus codifying the structure of modal proofs.

APA, Harvard, Vancouver, ISO, and other styles

7

Amini, Majid. "Logical machines: Peirce on psychologism." Disputatio 2, no. 24 (May 1, 2008): 335–48. http://dx.doi.org/10.2478/disp-2008-0005.

Full text

Abstract:

Abstract This essay discusses Peirce’s appeal to logical machines as an argument against psychologism. It also contends that some of Peirce’s anti-psychologistic remarks on logic contain interesting premonitions arising from his perception of the asymmetry of proof complexity in monadic and relational logical calculi that were only given full formulation and explication in the early twentieth century through Church’s Theorem and Hilbert’s broad-ranging Entscheidungsproblem.

APA, Harvard, Vancouver, ISO, and other styles

8

KIKOT, STANISLAV, AGI KURUCZ, YOSHIHITO TANAKA, FRANK WOLTER, and MICHAEL ZAKHARYASCHEV. "KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS." Journal of Symbolic Logic 84, no. 02 (April 3, 2019): 533–88. http://dx.doi.org/10.1017/jsl.2019.22.

Full text

Abstract:

AbstractOur concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same consequence relations for a given spi-logic.

APA, Harvard, Vancouver, ISO, and other styles

9

BIMBÓ, KATALIN, J. MICHAEL DUNN, and ROGER D. MADDUX. "RELEVANCE LOGICS AND RELATION ALGEBRAS." Review of Symbolic Logic 2, no. 1 (March 2009): 102–31. http://dx.doi.org/10.1017/s1755020309090145.

Full text

Abstract:

Relevance logics are known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds of dynamic semantics (i.e., proper relation algebras and relevant families of relations). We prove several soundness results here. We also prove the completeness of a certain positive fragment of R as well as of the first-degree fragment of relevance logics. These results show that some core ideas are shared between relevance logics and relation algebras. Some details of certain incompleteness results, however, pinpoint where relevance logics and relation algebras diverge. To carry out these semantic investigations, we define a new tableaux formalization and new sequent calculi (with the single cut rule admissible) for various relevance logics.

APA, Harvard, Vancouver, ISO, and other styles

10

HONDA, KOHEI. "Elementary structures in process theory (1): Sets with renaming." Mathematical Structures in Computer Science 10, no. 5 (October 2000): 617–63. http://dx.doi.org/10.1017/s0960129599002947.

Full text

Abstract:

We study a general algebraic framework that underlies a wide range of computational formalisms that use the notion of names, notably process calculi. The algebraic framework gives a rigorous basis for describing and reasoning about processes semantically, as well as offering new insights into existing constructions. The formal status of the theory is elucidated by introducing its alternative presentation, which is geometric in nature and is based on explicit manipulation of connections among nameless processes. Nameless processes and their relational theory form a coherent universe in their own right, which underlies existing graphical formalisms such as proof nets. We establish the formal equivalence between these two presentations, and illustrate how they can be used complementarily for the precise and effective description of diverse algebras and the dynamics of processes through examples.

APA, Harvard, Vancouver, ISO, and other styles

11

Urquhart, Alasdair. "Katalin Bimbó and J. Michael Dunn. Relational semantics of nonclassical logical calculi. CSLI Lecture Notes, no. 188. CSLI Publications, Stanford University, 2008, x + 382 pp." Bulletin of Symbolic Logic 16, no. 2 (June 2010): 277–78. http://dx.doi.org/10.1017/s1079898600001049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Ghani, Neil, Kidane Yemane, and Björn Victor. "Relationally Staged Computations in Calculi of Mobile Processes." Electronic Notes in Theoretical Computer Science 106 (December 2004): 105–20. http://dx.doi.org/10.1016/j.entcs.2004.02.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

NGUYEN, THANH TUNG. "A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS." International Journal of Foundations of Computer Science 02, no. 02 (June 1991): 101–31. http://dx.doi.org/10.1142/s012905419100008x.

Full text

Abstract:

The paper gives a self-contained account of a calculus of relations from basic operations through the treatment of recursive relation equations. This calculus serves as an algebraic apparatus for defining the denotational semantics of Dijkstra’s nondeterministic sequential programming language. Nondeterministic programs are modeled by binary relations, objects of an algebraic structure founded upon the operations “union”, “left restriction”, “demonic composition”, “demonic union”, and the ordering “restriction of”. Recursion and iteration are interpreted as fixed points of continuous relationals. Developed in the framework of set theory, this calculus may be regarded as a systematic generalization of the functional style.

APA, Harvard, Vancouver, ISO, and other styles

14

MacCaull, Wendy. "Relational semantics and a relational proof system for full Lambek calculus." Journal of Symbolic Logic 63, no. 2 (June 1998): 623–37. http://dx.doi.org/10.2307/2586855.

Full text

Abstract:

AbstractIn this paper we give relational semantics and an accompanying relational proof theory for full Lambek calculus (a sequent calculus which we denote by FL). We start with the Kripke semantics for FL as discussed in [11] and develop a second Kripke-style semantics, RelKripke semantics, as a bridge to relational semantics. The RelKripke semantics consists of a set with two distinguished elements, two ternary relations and a list of conditions on the relations. It is accompanied by a Kripke-style valuation system analogous to that in [11]. Soundness and completeness theorems with respect to FL hold for RelKripke models. Then, in the spirit of the work of Orlowska [14], [15], and Buszkowski and Orlowska [3], we develop relational logic RFL. The adjective relational is used to emphasize the fact that RFL has a semantics wherein formulas are interpreted as relations. We prove that a sequent Γ → α in FL is provable if and only if a translation, t(γ1 ● … ● γn ⊃ α)ευu, has a cut-complete fundamental proof tree. This result is constructive: that is, if a cut-complete proof tree for t(γ1 ● … ● γn ⊃ α)ευu is not fundamental, we can use the failed proof search to build a relational countermodel for t(γ1 ● … ● γn ⊃ α)ευu and from this, build a RelKripke countermodel for γ1 ● … ● γn ⊃ α. These results allow us to add FL, the basic substructural logic, to the list of those logics of importance in computer science with a relational proof theory.

APA, Harvard, Vancouver, ISO, and other styles

15

Pistol, Luminita, and Radu BUCEA-MANEA-TONIS. "Logical Querying of Relational Databases." Journal of Economic Development, Environment and People 5, no. 4 (December 30, 2016): 58. http://dx.doi.org/10.26458/jedep.v5i4.518.

Full text

Abstract:

This paper aims to demonstrate the usefulness of formal logic and lambda calculus in database programming. After a short introduction in propositional and first order logic, we implement dynamically a small database and translate some SQL queries in filtered java 8 streams, enhanced with Tuples facilities from jOOλ library.

APA, Harvard, Vancouver, ISO, and other styles

16

PAOLINI, LUCA, MAURO PICCOLO, and SIMONA RONCHI DELLA ROCCA. "Essential and relational models." Mathematical Structures in Computer Science 27, no. 5 (July 23, 2015): 626–50. http://dx.doi.org/10.1017/s0960129515000316.

Full text

Abstract:

Intersection type assignment systems can be used as a general framework for building logical models of λ-calculus that allow to reason about the denotation of terms in a finitary way. We defineessentialmodels (a new class of logical models) through a parametric type assignment system using non-idempotent intersection types. Under an interpretation of terms based on typings instead than the usual one based on types, every suitable instance of the parameters induces a λ-model, whose theory is sensible. We prove that this type assignment system provides a logical description of a family of λ-models arising from a category of sets and relations.

APA, Harvard, Vancouver, ISO, and other styles

17

Hutton, Graham, and Erik Meijer. "Functional Pearl." Journal of Functional Programming 6, no. 1 (January 1996): 181–88. http://dx.doi.org/10.1017/s0956796800001623.

Full text

Abstract:

AbstractA representation changer is a function that converts a concrete representation of an abstract value into a different concrete representation of that value. Many useful functions can be recognised as representation changers; examples include compilers and arithmetic functions such as addition and multiplication. Functions that can be specified as the right inverse of other functions are special cases of representation changers. In recent years, a number of authors have used a relational calculus to derive representation changers from their specifications. In this paper, we show that the generality of relations is not essential, and representation changers can be derived within the more basic setting of functional programming. We illustrate our point by deriving a carry-save adder and a base-converter, two functions which have previously been derived relationally.

APA, Harvard, Vancouver, ISO, and other styles

18

Pokorný, Jaroslav. "Integration of Relational and Graph Databases Functionally." Foundations of Computing and Decision Sciences 44, no. 4 (December 1, 2019): 427–41. http://dx.doi.org/10.2478/fcds-2019-0021.

Full text

Abstract:

Abstract In today’s multi-model database world there is an effort to integrate databases expressed in different data models. The aim of the article is to show possibilities of integration of relational and graph databases with the help of a functional data model and its formal language – a typed lambda calculus. We suppose the existence of a data schema both for the relational and graph database. In this approach, relations are considered as characteristic functions and property graphs as sets of single-valued and multivalued functions. Then it is possible to express a query over such integrated heterogeneous database by one query expression expressed in a version of the typed lambda calculus. A more user-friendly version of such language could serve as a powerful query tool in practice. We discuss also queries sent to the integrated system and translated into queries in SQL and Cypher - the graph query language for Neo4j.

APA, Harvard, Vancouver, ISO, and other styles

19

Močkoř, Jiří. "Relational Variants of Lattice-Valued F-Transforms." Axioms 9, no. 1 (December 19, 2019): 1. http://dx.doi.org/10.3390/axioms9010001.

Full text

Abstract:

Two categories of lower and upper lattice-valued F-transforms with fuzzy relations as morphisms are introduced, as generalisations of standard categories of F-transforms with maps as morphisms. Although F-transforms are defined using special structures called spaces with fuzzy partitions, it is shown that these categories are identical to the relational variants of the two categories of semimodule homomorphisms where these fuzzy partitions do not occur. This a priori independence of the F-transform on spaces with fuzzy partitions makes it possible, for example, to use a simple matrix calculus to calculate F-transforms, or to determine the image of F-transforms in relational morphisms of the two categories.

APA, Harvard, Vancouver, ISO, and other styles

20

BIRKEDAL, LARS, and RASMUS E. MØGELBERG. "Categorical models for Abadi and Plotkin's logic for parametricity." Mathematical Structures in Computer Science 15, no. 4 (July 15, 2005): 709–72. http://dx.doi.org/10.1017/s0960129505004834.

Full text

Abstract:

We propose a new category-theoretic formulation of relational parametricity based on a logic for reasoning about parametricity given by Abadi and Plotkin. The logic can be used to reason about parametric models, such that we may prove consequences of parametricity that to our knowledge have not been proved before for existing category-theoretic notions of relational parametricity. We provide examples of parametric models and describe a way of constructing parametric models from given models of the second-order lambda calculus.

APA, Harvard, Vancouver, ISO, and other styles

21

Liu, Hsiang Chuan, Wei Sung Chen, and Hsien Chang Tsai. "Polytomous Item Relational Structure Theory Based on Empirical Distribution Critical Value." Advanced Materials Research 472-475 (February 2012): 1329–32. http://dx.doi.org/10.4028/www.scientific.net/amr.472-475.1329.

Full text

Abstract:

The threshold limit value of Takeya’s item relational structure theory is a fixed value, which is lacking of statistical meaning, in our previous paper, an improved threshold limit value by using the empirical distribution critical value was proposed, it was showed that the new theory is more sensitive and effective than the old one. However, for constructing the item relational structure, both of them can only be used for dichotomous items, not for polytomous items. In this paper, the empirical distribution critical value based polytomous item relational structure theory is proposed, it is a generalization of our previously improved theory. A calculus example was also provided in this paper to illustrate the advantages of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

22

NEGRI, SARA, and JAN VON PLATO. "Proof systems for lattice theory." Mathematical Structures in Computer Science 14, no. 4 (August 2004): 507–26. http://dx.doi.org/10.1017/s0960129504004244.

Full text

Abstract:

A formulation of lattice theory as a system of rules added to sequent calculus is given. The analysis of proofs for the contraction-free calculus of classical predicate logic known as G3c extends to derivations with the mathematical rules of lattice theory. It is shown that minimal derivations of quantifier-free sequents enjoy a subterm property: all terms in such derivations are terms in the endsequent.An alternative formulation of lattice theory as a system of rules in natural deduction style is given, both with explicit meet and join constructions and as a relational theory with existence axioms. A subterm property for the latter extends the standard decidable classes of quantificational formulas of pure predicate calculus to lattice theory.

APA, Harvard, Vancouver, ISO, and other styles

23

ORSI, GIORGIO, and LETIZIA TANCA. "Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules." Theory and Practice of Logic Programming 10, no. 3 (May 2010): 243–50. http://dx.doi.org/10.1017/s1471068410000086.

Full text

Abstract:

Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since. Logic has been a common ground where Database and Artificial Intelligence research competed and collaborated with each other for a long time (Abiteboul et al. 1995). The product of this joint effort has been a set of logic-based formalisms, such as the Relational Calculus (Codd 1970), Datalog (Ceri et al. 1990), Description Logics (Baader et al. 2007), etc., capturing not only the structure but also the semantics of data in an explicit way, thus enabling complex inference procedures.

APA, Harvard, Vancouver, ISO, and other styles

24

Nobuhara, Hajime, and Kaoru Hirota. "A Fuzzification of Morphological Wavelets Based on Fuzzy Relational Calculus and its Application to Image Compression/Reconstruction." Journal of Advanced Computational Intelligence and Intelligent Informatics 8, no. 4 (July 20, 2004): 373–78. http://dx.doi.org/10.20965/jaciii.2004.p0373.

Full text

Abstract:

A new style of fuzzy wavelets is proposed by the fuzzification of morphological wavelets. Due to the correspondence of the morphological wavelets operations and fuzzy relational ones, wavelets analysis/synthesis schemes can be formulated based on fuzzy relational calculus. To enable efficient image compression/reconstruction, the concept of the alpha-band which is an alpha-cut generalization, is also proposed for thresholding wavelets. In an image compression/reconstruction experiment using test images extracted from the Standard Image DataBAse (SIDBA), it is confirmed that the root mean square error (RMSE) of the proposed soft thresholding is decreased to 87.3% of conventional hard thresholding, when the original image is "Lenna."

APA, Harvard, Vancouver, ISO, and other styles

25

DE CARVALHO, DANIEL. "Execution time of λ-terms via denotational semantics and intersection types." Mathematical Structures in Computer Science 28, no. 7 (January 30, 2017): 1169–203. http://dx.doi.org/10.1017/s0960129516000396.

Full text

Abstract:

The multiset-based relational model of linear logic induces a semantics of the untyped λ-calculus, which corresponds with a non-idempotent intersection type system, System R. We prove that, in System R, the size of type derivations and the size of types are closely related to the execution time of λ-terms in a particular environment machine, Krivine's machine.

APA, Harvard, Vancouver, ISO, and other styles

26

NEGRI, SARA, and GIORGIO SBARDOLINI. "PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS." Review of Symbolic Logic 9, no. 1 (December 1, 2015): 44–75. http://dx.doi.org/10.1017/s1755020315000295.

Full text

Abstract:

AbstractA deductive system for Lewis counterfactuals is presented, based directly on the influential generalisation of relational semantics through ternary similarity relations introduced by Lewis. This deductive system builds on a method of enriching the syntax of sequent calculus by labels for possible worlds. The resulting labelled sequent calculus is shown to be equivalent to the axiomatic system VC of Lewis. It is further shown to have the structural properties that are needed for an analytic proof system that supports root-first proof search. Completeness of the calculus is proved in a direct way, such that for any given sequent either a formal derivation or a countermodel is provided; it is also shown how finite countermodels for unprovable sequents can be extracted from failed proof search, by which the completeness proof turns into a proof of decidability.

APA, Harvard, Vancouver, ISO, and other styles

27

PITTS, ANDREW M. "Parametric polymorphism and operational equivalence." Mathematical Structures in Computer Science 10, no. 3 (June 2000): 321–59. http://dx.doi.org/10.1017/s0960129500003066.

Full text

Abstract:

Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where the partialness arising from the presence of fixpoint recursion complicates the nature of potentially infinite (‘lazy’) data types. An approach to Reynolds' notion of relational parametricity is developed that works directly on the syntax of a programming language, using a novel closure operator to relate operational behaviour to parametricity properties of types. Working with an extension of Plotkin's PCF with ∀-types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence.

APA, Harvard, Vancouver, ISO, and other styles

28

Verluise, Pierre. "OTAN-UE : quel calcul géorgien ?" Revue internationale et stratégique 82, no. 2 (2011): 30. http://dx.doi.org/10.3917/ris.082.0030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Pacaud Lemay, Jean-Simon. "Convenient antiderivatives for differential linear categories." Mathematical Structures in Computer Science 30, no. 5 (May 2020): 545–69. http://dx.doi.org/10.1017/s0960129520000158.

Full text

Abstract:

AbstractDifferential categories axiomatize the basics of differentiation and provide categorical models of differential linear logic. A differential category is said to have antiderivatives if a natural transformation , which all differential categories have, is a natural isomorphism. Differential categories with antiderivatives come equipped with a canonical integration operator such that generalizations of the Fundamental Theorems of Calculus hold. In this paper, we show that Blute, Ehrhard, and Tasson's differential category of convenient vector spaces has antiderivatives. To help prove this result, we show that a differential linear category – which is a differential category with a monoidal coalgebra modality – has antiderivatives if and only if one can integrate over the monoidal unit and such that the Fundamental Theorems of Calculus hold. We also show that generalizations of the relational model (which are biproduct completions of complete semirings) are also differential linear categories with antiderivatives.

APA, Harvard, Vancouver, ISO, and other styles

30

Downen, Paul, Philip Johnson-Freyd, and Zena M. Ariola. "Abstracting models of strong normalization for classical calculi." Journal of Logical and Algebraic Methods in Programming 111 (February 2020): 100512. http://dx.doi.org/10.1016/j.jlamp.2019.100512.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Pugliese, Rosario, and Francesco Tiezzi. "Replacement freeness: A criterion for separating process calculi." Journal of Logical and Algebraic Methods in Programming 116 (November 2020): 100579. http://dx.doi.org/10.1016/j.jlamp.2020.100579.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

MAZZA, DAMIANO. "A denotational semantics for the symmetric interaction combinators." Mathematical Structures in Computer Science 17, no. 3 (June 2007): 527–62. http://dx.doi.org/10.1017/s0960129507006135.

Full text

Abstract:

The symmetric interaction combinators are a variant of Lafont's interaction combinators. They enjoy a weaker universality property with respect to interaction nets, but are equally expressive. They are a model of deterministic distributed computation and share the good properties of Turing machines (elementary reductions) and of the λ-calculus (higher-order functions and parallel execution). We introduce a denotational semantics for this system, which is inspired by the relational semantics for linear logic, and prove an injectivity and full completeness result for it. We also consider the algebraic semantics defined by Lafont, and prove that the two are strongly related.

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, He-Da, Shih-Chih Chen, and Athapol Ruangkanjanases. "Benefits First: Consumer Trust Repair in Mobile Commerce." Journal of Theoretical and Applied Electronic Commerce Research 16, no. 4 (March 19, 2021): 1079–96. http://dx.doi.org/10.3390/jtaer16040061.

Full text

Abstract:

The purpose of this study is to explore trust repair strategies and the outcomes in mobile (m-)commerce. Consumer trust in m-commerce is a calculus-based form of trust; service failures, “inaction” and “excessive actions” are the typical trust decline situations. Three strategies of the fulfillment of consumers’ psychological contract for compensation, arousal, and regulation are proposed as trust-repaired solutions regarding the abovementioned three situations. The experimental results demonstrate that trust cannot be repaired by a single relational psychological contract strategy and that it can be repaired by both a single transactional and interactive strategy; the interactive strategy is more effective in competence-based decline. Second, in integrity-based decline, both the single and interactive strategy negatively influence trust repair; the relational strategy has the strongest effect. The “boomerang effect” shows that the more m-vendors repair, the more the trust decreases. Third, trust can be repaired, respectively by arousal and regulation strategy regarding corresponding situations of inaction and excessive actions. Finally, the trust repair paradox (TRP) has not been verified in m-commerce.

APA, Harvard, Vancouver, ISO, and other styles

34

Sardesai, Anjali, Vilas Kharat, Pradip Sambarey, and Ashok Deshpande. "Fuzzy Logic-Based Formalisms for Gynecology Disease Diagnosis." Journal of Intelligent Systems 25, no. 2 (April 1, 2016): 283–95. http://dx.doi.org/10.1515/jisys-2015-0106.

Full text

Abstract:

AbstractThe very basis of the present article is the fact that the medical knowledge consisting of clinical presentation, diagnosis, and treatment of a disease is with imprecision and uncertainty. The overall approach in gynecological disease diagnosis could be divided into three distinct stages, and this was confirmed by seven experienced gynecologists. Stage 1 refers to an initial screening process in order to arrive at a single disease diagnosis for the patients, which is based only on the subjective information provided by patients to the physician. In stage 2, the patient who has not received a single diagnostic label in stage 1 is further investigated for a single disease diagnosis using past history criteria. If stage 2 fails to arrive at a single disease diagnosis for a patient, then physical examination and various tests like imaging tests, blood tests, etc., are conducted, and the test results are processed in stage 3. In stage 1, we have revisited fuzzy relational calculus and mathematically evaluated the perceptions of the domain experts (gynecologists) with respect to 31 gynecological diseases. The paper also presents the research findings with a case study focused on stage 2 using a type 1 fuzzy inference system. Out of 226 patients, 50 are correctly diagnosed for a single disease and 147 for multiple diseases in stage 1. The paper concludes that fuzzy relational calculus is an effective method as an “initial screening” process to arrive at a single disease diagnosis. We have identified 29 out of 226 patients satisfying past history criteria to achieve a single disease diagnosis by stage 2. Investigations for stage 3 are in progress.

APA, Harvard, Vancouver, ISO, and other styles

35

Azarov, Olexiy, Leonid Krupelnitsky, and Hanna Rakytyanska. "Television Rating Control in the Multichannel Environment Using Trend Fuzzy Knowledge Bases and Monitoring Results †." Data 3, no. 4 (December 1, 2018): 57. http://dx.doi.org/10.3390/data3040057.

Full text

Abstract:

The purpose of this study is to control the ratio of programs of different genres whenforming the broadcast grid in order to increase and maintain the rating of a channel. In themultichannel environment, television rating controls consist of selecting content, the ratings ofwhich are completely restored after advertising. The hybrid approach to rule set refinement basedon fuzzy relational calculus simplifies the process of expert recommendation systems construction.By analogy with the problem of the inverted pendulum control, the managerial actions aim to retainthe balance between the fuzzy demand and supply. The increase or decrease trends of the demandand supply are described by primary fuzzy relations. The rule-based solutions of fuzzy relationalequations connect significance measures of the primary fuzzy terms. Program set refinement bysolving fuzzy relational equations allows avoiding procedures of content-based selective filtering.The solution set generation corresponds to the granulation of television time, where each solutionrepresents the time slot and the granulated rating of the content. In automated media planning,generation of the weekly TV program in the form of the granular solution provides the decrease oftime needed for the programming of the channel broadcast grid.

APA, Harvard, Vancouver, ISO, and other styles

36

Gollier, Christian. "Comment intégrer le risque dans le calcul économique ?" Revue d'économie politique 117, no. 2 (2007): 209. http://dx.doi.org/10.3917/redp.172.0209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Martínez-Ferrer, Belén, and David Moreno Ruiz. "DEPENDENCIA DE LAS REDES SOCIALES VIRTUALES Y VIOLENCIA ESCOLAR EN ADOLESCENTES." International Journal of Developmental and Educational Psychology. Revista INFAD de Psicología. 2, no. 1 (October 22, 2017): 105. http://dx.doi.org/10.17060/ijodaep.2017.n1.v2.923.

Full text

Abstract:

AbstractDEPENDENCE ON ONLINE SOCIAL NETWORKS AND SCHOOL VIOLENCE IN ADOLESCENTS.The empirical evidence suggests that Internet addiction is associated with other behavioral problems such as depressive symptoms, antisocial behavior, and cyberbullying. However, few studies have examined the dependence onOnlineSocial Networks (OSN) and school violence. Therefore, the purpose of the present study was to analyze the relationships between OSN dependency and school violence among peers, considering gender and age. Participants were 1952 adolescents, 50.4% boys, aged between 11 and 16 years old (M age = 14.07, D T = 1.39). A multifactorial MANOVA was calculated. Results showed that adolescents with greater dependence on OSNscored the highest on overt and relational violence (reactive and instrumental). In addition, boys and girls with high dependence on OSN showed similar involvement in relational violence (reactive and instrumental), while boys with high dependence scored the higher than girls onovertviolence (both reactive and instrumental). Finally, the results and their implications are discussed.Key words: dependence, online social networks, overt violence, relational violence, adolescenceResumen.La evidencia empírica sugiere que la adicción a Internet se asocia con otros problemas de conducta como la sintomatología depresiva, la conducta antisocial y el cyberbullying. Sin embargo, son escasos los estudios en los que se examina la dependencia de las redes sociales virtuales (RSV) y la violencia escolar. Por ello, el propósito del presente estudio fue analizar las relaciones existentes entre la dependencia a las RSV y la violencia escolar entre iguales, en función del sexo y de la edad. Participaron 1952 adolescentes 50.4% chicos, con edades comprendidas entre los 11 y 16 años (M edad = 14,07, D T = 1.39). Se calculó un MANOVA multifactorial. Los resultados mostraron que los adolescentes con mayor dependencia de las RSV obtuvieron las puntuaciones más elevadas en violencia manifiesta y relacional (reactiva e instrumental). Además, los chicos y las chicas con alta dependencia de las RSV mostraron una implicación similar en conductas de violencia relacional (reactiva e instrumental), mientras que los chicos con alta dependencia mostraron mayor violencia manifiesta (reactiva e instrumental). Finalmente, se discuten los resultados y sus implicaciones.Palabras clave: dependencia, redes sociales virtuales, violencia manifiesta, violencia relacional, adolescencia

APA, Harvard, Vancouver, ISO, and other styles

38

Yadav, Jyoti, Vilas Kharat, and Ashok Deshpande. "Evidence Theory and Fuzzy Relational Calculus in Estimation of Health Effects Due to Air Pollution." Journal of Intelligent Systems 22, no. 1 (March 1, 2013): 9–23. http://dx.doi.org/10.1515/jisys-2012-0018.

Full text

Abstract:

Abstract.With an overall objective of establishing association between air pollutants and incidence of respiratory diseases, the environmental professionals and medical practitioners have made significant contribution, using statistical mechanics in modelling epidemiological data, population characteristics, and pollution parameters. Broadly speaking, the studies have shown that the increase in vehicular traffic has been one of the causes of respiratory diseases. However, the WHO Centre for Environment and Health, Europe in its 2005 document states: “There is little evidence for a causal relationship between asthma prevalence/incidence and air pollution in general, though the evidence is suggestive of a causal association between the prevalence/incidence of asthma symptoms and living in close proximity to traffic”. Decision making process in a real world is invariably based on perceptions which are expressed in words or may be in numeric terms and not in probability terms. In the paper, we made an attempt to model the perceptions of experienced pulmonologists in arriving at their combined degree of belief/plausibility/ignorance for all the possible combinations of identified respiratory diseases, using evidence theory and fuzzy relational calculus without collecting sizeable parametric data accumulated over a period of years. Tightening pollution norms by the regulatory authorities is an overall objective of the global efforts on greenhouse gases (GHS) reduction in general, and air pollution mitigation in particular. The concept of solar battery operated electric vehicles (SBOEV) for road transport is advocated, initially for two/three wheelers, and extending it to four wheelers, especially in the developing countries.

APA, Harvard, Vancouver, ISO, and other styles

39

Oliveira, José Nuno, and Victor Cacciari Miraldo. "“Keep definition, change category” — A practical approach to state-based system calculi." Journal of Logical and Algebraic Methods in Programming 85, no. 4 (June 2016): 449–74. http://dx.doi.org/10.1016/j.jlamp.2015.11.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Bravetti, Mario, and Gianluigi Zavattaro. "Process calculi as a tool for studying coordination, contracts and session types." Journal of Logical and Algebraic Methods in Programming 112 (April 2020): 100527. http://dx.doi.org/10.1016/j.jlamp.2020.100527.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Silvant, Claire. "Fiscalité et calcul économique au milieu du XIXe siècle français." Revue d'économie politique 120, no. 6 (2010): 1015. http://dx.doi.org/10.3917/redp.206.1015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Terray, Emmanuel. "Violence et calcul. Raymond Aron lecteur de Clausewitz." Revue française de science politique 36, no. 2 (1986): 248–68. http://dx.doi.org/10.3406/rfsp.1986.394245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

AKROUT, Houcine. "A process perspective on trust in buyer–supplier relationships. “Calculus”." European Business Review 27, no. 1 (January 12, 2015): 17–33. http://dx.doi.org/10.1108/ebr-01-2014-0006.

Full text

Abstract:

Purpose – The purpose of this article is to show that, within a process perspective, calculus is not only compliant with trust but also that trust forms are integral to its dynamics. Having demonstrated the theoretical bases of compatibility between reputation, economic interest and trust, and the necessary inclusion of a social context in business-to-business (B2B) exchange, this paper proposes a conceptual framework that will enable us to understand a multi-form concept of trust. Design/methodology/approach – The approach to the topic is one of theoretical analysis and conceptual development. Findings – This proposal indicates that the presence of calculus in the earliest stages of exchange relationships gives way to other forms of trust that are more cognitive and affective in nature. The elucidation of the evolutionary nature of trust shows that calculus and trust theory are complementary and provide, respectively, insight for the whole process. Research limitations/implications – The presented research by incorporating forms and time dimension adds theoretical insights and produces an incremental step toward better understanding of trust dynamics in industrial and business markets. The main challenge to the proposed model will be the empirical test. Practical implications – This conceptualization should help managers understand trust creation better, and provide them with valuable information for understanding the evolution of relationships with suppliers. Segmentation based on relational phases requires tailoring each form of trust strategy, and, hence, accurate identification of a relationship phase could help categorize and subcategorize customers regarding calculative, cognitive or emotional dominant forms of trust. Originality/value – The paper contributes to the discussion on how integrative approaches (calculative and non-calculative) improve our understanding of buyer–supplier relationships and promotes the emergence of a coherent vision of trust evolution.

APA, Harvard, Vancouver, ISO, and other styles

44

Wilkinson, Steven I. "Froids calculs et foules déchaînées. Les émeutes intercommunautaires en Inde." Critique internationale 6, no. 1 (2000): 125–42. http://dx.doi.org/10.3406/criti.2000.1383.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

I. Wilkinson, Steven. "Froids calculs et foules déchaînées. Les émeutes intercommunautaires en Inde." Critique internationale 6, no. 1 (January 1, 2000): 125–42. http://dx.doi.org/10.3917/crii.p2000.6n1.0125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Eymard-Duvernay, François, and Emmanuelle Marchal. "Qui calcule trop finit par déraisonner : les experts du marché du travail." Sociologie du Travail 42, no. 3 (July 2000): 411–32. http://dx.doi.org/10.1016/s0038-0296(00)01088-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Eymard-Duvernay, François, and Emmanuelle Marchal. "Qui calcule trop finit par déraisonner : les experts du marché du travail." Sociologie du travail 42, no. 3 (July 1, 2000): 411–32. http://dx.doi.org/10.4000/sdt.36922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Auzouy, Béatrice, and Carlos Quenan. "Brésil : la crise financière dans les rets du calcul politique." Critique internationale 5, no. 1 (1999): 38–45. http://dx.doi.org/10.3406/criti.1999.1492.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Auzouy, Béatrice, and Carlos Quenan. "Brésil : la crise financière dans les rets du calcul politique." Critique internationale 5, no. 4 (November 1, 1999): 38–45. http://dx.doi.org/10.3917/crii.p1999.5n1.0038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

EHRHARD, THOMAS. "Finiteness spaces." Mathematical Structures in Computer Science 15, no. 4 (July 15, 2005): 615–46. http://dx.doi.org/10.1017/s0960129504004645.

Full text

Abstract:

We investigate a new denotational model of linear logic based on the purely relational model. In this semantics, webs are equipped with a notion of ‘finitary’ subsets satisfying a closure condition and proofs are interpreted as finitary sets. In spite of a formal similarity, this model is quite different from the usual models of linear logic (coherence semantics, hypercoherence semantics, the various existing game semantics…). In particular, the standard fix-point operators used for defining the general recursive functions are not finitary, although the primitive recursion operators are. This model can be considered as a discrete analogue of the Köthe space semantics introduced in a previous paper: we show how, given a field, each finiteness space gives rise to a vector space endowed with a linear topology, a notion introduced by Lefschetz in 1942, and we study the corresponding model where morphisms are linear continuous maps (a version of Girard's quantitative semantics with coefficients in the field). In this way we obtain a new model of the recently introduced differential lambda-calculus.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!