Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
DOI10.1007/S10817-005-9011-0zbMATH Open1109.68109OpenAlexW2144163060MaRDI QIDQ862408FDOQ862408
Authors: Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter W. Nightingale 
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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10) Logic in artificial intelligence (68T27)
Cites Work
- A machine program for theorem-proving
- Balance and filtering in structured satisfiable problems. (Preliminary report)
- Integer optimization by local search. A domain-independent approach
- Embedding partial Steiner triple systems is NP-complete
- Control abstractions for local search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
Cited In (9)
- Speeding up the constraint-based method in difference logic
- Theory and Applications of Satisfiability Testing
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
- Programming for modular reconfigurable robots
- A first polynomial non-clausal class in many-valued logic
- Propagation complete encodings of smooth DNNF theories
- Automatic generation of redundant models for permutation constraint satisfaction problems
- Title not available (Why is that?)
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
Uses Software
This page was built for publication: Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862408)
