Filter-based resolution principle for lattice-valued propositional logic LP(X)

Information Sciences

Volumn 177, Issue 4, 2007, Pages 1046-1062

  Ma, Jun ^a,b   Li, Wenjiang ^a   Ruan, Da ^c,d   Xu, Yang ^a  

^a SOUTHWEST JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^c BELGIAN NUCLEAR RESEARCH CENTRE   (Belgium)

^d GHENT UNIVERSITY   (Belgium)

Author keywords

Automated reasoning; Complex generalized clause; Filter; Lattice valued logic; Resolution principle; Simple generalized clause

Indexed keywords

ALGEBRA; NUMERICAL METHODS; OPTICAL FILTERS; OPTICAL RESOLVING POWER; THEOREM PROVING;

AUTOMATED REASONING; COMPLEX GENERALIZED CLAUSE; LATTICE VALUED LOGIC; RESOLUTION PRINCIPLE; SIMPLE GENERALIZED CLAUSE;

FORMAL LOGIC;

EID: 33751224166     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2006.07.027     Document Type: Article

References (81)

1. Aguilera G., de Guzmán L., Ojeda-Aciego M., and Valverde A. Reductions for non-clausal theorem proving. Theor. Comput. Sci. 266 (2001) 81-112
2. Baaz M., and Leitsch A. Complexity of resolution proofs and function introduction. Ann. Pure Appl. Logic 57 (1992) 181-215
3. Baaz M., and Fermüller C.G. Resolution-based theorem proving for many-valued logics. J. Symbol. Comput. 19 (1995) 353-391
4. Buro M., and Büning H. On resolution with short clauses. Ann. Math. Artif. Intell. 18 (1996) 243-260
5. Cárdenas Viedma I.N.S.M.A., and Marín Morales R. Fuzzy temporal constraint logic: a valid resolution principle. Fuzzy Sets Syst. 117 (2001) 231-250
6. Chang C., and Lee R. Symbolic and Mechanical Theorem Proving (1973), Academic Press, New York
7. Chu H., and Plaisted D. CLIN-S-A semantically guided first-order theorem prover. J. Automat. Reason. 18 (1997) 183-188
8. Denzinger J., Kronenburg M., and Schulz S. DISCOUNT-A distributed and learning equational prover. J. Automat. Reason. 18 (1997) 189-198
9. Dixon C. Temporal resolution using a breadth-first search algorithm. Ann. Math. Artif. Intell. 22 (1998) 87-115
10. D. Dubois, J. Lang, H. Prade, Theorem proving under uncertainty-a possibility theory based approach, in: Proc. of the International Joint Conference on Artificial Intelligence (IJCAI'87), Mitano, Italy, 1987, pp. 984-986.
11. D. Dubois, J. Lang, H. Prade, Automated reasoning using possibility logic semantics, belief revision and variable certainty weights, in: Proc. of the Fifth Workshop on Uncertainty in Artificial Intelligence, Windor, Ont., 1989, pp. 81-87.
12. Dubois D., and Prade H. Resolution principle in possibilistic logic. Internat. J. Approx. Reason. 4 1 (1990) 1-21
13. Fermüller C., and Leitsch A. Model building by resolution. Proc. of 6th Workshop on Computer Science Logic (CSL'92). Lecture Notes in Computer Science vol. 702 (1993), Springer, New York 134-148
14. Formisano A., and Polocriti A. T-resolution: Refinements and model elimination. J. Automat. Reason. 22 (1999) 433-483
15. Franco J., and Gelder A.V. A perspective on certain polynomial-time solvable classes of satisfiability. Discr. Appl. Math. 125 (2003) 177-214
16. Gabbay D.M., and Reyle U. Labelled resolution for classical and non-classical logics. Stud. Log. 59 (1997) 179-216
17. Genesereth M.R., and Nilsson N.J. Logical Foundations of Artificial Intelligence (1987), Morgan Kaufmann, San Mateo, CA
18. Giunchiglia E., Narizzano M., and Tacchella A. Back jumping for quantified Boolean logic satisfiability. Artif. Intell. 145 (2003) 99-120
19. Gottwald S. A treatise on many-valued logics. Studies in Logic and Computation vol. 9 (2001), Research Studies Press, Baldock
20. Hähnle R. Automated Deduction in Multiple-Valued Logics (1993), Oxford University Press, Oxford
21. Hähnle R. Commodious axiomatization of quantifiers in multiple-value logic. Stud. Log. 61 1 (1998) 101-121
22. Hájek P. Metamathematics of Fuzzy Logic (1998), Kluwer Academic Publishers, Dordrecht
23. Kalla P., Zeng Z., and Ciesielski M.J. Strategies for solving the Boolean satisfiability problem using binary decision diagrams. J. Syst. Architect. 47 (2001) 491-503
24. M. Kifer, On the expressive power of annotated logic program, in: Proc. of the 1989 North American Conference on Logic Programming, Cleveland, OH, 1989, pp. 1069-1089.
25. M. Kifer, E. Lozinskii, RI: A logic for reasoning with inconsistency, in: Proc. of the 21st International Symposium on Multiple-Valued Logics (ISMVL'91), Victoria, BC, Canada, 1991, pp. 253-262.
26. Kim C.S., Kim D.S., and Park J.S. A new fuzzy resolution principle based on the antonym. Fuzzy Sets and Syst. 113 (2000) 299-307
27. Kirousis L.M., and Kolaitis P.G. The complexity of minimal satisfiability problems. Inform. Comput. 187 (2003) 20-39
28. Lee S.J., and Plaisted D.A. Eliminating duplication with the hyper-linking strategy. J. Automat. Reason. 9 (1992) 25-42
29. Letz R. LINUS-A link instantiation prover with unit support. J. Automat. Reason. 18 (1997) 205-210
30. Liu J., and Xu Y. Filter and structure of lattice implication algebra. Chin. Sci. Bull. 10 (1997) 1049-1052
31. J. Liu, Study on lattice-valued logic system and lattice-valued resolution principle, Ph.D. thesis, Southwest Jiaotong University, Chengdu, China, 1999.
32. Liu X. Resolution-Based Automated Reasoning (1994), Chinese Academic Press
33. Loveland D.W. Mechanical theorem proving by model elimination. ACM Trans. Math. Software 15 2 (1968) 236-251
34. J.J. Lu, N.V. Murray, E. Rosenthal, Signed formulas and annotated logics, in: Proc. of the 23rd International Symposium on Multiple-Valued Logics (ISMVL'93), 1993, pp. 48-53.
35. J.J. Lu, N.V. Murray, E. Rosenthal, Signed formulas and fuzzy operator logics, in: J. Komorowski, Z.W. Ras (Eds.), Proc. of the Seventh International Symposium on Mathodologies for Intelligent Systems (ISMIS'93), 1993, pp. 75-84.
36. Lu J.J., Murray N.V., and Rosenthal E. A framework for reasoning in multiple-valued logics. J. Automat. Reason. 21 1 (1998) 39-67
37. Łukasiewicz J. Selected Works (1970), North-Holland, Amsterdam
38. J. Ma, Study on lattice implication algebra and lattice-valued propositional logic LP(X), Master's thesis, Southwest Jiaotong University, Chengdu, China, 1999.
39. J. Ma, Lattice-valued logical system and automated reasoning based on lattice implication algebra, Ph.D. thesis, Southwest Jiaotong University, Chengdu, China, 2002.
40. W. McCune, OTTER 3.0 reference manual and guide, Tech. Rep. Tech. Rep. ANL-94/6, Argonne National Laboratory, 1994. Available from: .
41. Morgan C. Resolution for many-valued logics. Logique et Anal. (N.S.) 19 (1976) 311-339
42. Mukaidono M. On some properties of fuzzy logic. Systems Comput. Controls 6 2 (1975) 36-43
43. Mukaidono M. Fuzzy inference of resolution style. In: Yager R.R. (Ed). Fuzzy Sets and Possibility Theory (1982), Pergamon Press, New York 224-231
44. Murray N.V. Completely nonclausal resolution theorem proving. Artif. Intell. 18 1 (1982) 67-85
45. N.V. Murray, E. Rosenthal, Improving tableau proof in multiple valued logics, in: Proc. of 21st International Symposium of Multiple-Valued Logics (ISMVL'91), Victoria, BC, Canada, 1991, pp. 230-237.
46. Nieuwenhuis R., and Rivero J.M.V. BARCELONA. J. Automat. Reason. 18 2 (1997) 171-176
47. Nipkow T., Paulson L.C., and Wenzel M. A Proof Assistant for Higher-Order Logic (2003), Springer, New York
48. Novák V., Perfilieva I., and Močkoř J. Mathematical Principles of Fuzzy Logic (1999), Kluwer Academic Publication, Boston
49. +-valued logic. Fund. Inform. 2 1 (1978) 1-15
50. Orlowska E. Resolution system and their application II. Fund. Inform. 3 3 (1980) 333-362
51. Orlowska E. Mechanical proof methods for post logics. Logique et Anal. (N.S.) 28 110 (1985) 173-192
52. Pavelka J. On fuzzy logic I: Many-valued rules of inference. II: Enriched residuated lattices and semantics of propositional calculi, III: Semantical completeness of some many-valued propositional calculi. Z. Math. Logik Grundlagen Math. 25 (1979) 45-52 119-134, 447-464
53. Policriti A., and Schwartz J.T. T theorem proving I. J. Symbolic Comput. 20 (1995) 315-342
54. Post E.L. Introduction to a general theory of elementary propositions. Amer. J. Math. 43 (1921) 163-185
55. K. Qin, Study of lattice-valued logic system and its application based on lattice implication algebra, Ph.D. thesis, Southwest Jiaotong University, Chengdu, China, 1996.
56. Robinson J.A. A machine-oriented logic based on the resolution principle. J. ACM 12 (1965) 23-41
57. Russell S., and Norvig P. Artificial Intelligence: A Modern Approach (1995), Prentice-Hall, New Jersey
58. Salzer G. Optimal axiomatizations for multiple-valued operators and quantifiers based on semilattices. In: McRobbie M., and Slaney J. (Eds). Proc. 13th Conference on Automated Deduction. Lecture Notes in Computer Science vol. 1104 (1996), Springer, New Brunswick, NJ 688-702
59. Schmidt R. Decidability by resolution for propositional model logics. J. Automat. Reason. 22 (1999) 376-396
60. Schmitt P. Computational aspects of three-valued logic. In: Siekmann J. (Ed). Proc. of the Eighth International Conference on Automated Reasoning (1986), Springer, Berlin 190-198
61. Smutná-Hliněná D., and Vojtáš P. Graded many-valued resolution with aggregation. Fuzzy Sets Syst. 143 (2004) 157-168
62. Z. Song, Study of uncertainty reasoning based on lattice implication algebra in intelligent control, Ph.D. thesis, Southwest Jiaotong University, Chengdu, China, 1998.
63. Stachniak Z. Resolution Proof Systems: An Algebraic Theory (1996), Kluwer Academic Publishers, Dordrecht
64. Sofronie-Stokkermans V. Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Mult.-Valued Log. 6 3/4 (2001) 289-344
65. Sutcliffe G., and Suttner C. Evaluat. General Purpose Automat. Theorem Proving Syst. 131 (2001) 39-54
66. 0-algebras, and multiple-valued logic. Fuzzy Syst. Math. 16 2 (2002) 1-15
67. X. Wang, Study on lattice-valued logic based on lattice implication algebra and its model theory, Ph.D. thesis, Southwest Jiaotong University, Chengdu, China, 2004.
68. Warners J.P., and van Maaren H. A two-phase algorithm for solving a class of hard satisfiability problems 1. Oper. Res. Lett. 23 (1998) 81-88
69. L. Wos, D. Carson, G. Robinson, The unit preference strategy in theorem proving, in: Proc. of the Fall Joint Computer Conference, 1964, pp. 615-621.
70. Wos L., Carson D., and Robinson G. Efficiency and completeness of the set-of-support strategy in theorem proving. ACM Trans. Math. Software 12 (1965) 536-541
71. Xu Y. Lattice implication algebra. J. Southwest Jiaotong Univ. 28 1 (1993) 20-27
72. Xu Y., and Qin K. Lattice-valued propositional logic (I). J. Southwest Jiaotong Univ. 2 (1993) 123-128 (English version)
73. Xu Y., and Qin K. Lattice-valued propositional logic (II). J. Southwest Jiaotong Univ. 1 (1994) 22-27 (English version)
74. Xu Y., Qin K., and Song Z. Syntax of lattice-valued first-order logic FM. Chin. Sci. Bull. 10 (1997) 1052-1055
75. vpl. Inform. Sci. 114 (1999) 205-235
76. vfl. Internat. J. Gen. Systems 29 (2000) 53-79
77. Xu Y., Ruan D., Kerre E.E., and Liu J. α-Resolution principle based on lattice-valued propositional logic LP(X). Inform. Sci. 130 (2000) 1-29
78. vfl. Mult.-Valued Log. 7 (2001) 213-257
79. Xu Y., Ruan D., Kerre E.E., and Liu J. α-Resolution principle based on first-order lattice-valued logic LF(X). Inform. Sci. 132 (2001) 221-239
80. Xu Y., Ruan D., Qin K., and Liu J. Lattice-Valued Logic-An Alternative Approach to Treat Fuzziness and Incomparability (2003), Springer, New York
81. Yager R.R. Inference in a multiple-valued logic system. Internat. J. Man-Machine Studies 23 (1985) 27-44