We present a simple and semantics-preserving transformation over propositional instances which features surprising consequences both on the syntactic structure of the processed instances and on the performance of state-of-the-art solvers. The instances we consider come from a bounded model checking engine applied to real-world problems. The transformation we apply aims at substituting ennary connectives for binary ones whenever possible. Several experimental results are presented and discussed
SAT-Based Cooperative Planning: A Proposal
Benedetti, Marco;Carlucci Aiello, Luigia
2004-01-01
Abstract
We present a simple and semantics-preserving transformation over propositional instances which features surprising consequences both on the syntactic structure of the processed instances and on the performance of state-of-the-art solvers. The instances we consider come from a bounded model checking engine applied to real-world problems. The transformation we apply aims at substituting ennary connectives for binary ones whenever possible. Several experimental results are presented and discussedFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
