Compact normal forms in propositional logic and integer programming formulations

Authors:
J. M. Wilson
Affiliations:
-
Venue:
Computers and Operations Research
Year:
1990

Citing 0
Cited 3

The Propositional Formula Checker HeerHugo

Journal of Automated Reasoning
The Taming of the (X)OR

CL '00 Proceedings of the First International Conference on Computational Logic
A scalable method for solving satisfiability of integer linear arithmetic logic

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.01

Visualization

Abstract