Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings

DOI10.1007/s10817-005-9011-0zbMath1109.68109OpenAlexW2144163060MaRDI QIDQ862408

Peter W. Nightingale, Timothy J. Peugniez, Anthony J. Doggett, Alan M. Frisch

Publication date: 24 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-005-9011-0

zbMATH Keywords

search spaces

Mathematics Subject Classification ID

Searching and sorting (68P10) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Automatic generation of redundant models for permutation constraint satisfaction problems ⋮ Programming for modular reconfigurable robots ⋮ A lower bound on CNF encodings of the at-most-one constraint ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ Propagation complete encodings of smooth DNNF theories

Uses Software

• CSPLib
• Walksat
• WSAT(OIP)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding partial Steiner triple systems is NP-complete
• Control abstractions for local search
• Integer optimization by local search. A domain-independent approach
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving

This page was built for publication: Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings