Polarity-based stochastic local search algorithms for non-clausal satisfiability

Authors:
Zbigniew Stachniak
Affiliations:
York University, Toronto M3J 1P3, Canada
Venue:
Beyond two
Year:
2003

Citing 10
Cited 0

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Satisfiability in many-valued sentential logic is NP-complete

Theoretical Computer Science
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
The deductive foundations of computer programming: a one-volume version of “the logical basis for computer programming”

The deductive foundations of computer programming: a one-volume version of “the logical basis for computer programming”
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Resolution proof systems: an algebraic theory

Resolution proof systems: an algebraic theory
Local Search Characteristics of Incomplete SAT Procedures

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Tutorial: Complexity of Many-Valued Logics

ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Exploiting Polarity in Multiple-Valued Inference Systems

ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.