13.07.2015 Views

logica de lo preconciente aportes a la primera topica - Asociación ...

logica de lo preconciente aportes a la primera topica - Asociación ...

logica de lo preconciente aportes a la primera topica - Asociación ...

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Pab<strong>lo</strong> D. Slemenson“Lógica <strong>de</strong> <strong>lo</strong> <strong>preconciente</strong>”machines that can compete with children in the performance of a wi<strong>de</strong> variety ofphysical and cognitive tasks. It may be argued that un<strong>de</strong>rlying the failures is theunavai<strong>la</strong>bility of a methodo<strong>lo</strong>gy for reasoning and computing with perceptions ratherthan measurements. An outline of such a methodo<strong>lo</strong>gy--referred to as a computationaltheory of perceptions--is put forth in our work. The computational theory ofperceptions, or CTP for short, is based on the methodo<strong>lo</strong>gy of computing with words(CW). In CTP, words p<strong>la</strong>y the roles of <strong>la</strong>bels of perceptions and, more generally,perceptions are expressed as propositions in a natural <strong>la</strong>nguage. CW-based techniquesare emp<strong>lo</strong>yed to trans<strong>la</strong>te propositions expressed in a natural <strong>la</strong>nguage into what iscalled the generalized constraint <strong>la</strong>nguage (GCL). In this <strong>la</strong>nguage, the meaning of aproposition is expressed as a generalized constraint, X isr R, where X is the constrainedvariable, R is the constraining re<strong>la</strong>tion, and isr is a variable copu<strong>la</strong> in which r is avariable whose value <strong>de</strong>fines the way in which R constrains X. Among the basic typesof constraints are: equality, possibilistic, veristic, probabilistic, random set, Paw<strong>la</strong>k set,fuzzy graph, and usuality. The wi<strong>de</strong> variety of constraints in GCL makes GCL a muchmore expressive <strong>la</strong>nguage than the <strong>la</strong>nguage of predicate <strong>lo</strong>gic. In CW, the initial andterminal data sets, IDS and TDS, are assumed to consist of propositions expressed in anatural <strong>la</strong>nguage. These propositions are trans<strong>la</strong>ted, respectively, into antece<strong>de</strong>nt andconsequent constraints. The consequent constraints are <strong>de</strong>rived from the antece<strong>de</strong>ntconstraints through the use of rules of constraint propagation. The principal constraintpropagation rule is the generalized extension principle. At this juncture, thecomputational theory of perceptions is in its initial stages of <strong>de</strong>ve<strong>lo</strong>pment. In time, itmay come to p<strong>la</strong>y an important role in the conception, <strong>de</strong>sign, and utilization ofinformation/intelligent systems.Apendice 319

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!