A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q325411 |
Changed an Item |
||
Property / author | |||
Property / author: Michel Minoux / rank | |||
Normal rank |
Revision as of 07:08, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities |
scientific article |
Statements
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (English)
0 references
1986
0 references
Boolean inequalities
0 references
implication graph
0 references
depth-first search
0 references
strongly connected components
0 references
transitive closure
0 references
0-1
0 references
programming
0 references
binary relations
0 references
Boolean variables
0 references
logical conclusion
0 references