Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
DOI10.1016/J.JLAP.2013.02.001zbMATH Open1278.91049OpenAlexW2031951122WikidataQ114851540 ScholiaQ114851540MaRDI QIDQ383785FDOQ383785
Authors: Rudolf Berghammer 
Publication date: 6 December 2013
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2013.02.001
Recommendations
- Algebraic Visualization of Relations Using RelView
- Computer Algebra in Scientific Computing
- Computing and Visualizing Closure Objects Using Relation Algebra and RelView
- Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
- Applying relation algebra and RelView to solve problems on orders and lattices
- Relational computation of sets of relations
- Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
- Dependences between domain constructions in heterogeneous relation algebras
- Computing and Visualizing Lattices of Subgroups Using Relation Algebra and RelView
- Relation algebra, RelView, and plurality voting
social choice theorybinary decision diagramrelation algebradominance relationBanks setrelation-algebraic specificationRelView tool
Social choice (91B14) Directed graphs (digraphs), tournaments (05C20) Symbolic computation and algebraic computation (68W30)
Cites Work
- Computer Algebra in Scientific Computing
- Graph-Based Algorithms for Boolean Function Manipulation
- Sophisticated voting outcomes and agenda control
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applying relation algebra and RelView to measures in a social network
- Title not available (Why is that?)
- Banks winners in tournaments are difficult to recognize
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- Two graph algorithms derived
- Relation-algebraic modeling and solution of chessboard independence and domination problems
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- Exact computation of minimum feedback vertex sets with relational algebra
- Relation-algebraic specification and solution of special university timetabling problems
- A relation-algebraic approach to simple games
- Relation-algebraic computation of fixed points with applications
- Applying relational algebra and REL VIEW to coalition formation
- Applying relation algebra and RelView to solve problems on orders and lattices
Cited In (5)
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- Computing minimal extending sets by relation-algebraic modeling and development
- Column-wise extendible vector expressions and the relational computation of sets of sets
- Control of Condorcet voting: complexity and a relation-algebraic approach
- Computing tournament solutions using relation algebra and RelView
Uses Software
This page was built for publication: Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383785)
