Relational Methods in Computer Science
From MaRDI portal
Publication:5899306
DOI10.1007/11734673zbMATH Open1185.03090OpenAlexW2482623798MaRDI QIDQ5899306FDOQ5899306
Authors: Rudolf Berghammer, Ulf Milanese
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11734673
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Cylindric and polyadic algebras; relation algebras (03G15)
Cited In (14)
- Applying relation algebra and RelView to solve problems on orders and lattices
- A computational model of relational algebra
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Column-wise extendible vector expressions and the relational computation of sets of sets
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
- Implementing relational specifications in a constraint functional logic language
- Multi-objective Problems in Terms of Relational Algebra
- Title not available (Why is that?)
- Preparing relational algebra for ``just good enough hardware
- The Boolean solution problem from the perspective of predicate logic
- How to augment a formal system with a Boolean algebra component
- A relation-algebraic approach to simple games
Uses Software
This page was built for publication: Relational Methods in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899306)