Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings-Reference-Cited by-同舟云学术

Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings

Published:2006-01-19 Issue:1-3 Volume:35 Page:143-179
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

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

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10817-005-9011-0.pdf

Reference38 articles.

1. Achlioptas, D., Gomes, C. P., Kautz, H. A. and Selman, B. (2000) Generating satisfiable problem instances, in Proc. of the Seventeenth National Conf. on Artificial Intelligence, pp. 256–261.

2. Béjar, R. (2000) Systematic and Regular Search Algorithms for Regular-SAT. Ph.D. thesis, Universitat Autonòma de Barcelona.

3. Béjar, R. and Manyà, F. (1999a) A comparison of systematic and local search algorithms for regular CNF formulas, in A. Hunter and S. Parsons (eds.), Proc. Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU’99, London, UK, Vol. 1638 of Lecture Notes in Artificial Intelligence, pp. 22–31.

4. Béjar, R. and Manyà, F. (1999b) Solving combinatorial problems with regular local search algorithm, in H. Ganzinger and D. McAllester (eds.), Proc. 6th Int. Conference on Logic for Programming and Automated Reasoning, LPAR, Tbilisi, Georgia, Vol. 1705 of Lecture Notes in Artificial Intelligence, pp. 33–43.

5. Béjar, R. and Manyà, F. (2000) Solving the round robin problem using propositional logic, in Proc. of the Seventeenth National Conf. on Artificial Intelligence, pp. 261–266.

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Investigating the Existence of Holey Latin Squares via Satisfiability Testing;PRICAI 2023: Trends in Artificial Intelligence;2023-11-10

2. Fractional Encoding of At-Most-K Constraints on SAT;Electronics;2023-07-25

3. Encoding the At-Most-One Constraint for QUBO and Quantum Annealing: Experiments with the N-Queens problem;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15

4. A first polynomial non-clausal class in many-valued logic;Fuzzy Sets and Systems;2023-03

5. Propagation complete encodings of smooth DNNF theories;Constraints;2022-06-03