Lifted Unit Propagation for Effective Grounding

Details Lifted Unit Propagation for Effective Grounding Lifted Unit Propagation for Effective Grounding

2011-09-06

arxiv.org/abs/1109.1317v1

Computer Science

Logic in Computer Science

Appears in the Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Manag

Scientific paper

A grounding of a formula $\phi$ over a given finite domain is a ground formula which is equivalent to $\phi$ on that domain. Very effective propositional solvers have made grounding-based methods for problem solving increasingly important, however for realistic problem domains and instances, the size of groundings is often problematic. A key technique in ground (e.g., SAT) solvers is unit propagation, which often significantly reduces ground formula size even before search begins. We define a "lifted" version of unit propagation which may be carried out prior to grounding, and describe integration of the resulting technique into grounding algorithms. We describe an implementation of the method in a bottom-up grounder, and an experimental study of its performance.

Affiliated with

Also associated with

No associations

Rating

Lifted Unit Propagation for Effective Grounding 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 Lifted Unit Propagation for Effective Grounding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lifted Unit Propagation for Effective Grounding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305340