The following pages link to (Q4942636):
Displaying 4 items.
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Propositional distances and compact preference representation (Q1885764) (← links)
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178) (← links)
