A Certified Polynomial-Based Decision Procedure for Propositional Logic

  • Inmaculada Medina-Bulo
  • 1Francisco Palomo-Lozano
  • José A. Alonso-Jiménez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2152)

Abstract

In this paper we present the formalization of a decision procedure for Propositional Logic based on polynomial normalization. This formalization is suitable for its automatic verification in an applicative logic like Acl2. This application of polynomials has been developed by reusing a previous work on polynomial rings [19], showing that a proper formalization leads to a high level of reusability. Two checkers are defined: the first for contradiction formulas and the second for tautology formulas. The main theorems state that both checkers are sound and complete. Moreover, functions for generating models and counterexamples of formulas are provided. This facility plays also an important role in the main proofs. Finally, it is shown that this allows for a highly automated proof development.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aitken, W. E., Constable, R. L., Underwood, J. L.: Metalogical Frameworks II: Developing a Reflected Decision Procedure. J. Automated Reasoning 22(2) (1999)Google Scholar
  2. 2.
    Boole, G. The Mathematical Analysis of Logic. Macmillan (1847)Google Scholar
  3. 3.
    Boyer, R. S., Moore, J S.: A Computational Logic. Academic Press (1978)Google Scholar
  4. 4.
    Boyer, R. S., Moore, J S.: Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures. In: Boyer, R. S., Moore, J S. (eds.): The Correctness Problem in Computer Science. Academic Press (1981)Google Scholar
  5. 5.
    Boyer, R. S., Moore, J S.: A Computational Logic Handbook. Academic Press. 2nd edn. (1998)Google Scholar
  6. 6.
    Caldwell, J. L.: Classical Propositional Decidability via Nuprl Proof Extraction. 11th International Conference on Theorem Proving in Higher Order Logics. LNCS 1479 (1998)CrossRefGoogle Scholar
  7. 7.
    Chazarain, J., Riscos, A., Alonso, J. A., Briales, E.: Multi-Valued Logic and Gröbner Bases with Applications to Modal Logic. J. Symbolic Computation 11 (1991)Google Scholar
  8. 8.
    Harrison, J.: Metatheory and Reflection in Theorem Proving: A Survey and Critique. SRI International Cambridge Computer Science Research Centre. Technical Report CRC-053 (1995)Google Scholar
  9. 9.
    Harrison, J.: Binary Decision Diagrams as a HOL Derived Rule. The Computer Journal 38 (1995)Google Scholar
  10. 10.
    Harrison, J.: Stlmarck’s Algorithm as a HOL Derived Rule. 9th International Conference on Theorem Proving in Higher Order Logics. LNCS 1125 (1996)Google Scholar
  11. 11.
    Hsiang, J.: Refutational Theorem Proving using Term-Rewriting Systems. Artificial Intelligence 25 (1985)Google Scholar
  12. 12.
    Hsiang, J.: Rewrite Method for Theorem Proving in First-Order Theory with Equality. J. Symbolic Computation 3 (1987)Google Scholar
  13. 13.
    Hsiang, J., Huang, G. S.: Some Fundamental Properties of Boolean Ring Normal Forms. DIMACS series on Discrete Mathematics and Computer Science: The Satisfiability Problem. AMS (1996)Google Scholar
  14. 14.
    Kaufmann, M., Moore, J S.: An Industrial Strength Theorem Prover for a Logic Based on Common Lisp. IEEE Trans, on Software Engineering 23(4) (1997)Google Scholar
  15. 15.
    Kaufmann, M., Manolios, P., Moore, J S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers (2000)Google Scholar
  16. 16.
    Kaufmann, M., Manolios, P., Moore, J S.: Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers (2000)Google Scholar
  17. 17.
    Kapur, D., Narendran, P.: An Equational Approach to Theorem Proving in First-Order Predicate Calculus. 9th International Conference on Artificial Intelligence (1985)Google Scholar
  18. 18.
    Laita, L. M., Roanes-Lozano, E., Ledesma, L., Alonso, J. A.: A Computer Algebra Approach to Verification and Deduction in Many-Valued Knowledge Systems. Soft Computing 3(1) (1999)Google Scholar
  19. 19.
    Medina-Bulo, I., Alonso-Jiménez, J. A., Palomo-Lozano, F.: Automatic Verification of Polynomial Rings Fundamental Properties in ACL2. ACL2 Workshop 2000 Proceedings, Part A. The University of Texas at Austin, Department of Computer Sciences. Technical Report TR-00-29 (2000)Google Scholar
  20. 20.
    Medina-Bulo, I., Palomo-Lozano, F., Alonso-Jiménez, J. A.: A Certified Algorithm for Translating Formulas into Polynomials. An ACL2 Approach. International Joint Conference on Automated Reasoning (2001)Google Scholar
  21. 21.
    Moore, J S.: Introduction to the OBDD Algorithm for the ATP Community. Computational Logic, Inc. Technical Report 84 (1992)Google Scholar
  22. 22.
    Paulin-Mohring, C., Werner, B.: Synthesis of ML Programs in the System Coq. J. Symbolic Computation 15(5–6) (1993)Google Scholar
  23. 23.
    Stone, M.: The Theory of Representation for Boolean Algebra. Trans. AMS 40 (1936)Google Scholar
  24. 24.
    Sumners, R.: Correctness Proof of a BDD Manager in the Context of Satisfiability Checking. ACL2 Workshop 2000 Proceedings, Part A. The University of Texas at Austin, Department of Computer Sciences. Technical Report TR-00-29 (2000)Google Scholar
  25. 25.
    Théry, L. A Machine-Checked Implementation of Buchberger’s Algorithm. J. Automated Reasoning 26 (2001)Google Scholar
  26. 26.
    Wu, J., Tan, H.: An Algebraic Method to Decide the Deduction Problem in Prepositional Many-Valued Logics. International Symposium on Multiple-Valued Logics. IEEE Computer Society Press (1994)Google Scholar
  27. 27.
    Wu, J.: First-Order Polynomial Based Theorem Proving. In: Gao, X., Wang, D. (eds.): Mathematics Mechanization and Applications. Academic Press (1999)Google Scholar
  28. 28.
    Zhang, H.: A New Strategy for the Boolean Ring Based Approach to First Order Theorem Proving. Department of Computer Science. University of Iowa. Technical Report (1991)Google Scholar
  29. 29.
    Zhegalkin, I. I.: On a Technique of Evaluation of Propositions in Symbolic Logic. Mat. Sb. 34 (1927)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Inmaculada Medina-Bulo
    • 1
  • 1Francisco Palomo-Lozano
  • José A. Alonso-Jiménez
    • 2
  1. 1.Department of Computer Languages and SystemsUniversity of CádizCádizSpain
  2. 2.Department of Sciences and Artificial IntelligenceUniversity of Sevilla Fac. de Informática y EstadísticaSevillaSpain

Personalised recommendations