The unification task is one of the most complex and time-consuming activities in the execution of Prolog programs. The solutions currently implemented in Prolog machines are based on the sequential execution of Robinson’s based algorithms using some architectural supports to data tags testing and manipulation and to the intrinsic recursivity of the algorithm. In this work the application of associative techniques is evaluated inside a WAM environment and a detailed comparison is done with respect to the sequential solution. The structure of an incremental VLSI unifier, able to work properly with an existing Prolog processor, is derived from the analysis of experimental data
Performance evaluation of a VLSI associative unifier in a WAM based environment / P. L., Civera; Masera, Guido; G. L., Piccinini; RUO ROCH, Massimo; Zamboni, Maurizio. - (1991), pp. 121-132. (Intervento presentato al convegno International Workshop on VLSI for Artificial Intelligence and Neural Networks tenutosi a Oxford (GBR) nel September 5-7, 1990) [10.1007/978-1-4615-3752-6_12].
Performance evaluation of a VLSI associative unifier in a WAM based environment
MASERA, Guido;RUO ROCH, Massimo;ZAMBONI, Maurizio
1991
Abstract
The unification task is one of the most complex and time-consuming activities in the execution of Prolog programs. The solutions currently implemented in Prolog machines are based on the sequential execution of Robinson’s based algorithms using some architectural supports to data tags testing and manipulation and to the intrinsic recursivity of the algorithm. In this work the application of associative techniques is evaluated inside a WAM environment and a detailed comparison is done with respect to the sequential solution. The structure of an incremental VLSI unifier, able to work properly with an existing Prolog processor, is derived from the analysis of experimental dataPubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1671519
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo