A. A. Vega–Ramírez*1, J. L. Pérez–Silva2
1 Faculty of Superior Studies Aragón (FES Aragón), UNAM Avenida Rancho Seco, 57130, Netzahualcóyotl, Mexico *E–mail: alexandro_veg@yahoo.com
2 Center for Applied Sciences and Technological Development (CCADET), UNAM Circuito Exterior s/n, Ciudad Universitaria, Coyoacán, 04510 Mexico City, Mexico.
ABSTRACT
A digital circuit was implemented on a PLD to emulate the concept of logical functor physically, element from which all the Boolean connectors that exist can be generated. With this circuit, based on the Mc Cullock and Pitts neuron model and operating in agreement with the theory of the functor, several tests were carried out, starting from the application of values to the group of inputs that are considered as the threshold value that governs the behavior of the operator as well as to the group of inputs that are operated by the connector through this threshold. The obtained results present characteristics of behavior that refer to the above mentioned different Boolean operations. In these results, the utility of this functor is observed since it can be manipulated to solve diverse operation necessities, without requiring any connections or alterations to the existing system.
]]> Keywords: Logic functor, time dependent logic, electronics neuron model.
RESUMEN
Se implementó un circuito digital, implantado en un PLD (Dispositivo Lógico Programable), para poder emular físicamente el concepto de functor lógico, elemento con el cual se pueden generar todos los conectivos booleanos que existen. Con este circuito, basado en el modelo de neurona Mc Cullock y Pitts, y operando de acuerdo con la teoría del functor, se realizaron varias pruebas, a partir de la aplicación de valores, tanto al grupo de entradas que se consideran como el valor de umbral, que rigen el comportamiento del operador, como al conjunto de entradas que son operadas por el conectivo, a través de dicho umbral. Los resultados obtenidos presentan características de comportamiento que refieren a las diferentes operaciones booleanas mencionadas. En estos resultados se observa la utilidad de este functor, ya que puede ser manipulado para resolver diversas necesidades de operación, sin requerir conexiones o alteraciones al sistema existente.
DESCARGAR ARTÍCULO EN FORMATO PDF
References
[1] André, E. Handling Theories in Logic Functors for Recomposing Description Logics. Institut de Recherche en Informatique et Systems Aléatoires, Rennes, France, 2007. 56 pp. [ Links ]
]]>[2] Van Rijsbergen, C. J. A new theoretical framework for information retrieval. SIGIR Forum, 21(1–2):23–29, 1987. [ Links ]
[3] Lloyd, J.W. Foundations of Logic Programming. Symbolic computation — Artificial Intelligence. Springer, Berlin, 1987. [ Links ]
[4] Marriott, K. and Stuckey, P. J. Programming with Constraints: An Introduction. The MIT Press, 1998. [ Links ]
[5] Ferré, S. and Ridoux, O. An introduction to logical information systems. Information processing & Management, 40(3):383–419, 2004. [ Links ]
[6] S. Ferré, O. Ridoux. Introduction to Logical Information Systems. Institut National de Recherche en Informatique et en Automatique, Rennes, France. Rapport de recherche no. 4540, Septembre, 2002. 25 pp. [ Links ]
]]>[7] Calvanese, D. Lenzerini, M. and Nardi, D. Description logics for conceptual data modeling. In Logics for Databases and Information Systems, pages 229–263, 1998. [ Links ]
[8] Salton, G. and McGill, M. J. Introduction to Modern Information Retrieval. McGraw–Hill, 1983. [ Links ]
[9] Van Rijsbergen, C.J. Crestani, F. and Lalmas, M. editors. Information Retrieval: Uncertainty and Logics. Advanced models for the representation and retrieval of information. Kluwer Academic Publishing, Dordrecht, NL, 1998. [ Links ]
[10] Poole, D. Representing knowledge for logic–based diagnosis. In Int. Conf. Fifth Generation Computer Systems, pages 1282–1290. Springer, 1988. [ Links ]
[11] Lloyd, J. W. Foundations of Logic Programming. Symbolic computation – Artificial Intelligence. Springer, Berlin, 1987. [ Links ]
]]>[12] Sagiv, M. Francez, N. Rodeh, M. and Wilhelm, R. A logic–based approach to program flow analysis. Acta Informatica, 35 (6): 457–504, June, 1998. [ Links ]
[13] Armstrong, T. Marriott, K. Schachte, P. and Søndergaard, H. Two classes of boolean functions for dependency analysis. Science of Computer Programming, 31: 3–45, 1998. [ Links ]
[14] Codish, M. Søndergaard, H. and Stuckey, P. J. Sharing and groundness dependencies in logic programs. ACM TOPLAS, 21(5): 948–976, 1999. [ Links ]
[15] Issarny, V. and Bidan, Ch. Aster: A framework for sound customization of distributed runtime systems. In 16th Int. Conf. Distributed Computing Systems, 1996. [ Links ]
[16] S. Ferré, O. Ridoux. Logic Functors: A Framework for Developing Embeddable Customized Logics. Institut de Recherche en Informatique et Systems Aléatoires, Rennes, France. Publication interne no. 1459, Mai 2002, 32 pp. [ Links ]
]]>[17] Ferré, S. and Ridoux, O. A logical generalization of formal concept analysis. In G. Mineau and B. Ganter, editors, Int. Conf. Conceptual Structures, LNCS 1867, pages 371–384. Springer, 2000. [ Links ]
[18] Ferré, S. and Ridoux, O. Searching for objects and properties with logical concept analysis. In H. S. Delugach and G. Stumme, editors, Int. Conf. Conceptual Structures, LNCS 2120, pages 187–201. Springer, 2001. [ Links ]
[19] S. Ferré, O. Ridoux. The Principles of a Toolbox for the Implementation of Customized Logics. Institut de Recherche en Informatique et Systems Aléatoires, Rennes, France. 2000, pp 104–111. [ Links ]
[20] J. L. Pérez S., F. Lara, A. Miranda, A. Garcés. A. Herrera, M. Bañuelos, J. Castillo, S. Quintana, A. Padrón. El Functor Lógico Como Elemento Básico De Una Lógica Temporal Estocástica. Memorias del Congreso Nacional de Instrumentación SOMI XVI, Querétaro, Querétaro, México, 2001. [ Links ]
]]>