An example of the satisfiability problem in the continuous structure

• Autorzy: Balcer, Marek
• Języki publikacji: EN

Abstrakty

EN

The paper presents and demonstrates the theorem showing the equivalence of the problem of the verifiability test of a logical expression in the discrete model N of the logic with the search for the minimum value of a continuous function generated by this expression in the structure N, which is a simple extension of M. Theoretical considerations are illustrated by the example of a certain semi-heuristic algorithm seeking the minimum value of function ϕ with a short statistics of its.

Słowa kluczowe

EN

satisfiability; computational; PSO

• Czasopismo: Silesian Journal of Pure and Applied Mathematics
• Rocznik: 2020
• Tom: vol. 10, iss. 1
• Strony: 121--131
• Opis fizyczny: Bibliogr. 7 poz.

Twórcy

autor

Balcer, Marek

• Department of Mathematics Applications and Methods for Artificial Intelligence, Silesian University of Technology, Gliwice, Poland,

Bibliografia

• 1. Gu J.: The multi-SAT algorithm. Discrete Appl. Math. 96-97 (1999), 111-126.
• 2. Battiti R., Protasi M.: Approximate algorithms and heuristics for MAX-SAT. In: Handbook of Combinatorial Optimization, vol.1., Du D.-Z., Pardalos P.M. (eds.), 77-148. Kluwer Acad. Publ., Boston 1998.
• 3. Gottlieb J., Marchiori E., Rossi C.: Evolutionary algorithms for the satisfiability problem. Evolutionary Comput. 10 (2002), 35-50.
• 4. Malitz J.: Introduction to Mathematical Logic. Springer Verlag, New York 1979.
• 5. Grzegorczyk K.: An Outline of Mathematical Logic. PWN, Warszawa 1985 (in Polish).
• 6. Balcer M.: Characteristics and decomposition of expressions in the PF-notation. Silesian J. Pure Appl. Math. 6 (2016), 5-22.
• 7. Kennedy J., Eberhart R.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Networks vol.IV, Perth 1995, 1942-1948.