Results 221 to 230 of about 24,887 (251)
Some of the next articles are maybe not open access.
2001
Indexing data structures are well-known to be crucial for the efficiency of the current state-of-the-art theorem provers. Examples are \emph{discrimination trees}, which are like tries where terms are seen as strings and common prefixes are shared, and \emph{substitution trees}, where terms keep their tree structure and all common \emph{contexts} can ...
Ganzinger, H. +2 more
openaire +2 more sources
Indexing data structures are well-known to be crucial for the efficiency of the current state-of-the-art theorem provers. Examples are \emph{discrimination trees}, which are like tries where terms are seen as strings and common prefixes are shared, and \emph{substitution trees}, where terms keep their tree structure and all common \emph{contexts} can ...
Ganzinger, H. +2 more
openaire +2 more sources
Contexte et contextualisation à Mayotte, une approche systémique
Contextes Et Didactiques, 2022exaly
Effet de contexte, valeur d'internalité et jugement scolaire
Orientation Scolaire Et Professionnelle, 2001Pascal Bressoux, Pascal Pansu
exaly