Compactly generating all satisfying truth assignments of a Horn formula

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.

💡 Research Summary

This paper introduces an algorithm for efficiently generating all satisfying truth assignments of a Horn formula based on the principle of exclusion. Unlike traditional methods that generate each model individually, this approach compacts multiple models into a single representation, thereby saving space and time. The algorithm can be adapted to selectively generate only those models with a specific weight k, allowing users to filter out unnecessary information and extract precisely what they need.

The paper compares the proposed method with other techniques such as constraint programming, 0-1 integer programming, and binary decision diagrams. It demonstrates that in certain scenarios, especially when dealing with complex conditions, the new algorithm outperforms existing approaches in terms of efficiency. The theoretical analysis is complemented by practical case studies that validate the usefulness of the proposed method.

Experimental results and comparisons are provided to concretely illustrate how this approach surpasses other technologies. By offering a novel way to handle Horn formulas and showcasing its superior performance, the paper provides deep insights into efficient model generation techniques and suggests future research directions in this area.