Local-search techniques for propositional logic extended with cardinality constraints

Details Local-search techniques for propositional logic extended with cardinality constraints Local-search techniques for propositional logic extended with cardinality constraints

2003-10-31

arxiv.org/abs/cs/0310061v1

Computer Science

Artificial Intelligence

Proceedings of the 9th International Conference on Pronciples and Practice of Constraint Programming - CP 2003, LNCS 2833, pp.

Scientific paper

We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardinalities of sets. Adding cardinality atoms to the language of propositional logic facilitates modeling search problems and often results in concise encodings. We propose two ``native'' local-search solvers for theories in the extended language. We also describe techniques to reduce the problem to standard propositional satisfiability and allow us to use off-the-shelf SAT solvers. We study these methods experimentally. Our general finding is that native solvers designed specifically for the extended language perform better than indirect methods relying on SAT solvers.

Affiliated with

Also associated with

No associations

Rating

Local-search techniques for propositional logic extended with cardinality constraints 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 Local-search techniques for propositional logic extended with cardinality constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local-search techniques for propositional logic extended with cardinality constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635111