|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'585
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Compactly generating all satisfying truth assignments of a Horn formula | | Marcel Wild
; | | Date: |
8 Dec 2010 | | 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. | | Source: | arXiv, 1012.1769 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER