A cascade algorithm for the logical closure of a set of binary relations

DOI10.1016/0020-0190(76)90079-XzbMath0327.90021OpenAlexW2001852623MaRDI QIDQ1226442

Pierre Hansen

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90079-x

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Other classical set theory (including functions, relations, and set algebra) (03E20) Algorithms in computer science (68W99)

Related Items

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs, Polynomial-time inference of all valid implications for Horn and related formulae, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities, Binary integer programs with two variables per inequality, Algorithms for the maximum satisfiability problem, Uniquely solvable quadratic Boolean equations

Cites Work

• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item