Invariants, Patterns and Weights for Ordering Terms
Identifieur interne : 002093 ( Istex/Corpus ); précédent : 002092; suivant : 002094Invariants, Patterns and Weights for Ordering Terms
Auteurs : Ursula Martin ; Duncan ShandSource :
- Journal of Symbolic Computation [ 0747-7171 ] ; 2000.
English descriptors
- Teeft :
- Algebra, Arity, Arity terms, Certain conditions, Comput, Cropper, Disjoint union, Division order, Dpoly, Embedding, Embeds, Equivalence relation, Function symbol, Function symbols, General framework, Greatest element, Homeomorphic, Homeomorphic embedding relation, Lexicographic, Linearizable, Main result, Main theorem, Matrix, Monadic, Monadic terms, Monotonic, Monotonic family, Monotonic order, Monotonic orders, More detail, Nite, Orthogonal matrix, Partial order, Pattern class, Pattern classes, Poly, Polynomial interpretation, Polynomial order, Polynomial orders, Principal subterm, Principal subterms, Real numbers, Recursive, Recursive path order, Shand, Skeleton, Stable order, Subset, Substitution, Subterm, Subterm property, Subterms, Term algebra, Term orders, Termination proofs, Topological space, Total order, Unary, Unary function symbols, Variable arity terms, Varyadic, Varyadic embedding, Vector space, Vector spaces, Weight function, Weight order, Weight sequence, Weight sequences.
Abstract
Abstract: We prove that any simplification order over arbitrary terms is an extension of an order by weight, by considering a related monadic term algebra called the spine. We show that any total ground-stable simplification order on the spine lifts to an order on the full term algebra. Conversely, under certain restrictions, a simplification ordering on the term algebra defines a weight function on the spine, which in turn can be lifted to a weight order on the original ground terms which contains the original order. We investigate the Knuth–Bendix and polynomial orders in this light. We provide a general framework for ordering terms by counting embedded patterns, which gives rise to many new orderings. We examine the recursive path order in this context.
Url:
DOI: 10.1006/jsco.1999.0333
Links to Exploration step
ISTEX:8DE42AC82983BB10B4FB3BE52B88422D9348ED24Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Invariants, Patterns and Weights for Ordering Terms</title><author><name sortKey="Martin, Ursula" sort="Martin, Ursula" uniqKey="Martin U" first="Ursula" last="Martin">Ursula Martin</name><affiliation><mods:affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</mods:affiliation></affiliation></author><author><name sortKey="Shand, Duncan" sort="Shand, Duncan" uniqKey="Shand D" first="Duncan" last="Shand">Duncan Shand</name><affiliation><mods:affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8DE42AC82983BB10B4FB3BE52B88422D9348ED24</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1006/jsco.1999.0333</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-K7HGD3CK-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002093</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002093</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Invariants, Patterns and Weights for Ordering Terms</title><author><name sortKey="Martin, Ursula" sort="Martin, Ursula" uniqKey="Martin U" first="Ursula" last="Martin">Ursula Martin</name><affiliation><mods:affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</mods:affiliation></affiliation></author><author><name sortKey="Shand, Duncan" sort="Shand, Duncan" uniqKey="Shand D" first="Duncan" last="Shand">Duncan Shand</name><affiliation><mods:affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Symbolic Computation</title><title level="j" type="abbrev">YJSCO</title><idno type="ISSN">0747-7171</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="2000">2000</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="921">921</biblScope><biblScope unit="page" to="957">957</biblScope></imprint><idno type="ISSN">0747-7171</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0747-7171</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algebra</term><term>Arity</term><term>Arity terms</term><term>Certain conditions</term><term>Comput</term><term>Cropper</term><term>Disjoint union</term><term>Division order</term><term>Dpoly</term><term>Embedding</term><term>Embeds</term><term>Equivalence relation</term><term>Function symbol</term><term>Function symbols</term><term>General framework</term><term>Greatest element</term><term>Homeomorphic</term><term>Homeomorphic embedding relation</term><term>Lexicographic</term><term>Linearizable</term><term>Main result</term><term>Main theorem</term><term>Matrix</term><term>Monadic</term><term>Monadic terms</term><term>Monotonic</term><term>Monotonic family</term><term>Monotonic order</term><term>Monotonic orders</term><term>More detail</term><term>Nite</term><term>Orthogonal matrix</term><term>Partial order</term><term>Pattern class</term><term>Pattern classes</term><term>Poly</term><term>Polynomial interpretation</term><term>Polynomial order</term><term>Polynomial orders</term><term>Principal subterm</term><term>Principal subterms</term><term>Real numbers</term><term>Recursive</term><term>Recursive path order</term><term>Shand</term><term>Skeleton</term><term>Stable order</term><term>Subset</term><term>Substitution</term><term>Subterm</term><term>Subterm property</term><term>Subterms</term><term>Term algebra</term><term>Term orders</term><term>Termination proofs</term><term>Topological space</term><term>Total order</term><term>Unary</term><term>Unary function symbols</term><term>Variable arity terms</term><term>Varyadic</term><term>Varyadic embedding</term><term>Vector space</term><term>Vector spaces</term><term>Weight function</term><term>Weight order</term><term>Weight sequence</term><term>Weight sequences</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We prove that any simplification order over arbitrary terms is an extension of an order by weight, by considering a related monadic term algebra called the spine. We show that any total ground-stable simplification order on the spine lifts to an order on the full term algebra. Conversely, under certain restrictions, a simplification ordering on the term algebra defines a weight function on the spine, which in turn can be lifted to a weight order on the original ground terms which contains the original order. We investigate the Knuth–Bendix and polynomial orders in this light. We provide a general framework for ordering terms by counting embedded patterns, which gives rise to many new orderings. We examine the recursive path order in this context.</div></front></TEI><istex><corpusName>elsevier</corpusName><keywords><teeft><json:string>monotonic</json:string><json:string>arity</json:string><json:string>subset</json:string><json:string>unary</json:string><json:string>weight sequence</json:string><json:string>subterm</json:string><json:string>subterms</json:string><json:string>shand</json:string><json:string>pattern class</json:string><json:string>recursive path order</json:string><json:string>poly</json:string><json:string>function symbols</json:string><json:string>unary function symbols</json:string><json:string>embedding</json:string><json:string>total order</json:string><json:string>dpoly</json:string><json:string>monadic</json:string><json:string>term algebra</json:string><json:string>stable order</json:string><json:string>nite</json:string><json:string>monadic terms</json:string><json:string>embeds</json:string><json:string>varyadic</json:string><json:string>comput</json:string><json:string>recursive</json:string><json:string>principal subterms</json:string><json:string>weight function</json:string><json:string>arity terms</json:string><json:string>homeomorphic</json:string><json:string>polynomial orders</json:string><json:string>lexicographic</json:string><json:string>variable arity terms</json:string><json:string>cropper</json:string><json:string>linearizable</json:string><json:string>algebra</json:string><json:string>polynomial order</json:string><json:string>general framework</json:string><json:string>weight sequences</json:string><json:string>division order</json:string><json:string>monotonic order</json:string><json:string>function symbol</json:string><json:string>monotonic orders</json:string><json:string>partial order</json:string><json:string>polynomial interpretation</json:string><json:string>matrix</json:string><json:string>more detail</json:string><json:string>disjoint union</json:string><json:string>main result</json:string><json:string>vector spaces</json:string><json:string>principal subterm</json:string><json:string>pattern classes</json:string><json:string>subterm property</json:string><json:string>term orders</json:string><json:string>monotonic family</json:string><json:string>equivalence relation</json:string><json:string>substitution</json:string><json:string>varyadic embedding</json:string><json:string>topological space</json:string><json:string>weight order</json:string><json:string>real numbers</json:string><json:string>vector space</json:string><json:string>homeomorphic embedding relation</json:string><json:string>certain conditions</json:string><json:string>main theorem</json:string><json:string>greatest element</json:string><json:string>termination proofs</json:string><json:string>orthogonal matrix</json:string><json:string>skeleton</json:string></teeft></keywords><author><json:item><name>Ursula Martin</name><affiliations><json:string>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</json:string></affiliations></json:item><json:item><name>Duncan Shand</name><affiliations><json:string>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</json:string></affiliations></json:item></author><arkIstex>ark:/67375/6H6-K7HGD3CK-Q</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>Full-length article</json:string></originalGenre><abstract>Abstract: We prove that any simplification order over arbitrary terms is an extension of an order by weight, by considering a related monadic term algebra called the spine. We show that any total ground-stable simplification order on the spine lifts to an order on the full term algebra. Conversely, under certain restrictions, a simplification ordering on the term algebra defines a weight function on the spine, which in turn can be lifted to a weight order on the original ground terms which contains the original order. We investigate the Knuth–Bendix and polynomial orders in this light. We provide a general framework for ordering terms by counting embedded patterns, which gives rise to many new orderings. We examine the recursive path order in this context.</abstract><qualityIndicators><score>8.488</score><pdfWordCount>20605</pdfWordCount><pdfCharCount>77703</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>37</pdfPageCount><pdfPageSize>595.27 x 841.89 pts (A4)</pdfPageSize><refBibsNative>true</refBibsNative><abstractWordCount>124</abstractWordCount><abstractCharCount>766</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Invariants, Patterns and Weights for Ordering Terms</title><pii><json:string>S0747-7171(99)90333-4</json:string></pii><genre><json:string>research-article</json:string></genre><host><title>Journal of Symbolic Computation</title><language><json:string>unknown</json:string></language><publicationDate>2000</publicationDate><issn><json:string>0747-7171</json:string></issn><pii><json:string>S0747-7171(00)X0020-X</json:string></pii><volume>29</volume><issue>6</issue><pages><first>921</first><last>957</last></pages><genre><json:string>journal</json:string></genre></host><namedEntities><unitex><date><json:string>2000</json:string></date><geogName></geogName><orgName><json:string>UK EPSRC</json:string></orgName><orgName_funder><json:string>UK EPSRC</json:string></orgName_funder><orgName_provider></orgName_provider><persName><json:string>S. Proof</json:string><json:string>S. Lemma</json:string><json:string>D. Shand</json:string><json:string>F. Invariants</json:string><json:string>S. Suppose</json:string><json:string>U. Martin</json:string><json:string>To</json:string></persName><placeName></placeName><ref_url><json:string>http://www.idealibrary.com</json:string></ref_url><ref_bibl><json:string>Steinbach (1995)</json:string><json:string>Prohle and Perlo-Freeman (1997)</json:string><json:string>Faugere et al., 1993</json:string><json:string>see Martin, 1989</json:string><json:string>Martin (1990)</json:string><json:string>see Dershowitz, 1982</json:string><json:string>Dick et al., 1990</json:string><json:string>Dershowitz, 1982</json:string><json:string>Knuth and Bendix, 1970</json:string><json:string>Hofbauer, 1992</json:string><json:string>Gallier, 1991</json:string><json:string>Dick et al. (1990)</json:string><json:string>Ben Cherifa and Lescanne (1987)</json:string><json:string>Lankford (1975)</json:string><json:string>Cropper and Martin, 2000</json:string><json:string>Martin and Scott, 1997</json:string><json:string>Mora and Robbiano (1986)</json:string><json:string>Linton and Shand, 1996</json:string><json:string>1989, 1995</json:string><json:string>Middeldorp and Gramlich, 1995</json:string><json:string>Touzet, 1997</json:string><json:string>Martin (1993)</json:string><json:string>Cropper and Martin (2000)</json:string><json:string>Martin and Scott (1997)</json:string><json:string>Martin, 1993</json:string><json:string>Cichon and Weiermann, 1997</json:string><json:string>Knuth and Bendix (1970)</json:string></ref_bibl><bibl></bibl></unitex></namedEntities><ark><json:string>ark:/67375/6H6-K7HGD3CK-Q</json:string></ark><categories><wos><json:string>1 - science</json:string><json:string>2 - mathematics, applied</json:string><json:string>2 - computer science, theory & methods</json:string></wos><scienceMetrix><json:string>1 - natural sciences</json:string><json:string>2 - mathematics & statistics</json:string><json:string>3 - general mathematics</json:string></scienceMetrix><scopus><json:string>1 - Physical Sciences</json:string><json:string>2 - Mathematics</json:string><json:string>3 - Computational Mathematics</json:string><json:string>1 - Physical Sciences</json:string><json:string>2 - Mathematics</json:string><json:string>3 - Algebra and Number Theory</json:string></scopus><inist><json:string>1 - sciences appliquees, technologies et medecines</json:string><json:string>2 - sciences exactes et technologie</json:string><json:string>3 - sciences et techniques communes</json:string><json:string>4 - mathematiques</json:string></inist></categories><publicationDate>2000</publicationDate><copyrightDate>2000</copyrightDate><doi><json:string>10.1006/jsco.1999.0333</json:string></doi><id>8DE42AC82983BB10B4FB3BE52B88422D9348ED24</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-K7HGD3CK-Q/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-K7HGD3CK-Q/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/6H6-K7HGD3CK-Q/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Invariants, Patterns and Weights for Ordering Terms</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://scientific-publisher.data.istex.fr">ELSEVIER</publisher><availability><licence><p>©2000 Academic Press</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M">elsevier</p></availability><date>2000</date></publicationStmt><notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note><note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note><note type="content">Section title: Regular Article</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Invariants, Patterns and Weights for Ordering Terms</title><author xml:id="author-0000"><persName><forename type="first">Ursula</forename><surname>Martin</surname></persName><affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Duncan</forename><surname>Shand</surname></persName><note type="biography">E-mail: {um,ddshand}@dcs.st-and.ac.uk</note><affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</affiliation></author><idno type="istex">8DE42AC82983BB10B4FB3BE52B88422D9348ED24</idno><idno type="ark">ark:/67375/6H6-K7HGD3CK-Q</idno><idno type="DOI">10.1006/jsco.1999.0333</idno><idno type="PII">S0747-7171(99)90333-4</idno></analytic><monogr><title level="j">Journal of Symbolic Computation</title><title level="j" type="abbrev">YJSCO</title><idno type="pISSN">0747-7171</idno><idno type="PII">S0747-7171(00)X0020-X</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="2000"></date><biblScope unit="volume">29</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="921">921</biblScope><biblScope unit="page" to="957">957</biblScope></imprint></monogr></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2000</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We prove that any simplification order over arbitrary terms is an extension of an order by weight, by considering a related monadic term algebra called the spine. We show that any total ground-stable simplification order on the spine lifts to an order on the full term algebra. Conversely, under certain restrictions, a simplification ordering on the term algebra defines a weight function on the spine, which in turn can be lifted to a weight order on the original ground terms which contains the original order. We investigate the Knuth–Bendix and polynomial orders in this light. We provide a general framework for ordering terms by counting embedded patterns, which gives rise to many new orderings. We examine the recursive path order in this context.</p></abstract></profileDesc><revisionDesc><change when="2000">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-K7HGD3CK-Q/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla" xml:lang="en"><item-info><jid>YJSCO</jid><aid>90333</aid><ce:pii>S0747-7171(99)90333-4</ce:pii><ce:doi>10.1006/jsco.1999.0333</ce:doi><ce:copyright type="full-transfer" year="2000">Academic Press</ce:copyright></item-info><head><ce:dochead><ce:textfn>Regular Article</ce:textfn></ce:dochead><ce:title>Invariants, Patterns and Weights for Ordering Terms</ce:title><ce:author-group><ce:author><ce:given-name>Ursula</ce:given-name><ce:surname>Martin</ce:surname></ce:author><ce:author><ce:given-name>Duncan</ce:given-name><ce:surname>Shand</ce:surname><ce:cross-ref refid="FN1"><ce:sup>1</ce:sup></ce:cross-ref></ce:author><ce:affiliation><ce:textfn>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</ce:textfn></ce:affiliation><ce:footnote id="FN1"><ce:label>1</ce:label><ce:note-para>E-mail: {um,ddshand}@dcs.st-and.ac.uk</ce:note-para></ce:footnote></ce:author-group><ce:date-received day="1" month="6" year="1998"></ce:date-received><ce:date-accepted day="1" month="12" year="1999"></ce:date-accepted><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>We prove that any simplification order over arbitrary terms is an extension of an order by weight, by considering a related monadic term algebra called the spine. We show that any total ground-stable simplification order on the spine lifts to an order on the full term algebra. Conversely, under certain restrictions, a simplification ordering on the term algebra defines a weight function on the spine, which in turn can be lifted to a weight order on the original ground terms which contains the original order. We investigate the Knuth–Bendix and polynomial orders in this light. We provide a general framework for ordering terms by counting embedded patterns, which gives rise to many new orderings. We examine the recursive path order in this context.</ce:simple-para></ce:abstract-sec></ce:abstract></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Invariants, Patterns and Weights for Ordering Terms</title></titleInfo><titleInfo type="alternative" lang="en" contentType="CDATA"><title>Invariants, Patterns and Weights for Ordering Terms</title></titleInfo><name type="personal"><namePart type="given">Ursula</namePart><namePart type="family">Martin</namePart><affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Duncan</namePart><namePart type="family">Shand</namePart><affiliation>School of Computer Science, University of St Andrews, St Andrews, Fife, KY16 9SS, U.K.</affiliation><description>E-mail: {um,ddshand}@dcs.st-and.ac.uk</description><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">2000</dateIssued><copyrightDate encoding="w3cdtf">2000</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><abstract lang="en">Abstract: We prove that any simplification order over arbitrary terms is an extension of an order by weight, by considering a related monadic term algebra called the spine. We show that any total ground-stable simplification order on the spine lifts to an order on the full term algebra. Conversely, under certain restrictions, a simplification ordering on the term algebra defines a weight function on the spine, which in turn can be lifted to a weight order on the original ground terms which contains the original order. We investigate the Knuth–Bendix and polynomial orders in this light. We provide a general framework for ordering terms by counting embedded patterns, which gives rise to many new orderings. We examine the recursive path order in this context.</abstract><note type="content">Section title: Regular Article</note><relatedItem type="host"><titleInfo><title>Journal of Symbolic Computation</title></titleInfo><titleInfo type="abbreviated"><title>YJSCO</title></titleInfo><genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">2000</dateIssued></originInfo><identifier type="ISSN">0747-7171</identifier><identifier type="PII">S0747-7171(00)X0020-X</identifier><part><date>2000</date><detail type="volume"><number>29</number><caption>vol.</caption></detail><detail type="issue"><number>6</number><caption>no.</caption></detail><extent unit="issue-pages"><start>841</start><end>983</end></extent><extent unit="pages"><start>921</start><end>957</end></extent></part></relatedItem><identifier type="istex">8DE42AC82983BB10B4FB3BE52B88422D9348ED24</identifier><identifier type="ark">ark:/67375/6H6-K7HGD3CK-Q</identifier><identifier type="DOI">10.1006/jsco.1999.0333</identifier><identifier type="PII">S0747-7171(99)90333-4</identifier><accessCondition type="use and reproduction" contentType="copyright">©2000 Academic Press</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M">elsevier</recordContentSource><recordOrigin>Academic Press, ©2000</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-K7HGD3CK-Q/record.json</uri></json:item></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002093 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002093 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:8DE42AC82983BB10B4FB3BE52B88422D9348ED24
|texte= Invariants, Patterns and Weights for Ordering Terms
}}
| This area was generated with Dilib version V0.6.33. |  |