Compactly generating all satisfying truth assignments of a Horn formula

Details Compactly generating all satisfying truth assignments of a Horn formula Compactly generating all satisfying truth assignments of a Horn formula

2010-12-08

arxiv.org/abs/1012.1769v2

Computer Science

Logic in Computer Science

Considerably improves upon the readibility of the previous version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Compactly generating all satisfying truth assignments of a Horn formula does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compactly generating all satisfying truth assignments of a Horn formula, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compactly generating all satisfying truth assignments of a Horn formula will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558672