Computing and visualizing Banks sets of dominance relations using relation algebra and RelView

DOI10.1016/J.JLAP.2013.02.001MaRDI QIDQ383785zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

social choice theorybinary decision diagramrelation algebradominance relationBanks setrelation-algebraic specificationRelView tool

Mathematics Subject Classification ID

Social choice (91B14) Directed graphs (digraphs), tournaments (05C20) Symbolic computation and algebraic computation (68W30)

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

Cites work

• scientific article; zbMATH DE number 3976693 (Why is no real title available?)
• scientific article; zbMATH DE number 193143 (Why is no real title available?)
• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
• A relation-algebraic approach to simple games
• Applying relation algebra and RelView to measures in a social network
• Applying relation algebra and RelView to solve problems on orders and lattices
• Applying relational algebra and REL VIEW to coalition formation
• Banks winners in tournaments are difficult to recognize
• Computer Algebra in Scientific Computing
• Exact computation of minimum feedback vertex sets with relational algebra
• Graph-Based Algorithms for Boolean Function Manipulation
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• Relation-algebraic computation of fixed points with applications
• Relation-algebraic modeling and solution of chessboard independence and domination problems
• Relation-algebraic specification and solution of special university timetabling problems
• Sophisticated voting outcomes and agenda control
• Two graph algorithms derived

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

Describes a project that uses

Uses Software

• RelView

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)