Relational Methods in Computer Science

DOI10.1007/978-3-7091-6510-2zbMath0871.00027OpenAlexW1964754311MaRDI QIDQ4338907

No author found.

Publication date: 2 June 1997

Full work available at URL: https://doi.org/10.1007/978-3-7091-6510-2

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)

Related Items (48)

ER modelling from first relational principles ⋮ Three-variable statements of set-pairing ⋮ ``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Cryptomorphic topological structures: a computational, relation-algebraic approach ⋮ An interdisciplinary approach to coalition formation ⋮ Convergence: integrating termination and abort-freedom ⋮ Unnamed Item ⋮ Applying relational algebra and REL VIEW to coalition formation ⋮ The calculus of relations as a foundation for mathematics ⋮ Relation-algebraic specification and solution of special university timetabling problems ⋮ Cardinality functions in allegories ⋮ Residuation in existential graphs ⋮ Cardinality in Allegories ⋮ Relational properties of sequential composition of coalgebras ⋮ Gunther Schmidt's life as a mathematician and computer scientist ⋮ Toward a theory of program repair ⋮ A relation-algebraic approach to simple games ⋮ Representation theory of Goguen categories. ⋮ Relational matching for graphical calculi of relations ⋮ Monomorphic characterization of \(n\)-ary direct products ⋮ A relation algebraic approach to interaction categories ⋮ German parliamentary elections 2009 from the viewpoint of direct democracy ⋮ Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types ⋮ Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool ⋮ A Completeness Result for Relation Algebra with Binders ⋮ Stably Compact Spaces and Closed Relations ⋮ Transformations of Concept Graphs: ⋮ Embedding mappings and splittings with applications ⋮ The converse of a stochastic relation ⋮ Dedekind categories with cutoff operators ⋮ Contact, closure, topology, and the linking of row and column types of relations ⋮ Completeness of a relational calculus for program schemes ⋮ Normal forms for binary relations ⋮ Membership values in arrow categories ⋮ Differentiators and detectors ⋮ Cardinality of relations with applications ⋮ NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS ⋮ RALL: Machine-supported proofs for relation algebra ⋮ Applying relation algebra and RelView to measures in a social network ⋮ Evaluation of German parties and coalitions by methods of the mathematical theory of democracy ⋮ Relational demonic fuzzy refinement ⋮ Parallel composition and decomposition of specifications ⋮ A new algebraic approach to L-fuzzy relations convenient to study crispness ⋮ Closure systems and their structure ⋮ Implementing Relational Specifications in a Constraint Functional Logic Language ⋮ Nondeterministic semantics of compound diagrams ⋮ Kleene under a modal demonic star ⋮ Interpretability of first-order linear temporal logics in fork algebras

This page was built for publication: Relational Methods in Computer Science