Abstract
This paper discusses the use of polarity to guide a stochastic local search for a satisfying assignment for a free-form formula of a finitely-valued propositional logic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Béjar, R.: Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Autènoma de Barcelona (2000)
Béjar, R. and Manyà, F.: Solving combinatorial problems with regular local search algorithms. Proc. 6th Int. Conf. on Logic for Programming and Automated Reasoning, LPAR-99, Springer LNAI 1705 (1999) 33–43
Du, D., Gu, J. and Pardalos, P. editors: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, American Mathematical Society (1997)
Johnson, D., Aragon, C. and McGeoch, L.: Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partioning. Operations Research, 39 (1991) 378–406
Hähnle, R.: Complexity of Many-Valued Logics. Proc. of the 31st IEEE Int. Symp. on Multiple-Valued Logic (2001) 137–146
Manna, Z. and Waldinger, R.: The Deductive Foundations of Computer Programming. Eddison-Wesley (1993)
McAllester, D., Selman, B. and Kautz, H.: Evidence for invariants in local search. Proc. AAAI-97 (1997) 321–326
Mitchell, D., Selman, B. and Levesque, H.: Hard and Easy Distribution of SAT Problems. Proc. AAAI-92 (1992) 459–465
Mundici, D.: Satisfiability in Many-Valued Sentential Logics is NP-Complete. Theoretical Computer Science, 52 (1987) 145–153
Murray, N.: Completely Non-Clausal Theorem Proving. Artificial Intelligence, 18 (1982) 67–85
Plaisted, D. and Greenbaum, S.: A structure-preserving clause form translation. J. of Symbolic Computation, 2 (1986) 293–304
Schuurmans, D. and Southey, F.: Local search characteristics of incomplete SAT procedures. Proc. AAAI-2000 (2000) 297–302
Sebastiani, R.: Applying GSAT to non-clausal formulas. J. of Artificial Intelligence Research, 1 (1994) 309–314
Selman, B., Levesque, H. and Mitchell, D.: A new method for solving hard satisfiability problems. Proc. AAAI-92 (1992) 440–446
Selman, B., Kautz, H. and Cohen, B.: Noise strategies for improving local search. Proc. AAAI-94 (1994) 337–343
Stachniak, Z.: Exploiting Polarity in Multiple-Valued Inference Systems. Proc. of the 31st IEEE Int. Symp. on Multiple-Valued Logic (2001) 149–156
Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stachniak, Z. (2003). Polarity-based Stochastic Local Search Algorithms for Non-clausal Satisfiability. In: Fitting, M., Orłowska, E. (eds) Beyond Two: Theory and Applications of Multiple-Valued Logic. Studies in Fuzziness and Soft Computing, vol 114. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1769-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1769-0_7
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2522-0
Online ISBN: 978-3-7908-1769-0
eBook Packages: Springer Book Archive