Alternative modeling schemes for propositional calculus problems

Article Sidebar

PDF
Published: Jul 25, 2016
Keywords:
CNF Logical inference Mathematical programming 0-1 integer programming Propositional logic

Main Article Content

Anupama Chanda
Department of Production Engineering, Jadavpur University, Kolkata, West Bengal 700032, India
Bijan Sarkar
R.N. Mukherjee
Department of Mathematics (Retd.) Burdwan University, Rajbati, Burwan, West Bengal: 713104, India

Abstract

The main objective of this paper is to discuss alternative approaches to convert a propositional logic problem into a 0-1 integer program. The substitution method proposed by Williams and the CNF method is used for modeling and representation of a logical inference problem. The similarity between the two fields, viz. optimization problems or mathematical programming and deductive logic are shown.

Article Details

How to Cite
Chanda, A., Sarkar, B., & Mukherjee, R. (2016). Alternative modeling schemes for propositional calculus problems. Engineering and Applied Science Research, 43(3), 153–155. Retrieved from https://ph01.tci-thaijo.org/index.php/easr/article/view/43550
Issue
Vol. 43 No. 3 (2016)
Section
ORIGINAL RESEARCH

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

References

Cavalier T, Soyster A. Logical deduction via linear programming. IMSE Working Paper 87-147. Department of Industrial and Management Systems Engineering, Pennsylvania State University; 1987.

Yager RR. A mathematical programming approach to inference with the capability of implementing default rules. Int J Man Mach Stud. 1988;29(6):685-714.

Peysakh J. Fast algorithm to convert boolean expression into CNF. Technical Report IBM Computer Science RC 12913 (No. 57971). Watson, NY; 1987.

Hooker JN. A quantitative approach to logical inference. Decis Support Syst. 1988;4(1):45-69.

Hooker JN. Generalized resolution and cutting planes. Ann Oper Res. 1988;12(1):217-39.

Williams HP. Logic applied to integer programming and integer programming applied to logic. Eur J Oper Res. 1995;81(3):605-16.

Blair CE, Jeroslow RG, Lowe JK. Some results and experiments in programming techniques for propositional logic. Comput Oper Res. 1986;13(5): 633-45.

Williams HP. Linear and integer programming applied to the propositional calculus. Syst Res Inform Sci. 1987;2:81-100.

Zangwill WI. (1965). Media selection by decision programming. In: Ursula HF, editor. Mathematical models in Marketing. Berlin: Springer; 1976. p. 132-3.

Cavalier TM, Pardalos PM, Soyster AL. Modeling an integer programming techniques applied to propositional calculus. Comput Oper Res. 1990;17(6):561-70.

Chanda A, Sarkar B, and Mukherjee RN. Logical deduction for an integer programming problem and Integer Programming (IP) formulation for a logical problem. Int J Oper Res Nepal. 2015;4(1):33-40.

Williams HP. Model building in mathematical programming. Chichester: John Wiley & Sons; 2013.

Copi IM. Symbolic Logic. New Delhi: Prentice Hall of India Private Limited; 2006.