Skip to main content

An inference engine for propositional two-valued logic based on the radical membership problem

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Mathematical Computation (AISMC 1996)

Abstract

In this paper, the well-known Radical Membership Problem of Commutative Algebra is adapted to develop an implementation of the inference processes in Knowledge Based Systems.

Let be a set of propositions, Γ a proposition, and let us denote their images, in a certain isomorphism, by σ and γ respectively. It can be established whether or not Γ follows from (Γ) by checking the equality of ideals <σ∪{1{it-t·γ}>=<1> in the polynomial model (t is a new variable). As a consequence, a criterion for consistency is obtained.

Work partially supported by DGICYT (Spain), project PB-94-0424.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Related literature

References

  1. A. de Antonio: Una Interpretación Algebraica de la Verificación de Sistemas Basados en el Conocimiento. Univ. Politécnica de Madrid (Ph.D. Thesis) (1994).

    Google Scholar 

  2. J.A. Alonso, E. Briales: Lógicas Polivalentes y Bases de Gröbner. In: C. Martin (editor): Actas del V Congreso de Lenguajes Naturales y Lenguajes Formales (1995) 307–315.

    Google Scholar 

  3. B. Buchberger: Applications of Gröbner Bases in non-linear Computational Geometry. In: J.R. Rice (editor): Mathematical Aspects of Scientific Software. IMA Volumes in Math. and its Applications, vol. 14. Springer-Verlag (1988).

    Google Scholar 

  4. D. Cox, J. Little, D. O'Shea: Ideals, Varieties, and Algorithms. Springer-Verlag (1991).

    Google Scholar 

  5. A. Capani, G. Niesi: CoCoA User's Manual. University of Genova (1996).

    Google Scholar 

  6. H.B. Enderton: A Mathematical Introduction to Logic. Academic Press (1972).

    Google Scholar 

  7. P.R. Halmos: Lectures on Boolean Algebras. Springer-Verlag (1974).

    Google Scholar 

  8. A. Heck: Introduction to Maple. Springer-Verlag (1993).

    Google Scholar 

  9. J. Hsiang: Refutational Theorem Proving using Term-Rewriting Systems. Artificial Intelligence 25 (1985) 255–300.

    Article  Google Scholar 

  10. D. Kapur, P. Narendran: An Equational Approach to Theorem Proving in First-Order Predicate Calculus. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), vol. 2 (1985) pages 1146–1153.

    Google Scholar 

  11. L. M. Laita, L. de Ledesma: Knowledge-Based Systems Verification. In: J.G. Williams, A. Kent (editors): Encyclopedia of Computer Science and Technology. M. Dekker (to appear).

    Google Scholar 

  12. L. M. Laita, B. Ramírez, L. de Ledesma A. Riscos: A Formal Model for Verification of Dynamic Consistency of KBSs. Computers & Mathematics 29–5 (1995) 81–96.

    Google Scholar 

  13. L. M. Laita, L. de Ledesma, E. Roanes L., E. Roanes M.: An Interpretation of the Propositional Boolean Algebra as a k-algebra. Effective Calculus. In: J. Campbell, J. Calmet (editors): Proceedings of the Second International Workshop/Conference on Artificial Intelligence and Symbolic Mathematical Computing (AISMC-2). Lecture Notes in Computer Science 958. Springer-Verlag (1995) 255–263.

    Google Scholar 

  14. E. Roanes L., L. M. Laita, E. Roanes M.: Maple V in A.I.: The Boolean Algebra Associated to a KBS. CAN Nieuwsbrief 14, (1995) 65–70.

    Google Scholar 

  15. E. Roanes L., L.M. Laita: Verification of Knowledge Based Systems with Commutative Algebra and Computer Algebra Techniques. Proceedings of the 1st International Conference on Applications of Computer Algebra (IMACS). New Mexico University (USA) (1995) (electronic book).

    Google Scholar 

  16. L.M. Laita, E. Roanes L.: Verification of Knowledge Based Systems: An Algebraic Interpretation. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-95) (Workshop on Verification and Validation of Knowledge Based Systems). McGill University, Montreal (Canadá), (1995) 91–95.

    Google Scholar 

  17. E. Mendelson: Boolean Algebra. McGraw-Hill (1970).

    Google Scholar 

  18. J.R. Shoenfield: Mathematical Logic. Addisson-Wesley (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Calmet John A. Campbell Jochen Pfalzgraf

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roanes-Lozano, E., Laita, L.M., Roanes-Macías, E. (1996). An inference engine for propositional two-valued logic based on the radical membership problem. In: Calmet, J., Campbell, J.A., Pfalzgraf, J. (eds) Artificial Intelligence and Symbolic Mathematical Computation. AISMC 1996. Lecture Notes in Computer Science, vol 1138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61732-9_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-61732-9_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61732-7

  • Online ISBN: 978-3-540-70740-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics