Compactly generating all satisfying truth assignments of a Horn formula
classification
💻 cs.LO
math.LO
keywords
compactlyexclusionformulahornmodelsprincipleprogrammingadapted
read the original abstract
As instance of an overarching principle of exclusion an algorithm is presented that compactly (thus not one by one) generates all models of a Horn formula. The principle of exclusion can be adapted to generate only the models of weight $k$. We compare and contrast it with constraint programming, $0,1$ integer programming, and binary decision diagrams.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.