relational calculus
Recently Published Documents


TOTAL DOCUMENTS

117
(FIVE YEARS 1)

H-INDEX

14
(FIVE YEARS 1)

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-28 ◽  
Author(s):  
Ugo Dal Lago ◽  
Francesco Gavazzo

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent, usage-sensitive computations, especially when combined with computational effects. From a semantic perspective, effectful and coeffectful languages have been studied mostly by means of denotational semantics and almost nothing has been done from the point of view of relational reasoning. This gap in the literature is quite surprising, since many cornerstone results — such as non-interference , metric preservation , and proof irrelevance — on concrete coeffects are inherently relational. In this paper, we fill this gap by developing a general theory and calculus of program relations for higher-order languages with combined effects and coeffects. The relational calculus builds upon the novel notion of a corelator (or comonadic lax extension ) to handle coeffects relationally. Inside such a calculus, we define three notions of effectful and coeffectful program refinements: contextual approximation , logical preorder , and applicative similarity . These are the first operationally-based notions of program refinement (and, consequently, equivalence) for languages with combined effects and coeffects appearing in the literature. We show that the axiomatics of a corelator (together with the one of a relator) is precisely what is needed to prove all the aforementioned program refinements to be precongruences, this way obtaining compositional relational techniques for reasoning about combined effects and coeffects.



Author(s):  
Fredi Edgardo Palominos ◽  
Felisa Córdova ◽  
Claudia Durán ◽  
Bryan Nuñez

OLAP and multidimensional database technology have contributed significantly to speed up and build confidence in the effectiveness of methodologies based on the use of management indicators in decision-making, industry, production, and services. Although there are a wide variety of tools related to the OLAP approach, many implementations are performed in relational database systems (R-OLAP). So, all interrogation actions are performed through queries that must be reinterpreted in the SQL language. This translation has several consequences because SQL language is based on a mixture of relational algebra and tuple relational calculus, which conceptually responds to the logic of the relational data model, very different from the needs of the multidimensional databases. This paper presents a multidimensional query language that allows expressing multidimensional queries directly over ROLAP databases. The implementation of the multidimensional query language will be done through a middleware that is responsible for mapping the queries, hiding the translation to a layer of software not noticeable to the end-user. Currently, progress has been made in the definition of a language where through a key statement, called aggregate, it is possible to execute the typical multidimensional operators which represent an important part of the most frequent operations in this type of database.



Data ◽  
2018 ◽  
Vol 3 (4) ◽  
pp. 57 ◽  
Author(s):  
Olexiy Azarov ◽  
Leonid Krupelnitsky ◽  
Hanna Rakytyanska

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.



2018 ◽  
Vol 971 ◽  
pp. 012001 ◽  
Author(s):  
Mohammad Deni Akbar ◽  
Yoshihiro Mizoguchi ◽  
Adiwijaya


2018 ◽  
pp. 3147-3149
Author(s):  
Val Tannen
Keyword(s):  


2018 ◽  
pp. 4032-4033
Author(s):  
Jan Chomicki ◽  
David Toman
Keyword(s):  


Author(s):  
Charalampos Nikolaou ◽  
Egor V. Kostylev ◽  
George Konstantinidis ◽  
Mark Kaminski ◽  
Bernardo Cuenca Grau ◽  
...  

Ontology-based data access (OBDA) is a popular approach for integrating and querying multiple data sources by means of a shared ontology. The ontology is linked to the sources using mappings, which assign views over the data to ontology predicates. Motivated by the need for OBDA systems supporting database-style aggregate queries, we propose a bag semantics for OBDA, where duplicate tuples in the views defined by the mappings are retained, as is the case in standard databases. We show that bag semantics makes conjunctive query answering in OBDA coNP-hard in data complexity. To regain tractability, we consider a rather general class of queries and show its rewritability to a generalisation of the relational calculus to bags.



2016 ◽  
Vol 48 ◽  
pp. 83-104 ◽  
Author(s):  
Mohammad Deni Akbar ◽  
Yoshihiro Mizoguchi


2016 ◽  
Vol 25 (2) ◽  
pp. 283-295 ◽  
Author(s):  
Anjali Sardesai ◽  
Vilas Kharat ◽  
Pradip Sambarey ◽  
Ashok Deshpande

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.



Sign in / Sign up

Export Citation Format

Share Document