Relevant bibliographies by topics / Relational calculi

Contents

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

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Relational calculi"

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
More sources

Dissertations / Theses on the topic "Relational calculi"

1

Zhou, Y. "A graphical calculus : extension, implication and application." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365370.

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

Roocks, Patrick [Verfasser], and Bernhard [Akademischer Betreuer] Möller. "Relational and Algebraic Calculi for Database Preferences / Patrick Roocks. Betreuer: Bernhard Möller." Augsburg : Universität Augsburg, 2016. http://d-nb.info/1112465863/34.

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

Yang, Liqun. "Logical relation categories and lambda calculi." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9876.

Full text
Abstract:
An aspect of programming languages is the study of the operational semantics, which, in the case of a lambda calculus, is based on a directed form of equational reasoning called reduction. In computer science terminology, reduction may be regarded as a form of symbolic evaluation. It models a sequential computation process step by step. The crucial properties for a rewriting system are confluence, also called the Church-Rosser property and termination, the (Strong) normalization property, respectively. These are studied in depth in Chapter 2 and 6. The problem whether all $\lambda$-terms satisfy termination corresponds to the halting problem. From a different point of view, studying the problem of both Church-Rosser and strong normalization corresponds to, in a particular field, studying the word problem. The notion of categories is familiar to mathematicians as a branch of algebra. It has been developed quite rapidly in less than 40 years. In particular, recently more and more computer scientists are using categories for their own purposes. It is the connection between categories and $\lambda$-calculi that interests computer scientists. This connection is a thread that goes through the whole thesis. (Abstract shortened by UMI.)
APA, Harvard, Vancouver, ISO, and other styles
4

Inants, Armen. "Qualitative calculi with heterogeneous universes." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAMO10/document.

Full text
Abstract:
Représentation et raisonnement qualitatifs fonctionnent avec des relations non-numériques entre les objets d'un univers. Les formalismes généraux développés dans ce domaine sont basés sur différents types d'algèbres de relations, comme les algèbres de Tarski. Tous ces formalismes, qui sont appelés des calculs qualitatifs, partagent l'hypothèse implicite que l'univers est homogène, c'est-à-dire qu'il se compose d'objets de même nature. Toutefois, les objets de différents types peuvent aussi entretenir des relations. L'état de l'art du raisonnement qualitatif ne permet pas de combiner les calculs qualitatifs pour les différents types d'objets en un seul calcul.De nombreuses applications discriminent entre différents types d'objets. Par exemple, certains modèles spatiaux discriminent entre les régions, les lignes et les points, et différentes relations sont utilisées pour chaque type d'objets. Dans l'alignement d'ontologies, les calculs qualitatifs sont utiles pour exprimer des alignements entre un seul type d'entités, telles que des concepts ou des individus. Cependant, les relations entre les individus et les concepts, qui imposent des contraintes supplémentaires, ne sont pas exploitées.Cette thèse introduit la modularité dans les calculs qualitatifs et fournit une méthodologie pour la modélisation de calculs qualitatifs des univers hétérogènes. Notre contribution principale est un cadre basé sur une classe spéciale de schémas de partition que nous appelons modulaires. Pour un calcul qualitatif engendré par un schéma de partition modulaire, nous définissons une structure qui associe chaque symbole de relation avec un domaine et codomain abstrait à partir d'un treillis booléen de sortes. Un module d'un tel calcul qualitatif est un sous-calcul limité à une sorte donnée, qui est obtenu par une opération appelée relativisation à une sorte. D'un intérêt pratique plus grand est l'opération inverse, qui permet de combiner plusieurs calculs qualitatifs en un seul calcul. Nous définissons une opération appelée combinaison modulo liaison, qui combine deux ou plusieurs calculs qualitatifs sur différents univers, en fonction de quelques relations de liaison entre ces univers. Le cadre est suffisamment général pour soutenir la plupart des calculs spatio-temporels qualitatifs connus
Qualitative representation and reasoning operate with non-numerical relations holding between objects of some universe. The general formalisms developed in this field are based on various kinds of algebras of relations, such as Tarskian relation algebras. All these formalisms, which are called qualitative calculi, share an implicit assumption that the universe is homogeneous, i.e., consists of objects of the same kind. However, objects of different kinds may also entertain relations. The state of the art of qualitative reasoning does not offer a combination operation of qualitative calculi for different kinds of objects into a single calculus.Many applications discriminate between different kinds of objects. For example, some spatial models discriminate between regions, lines and points, and different relations are used for each kind of objects. In ontology matching, qualitative calculi were shown useful for expressing alignments between only one kind of entities, such as concepts or individuals. However, relations between individuals and concepts, which impose additional constraints, are not exploited.This dissertation introduces modularity in qualitative calculi and provides a methodology for modeling qualitative calculi with heterogeneous universes. Our central contribution is a framework based on a special class of partition schemes which we call modular. For a qualitative calculus generated by a modular partition scheme, we define a structure that associates each relation symbol with an abstract domain and codomain from a Boolean lattice of sorts. A module of such a qualitative calculus is a sub-calculus restricted to a given sort, which is obtained through an operation called relativization to a sort. Of a greater practical interest is the opposite operation, which allows for combining several qualitative calculi into a single calculus. We define an operation called combination modulo glue, which combines two or more qualitative calculi over different universes, provided some glue relations between these universes. The framework is general enough to support most known qualitative spatio-temporal calculi
APA, Harvard, Vancouver, ISO, and other styles
5

Diepenveen, Emily. "Relational models of the lambda calculus." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27679.

Full text
Abstract:
In [7], Ehrhard et al. present a model of the untyped lambda calculus built from an object without enough points in a cartesian closed category MRel. This thesis presents the background needed to construct and understand this model. In particular we describe what it means for models to have enough points and exhibit connections between MRel with various categorical models of lambda calculus in the literature. In particular, we are able to relate the graph model to MRel. We also describe connections with various kinds of Kleisli categories arising from comonads and their associated theory.
APA, Harvard, Vancouver, ISO, and other styles
6

Legrand, Rémi. "Calcul relationnel et programmation en logique." Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37607205b.

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

Legrand, Rémi. "Calcul relationnel et programmation en logique." Paris 6, 1987. http://www.theses.fr/1987PA066481.

Full text
Abstract:
Presentation d'un systeme de programmation en logique base sur le calcul relationnel: description du langage sans variable graal et son extension relationnelle grel; definition des relations; introduction des indeterminees, decomposees en inconnues et gelees dans la programmation fonctionnelle; presentation de prolog et de ses contraintes; construction du langage logique relog a partir de grel, a l'aide d'un orienteur
APA, Harvard, Vancouver, ISO, and other styles
8

Yemane, Kidane. "Relations in Models of Calculi and Logics with Names." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6245.

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

Ruoppolo, Domenico. "Relational graph models and Morris's observability : resource-sensitive semantic investigations on the untyped λ-calculus." Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCD069/document.

Full text
Abstract:
La thèse contribue à l’étude du λ-calcul non-typé de Church, un système de réécriture dont la règle principale est la β-réduction (formalisant l’exécution d’un programme). Nous nous concentrons sur la sémantique dénotationnelle, l’étude de modèles du λ-calcul interprétant de la même façon les λ-termes β-convertibles. On examine la sémantique relationnelle, une sémantique sensible aux ressources qui interprète les λ-termes comme des relations avec les entrées regroupées en multi-ensembles. Nous définissons une classe de modèles relationnels, les modèles de graphe relationnels (rgm’s), que nous étudions avec une approche issue de la théorie des types et de la démonstration, par le biais de certains systèmes de types avec intersection non-idémpotente. D’abord, nous découvrons la plus petite et la plus grande λ–théorie (théorie équationnelle étendant la β-conversion) représentées dans la classe. Ensuite, nous utilisons les rgm’s afin de résoudre le problème de l’adéquation complète pour la λ–théorie observationnelle de Morris, à savoir l’équivalence contextuelle de programmes que l’on obtient lorsqu’on prend les β-formes normales comme sorties observables. On résoudre le problème de différentes façons. En caractérisant la β-normalisabilité avec les types, nous découvrons une infinité de rgm’s complètement adéquats, que nous appelons uniformément sans fond. Puis, nous résolvons le problème de façon exhaustive, en prouvant qu’un rgm est complètement adéquat pour l’observabilité de Morris si et seulement si il est extensionnel (il modèle l’ŋ-conversion) et λ-König. Moralement un rgm est λ-König si tout arbre récursif infini a une branche infinie témoignée par un type non-bien-fondé
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem having the β-reduction (the formal counterpart of the idea of execution of programs) asmain rule. The focus is on denotational semantics, namely the investigation of mathematical models of the λ-calculus giving the same denotation to β-convertible λ-terms. We investigate relational semantics, a resource-sensitive semantics interpreting λ-terms as relations,with their inputs grouped together in multisets. We define a large class of relational models,called relational graph models (rgm’s), and we study them in a type/proof-theoretical way, using some non-idempotent intersection type systems. Firstly, we find the minimal and maximal λ-theories (equational theories extending -conversion) represented by the class.Then we use rgm’s to solve the full abstraction problem for Morris’s observational λ-theory,the contextual equivalence of programs that one gets by taking the β-normal forms asobservable outputs. We solve the problem in different ways. Through a type-theoretical characterization of β-normalizability, we find infinitely many fully abstract rgm’s, that wecall uniformly bottomless.We then give an exhaustive answer to the problem, by showing thatan rgm is fully abstract for Morris’s observability if and only if it is extensional (a model of ŋ-conversion) and λ-König. Intuitively an rgm is λ-König when every infinite computable tree has an infinite branch witnessed by some type of the model, where the witnessing is a property of non-well-foundedness on the type
APA, Harvard, Vancouver, ISO, and other styles
10

Jason, Ludovic. "Relation endommagement perméabilité pour les bétons : application aux calculs de structures." Nantes, 2004. http://www.theses.fr/2004NANT2078.

Full text
Abstract:
Connaître la relation entre la dégradation du béton et sa perméabilité est un objectif central pour évaluer les conséquences d'un chargement mécanique sur l'étanchéité de structures sensibles comme les enceintes de confinement de centrales nucléaires. Une loi de comportement mécanique prenant en compte l'endommagement et la plasticité du matériau et s'appuyant sur la théorie des milieux continus est tout d'abord développée. Le modèle, validé sur des tests élémentaires, structurels et préindustriel s'appuie sur des outils numériquement robustes (opérateur tangent cohérent). Une loi reliant le degré de saturation (séchage), l'endommagement et la perméabilité est ensuite proposée. Enfin, les résultats sont rassemblés afin d'être appliqués au comportement hydraulique d'une partie courante d'enceinte de confinement. Une mise en pression de la structure est ainsi simulée pour mettre en évidence l'influence des chargements hydriques et mécaniques sur le comportement hydraulique
The relation between damage and permeability is of great importance to evaluate the consequences of a mechanical loading on the hydraulic integrity of sensitive concrete structures like containment buildings of nuclear power plants. An elastic plastic damage constitutive law for the mechanical behaviour is first developed. The model is validated on elementary and structural applications with a special focus on the efficiency of the numerical tools (tangent matrices). A relation between water saturation (drying), damage and permeability is then proposed, based on theoretical and experimental observations. Finally, a Representative Structural Volume of a containment vessel is studied to highlight the influence of hygro - mechanical loading on the hydraulic behaviour (distribution of gas pressure)
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Relational calculi"

1

Bimbó, Katalin. Generalized Galois logics: Relational semantics of nonclassical logical calculi. Stanford, Calif: Center for the Study of Language and Information, Leland Stanford Junior University, 2008.

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

Yordan, Kyosev, ed. Fuzzy relational calculus: Theory, applications and software (with CD-ROM). New Jersey: World Scientific, 2004.

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

Peeva, Ketty. Fuzzy relational calculus: Theory, applications and software (with CD-ROM). Singapore: World Scientific, 2005.

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

International, ASM, ed. Relational analysis: Guidelines for estimating the high- and low-temperature properties of metals. Materials Park, Ohio: ASM International, 2011.

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

A calculus of power: [grand strategy in the twenty-first century]. London: Verso, 2010.

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

Beil, R. G. A triadic theory of elementary particle interactions and quantum computation. Lubbock, TX: Institute for Studies in Pragmaticism, 2006.

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

Young, Thomas-Durell. The new European security calculus: Implications for the U.S. Army. Carlisle Barracks, PA: Strategic Studies Institute, U.S. Army War College, 1991.

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

Young, Thomas-Durell. The new European security calculus: Implication for the U.S. Army. Washington: U.S. G.P.O., 1991.

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

Producing security: Multinational corporations, globalization, and the changing calculus of conflict. Princeton, N.J: Princeton University Press, 2005.

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

United States. Congress. Senate. Committee on Foreign Relations. The North Korean nuclear calculus: Beyond the six-power talks : hearing before the Committee on Foreign Relations, United States Senate, One Hundred Eighth Congress, second session, March 2, 2004. Washington: U.S. G.P.O., 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Relational calculi"

1

Schmidt, Renate A. "Synthesising Terminating Tableau Calculi for Relational Logics." In Relational and Algebraic Methods in Computer Science, 40–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21070-9_3.

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

Goyal, Deepak, and Robert Paige. "The Formal Reconstruction and Speedup Of The Linear Time Fragment Of Willard’s Relational Calculus Subset." In Algorithmic Languages and Calculi, 382–414. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-0-387-35264-0_15.

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

van Berkel, Kees, and Tim Lyon. "Cut-Free Calculi and Relational Semantics for Temporal STIT Logics." In Logics in Artificial Intelligence, 803–19. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19570-0_52.

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

Foster, Simon, Jonathan Julián Huerta y Munive, and Georg Struth. "Differential Hoare Logics and Refinement Calculi for Hybrid Systems with Isabelle/HOL." In Relational and Algebraic Methods in Computer Science, 169–86. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43520-2_11.

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

Hausmann, Daniel, and Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints." In Tools and Algorithms for the Construction and Analysis of Systems, 38–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.

Full text
Abstract:
AbstractIt is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires $$\mathcal {O}(n^{\frac{k}{2}})$$ O ( n k 2 ) iterations of the function. Calude et al.’s recent quasipolynomial-time parity game solving algorithm essentially shows how to compute the same fixpoint in only quasipolynomially many iterations by reducing parity games to quasipolynomially sized safety games. Universal graphs have been used to modularize this transformation of parity games to equivalent safety games that are obtained by combining the original game with a universal graph. We show that this approach naturally generalizes to the computation of solutions of systems of any fixpoint equations over finite lattices; hence, the solution of fixpoint equation systems can be computed by quasipolynomially many iterations of the equations. We present applications to modal fixpoint logics and games beyond relational semantics. For instance, the model checking problems for the energy $$\mu $$ μ -calculus, finite latticed $$\mu $$ μ -calculi, and the graded and the (two-valued) probabilistic $$\mu $$ μ -calculus – with numbers coded in binary – can be solved via nested fixpoints of functions that differ substantially from the function for parity games but still can be computed in quasipolynomial time; our result hence implies that model checking for these $$\mu $$ μ -calculi is in $$\textsc {QP}$$ QP . Moreover, we improve the exponent in known exponential bounds on satisfiability checking.
APA, Harvard, Vancouver, ISO, and other styles
6

Weik, Martin H. "relational calculus." In Computer Science and Communications Dictionary, 1456. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_15923.

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

Tannen, Val. "Relational Calculus." In Encyclopedia of Database Systems, 3147–49. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_972.

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

Tannen, Val. "Relational Calculus." In Encyclopedia of Database Systems, 2370–71. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_972.

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

Foster, Elvis C., and Shripad V. Godbole. "Relational Calculus." In Database Systems, 149–62. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4842-0877-9_8.

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

Tannen, Val. "Relational Calculus." In Encyclopedia of Database Systems, 1–2. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_972-2.

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

Conference papers on the topic "Relational calculi"

1

Laird, Jim, Giulio Manzonetto, Guy McCusker, and Michele Pagani. "Weighted Relational Models of Typed Lambda-Calculi." In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.36.

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

Rauch, Jan. "Many Sorted Observational Calculi for Multi-Relational Data Mining." In Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06). IEEE, 2006. http://dx.doi.org/10.1109/icdmw.2006.106.

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

Hoang, Ha, and Ladislav J. Kohout. "Proof System for Enriched Fuzzy BK Relational Calculi: Pt. 1 - Transforming Notations." In 2007 IEEE International Fuzzy Systems Conference. IEEE, 2007. http://dx.doi.org/10.1109/fuzzy.2007.4295622.

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

Wong, Limsoon. "A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator." In the 32nd symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2463664.2463670.

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

He, Jifeng. "Hybrid Relation Calculus." In 2013 18th International Conference on Engineering of Complex Computer Systems (ICECCS). IEEE, 2013. http://dx.doi.org/10.1109/iceccs.2013.10.

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

Deni Akbar, Mohammad, and Yoshihiro Mizoguchi. "Formal equivalence classes model of fuzzy relational databases using relational calculus." In 2017 International Conference on Applied Computer and Communication Technologies (ComCom). IEEE, 2017. http://dx.doi.org/10.1109/comcom.2017.8167090.

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

Watters, Aaron. "Interpreting a reconstructed relational calculus (extended abstract)." In the 1993 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/170035.170089.

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

Van Gelder, A., and R. Topor. "Safety and correct translation of relational calculus formulas." In the sixth ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/28659.28693.

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

De Roeck, A. N., and B. G. T. Lowden. "Generating English paraphrases from formal relational calculus expressions." In the 11th coference. Morristown, NJ, USA: Association for Computational Linguistics, 1986. http://dx.doi.org/10.3115/991365.991534.

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

Mossakowski, Till, and Reinhard Moratz. "Relations Between Spatial Calculi About Directions and Orientations (Extended Abstract)." 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/718.

Full text
Abstract:
A qualitative representation of space and/or time provides mechanisms which characterize the essential properties of objects or configurations. The advantages over quantitative representations can be: (1) a better match with human concepts related to natural language, and (2) better efficiency for reasoning. The two main trends in qualitative spatial constraint reasoning are topological reasoning about regions and reasoning about directions between points and straight lines and orientations of straight lines or configurations derived from points. In this work, we apply universal algebraic tools to binary qualitative calculi and their relations.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Relational calculi"

1

Pratt, Vaughan R. Second Calculus of Binary Relations as a Concurrent Programming Language. Fort Belvoir, VA: Defense Technical Information Center, August 1997. http://dx.doi.org/10.21236/ada329349.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Relational calculi' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography