Implementing PS-Merge Operator

Macías, Verónica Borja; Parra, Pilar Pozos

doi:10.1007/978-3-642-05258-3_4

Cited by 5 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the evaluation of this implementation was limited to instances containing less than 20 variables. (Macías and Pozos Parra 2009) shows how to translate a similar (yet simplified) timetabling problem as the one we considered, into a merging problem. This work departs significantly from our own one and suffers from a number of limitations.…”

Section: Other Related Workmentioning

confidence: 99%

SAT Encodings for Distance-Based Belief Merging Operators

Konieczny

Lagniez

Marquis

2017

AAAI

View full text Add to dashboard Cite

We present SAT encoding schemes for distance-based belief merging operators relying on the (possibly weighted) drastic distance or the Hamming distance between interpretations, and using sum, GMax (leximax) or GMin (leximin) as aggregation function. In order to evaluate these encoding schemes, we generated benchmarks of a time-tabling problem and translated them into belief merging instances. Then, taking advantage of these schemes, we compiled the merged bases of the resulting instances into query-equivalent CNF formulae. Experiments have shown the benefits which can be gained by considering the SAT encoding schemes we pointed out. Especially, thanks to them, we succeeded in computing query-equivalent formulae for merging instances based on hundreds of variables, which are out of reach of previous implementations.

show abstract

Section: Other Related Workmentioning

confidence: 99%