The use of a strategy language for solving search problems
Identifieur interne : 002692 ( Istex/Corpus ); précédent : 002691; suivant : 002693The use of a strategy language for solving search problems
Auteurs : Carlos Castro ; Peter BorovanskSource :
- Annals of Mathematics and Artificial Intelligence [ 1012-2443 ] ; 2000-02-01.
English descriptors
Abstract
Abstract: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.
Url:
DOI: 10.1023/A:1018900617693
Links to Exploration step
ISTEX:A4BAF2583F6A5608EE0C43A6B3AC845815D67801Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The use of a strategy language for solving search problems</title><author><name sortKey="Castro, Carlos" sort="Castro, Carlos" uniqKey="Castro C" first="Carlos" last="Castro">Carlos Castro</name><affiliation><mods:affiliation>Departamento de Informática, Universidad Técnica Federico Santa María, Avenida España 1680, Casilla 110-V, Valparaíso, Chile E-mail</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ccastro@inf.utfsm.cl</mods:affiliation></affiliation></author><author><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name><affiliation><mods:affiliation>Institute of Informatics, MFF UK Mlynská dolina, 842 15, Bratislava, Slovakia E-mail</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: borovan@fmph.uniba.sk</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A4BAF2583F6A5608EE0C43A6B3AC845815D67801</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1023/A:1018900617693</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-8H490384-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002692</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002692</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The use of a strategy language for solving search problems</title><author><name sortKey="Castro, Carlos" sort="Castro, Carlos" uniqKey="Castro C" first="Carlos" last="Castro">Carlos Castro</name><affiliation><mods:affiliation>Departamento de Informática, Universidad Técnica Federico Santa María, Avenida España 1680, Casilla 110-V, Valparaíso, Chile E-mail</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ccastro@inf.utfsm.cl</mods:affiliation></affiliation></author><author><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name><affiliation><mods:affiliation>Institute of Informatics, MFF UK Mlynská dolina, 842 15, Bratislava, Slovakia E-mail</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: borovan@fmph.uniba.sk</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Annals of Mathematics and Artificial Intelligence</title><title level="j" type="abbrev">Annals of Mathematics and Artificial Intelligence</title><idno type="ISSN">1012-2443</idno><idno type="eISSN">1573-7470</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2000-02-01">2000-02-01</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">1-4</biblScope><biblScope unit="page" from="35">35</biblScope><biblScope unit="page" to="64">64</biblScope></imprint><idno type="ISSN">1012-2443</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1012-2443</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>computational systems</term><term>constraint satisfaction problems</term><term>rewriting logic</term><term>strategies</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.</div></front></TEI><istex><corpusName>springer-journals</corpusName><author><json:item><name>Carlos Castro</name><affiliations><json:string>Departamento de Informática, Universidad Técnica Federico Santa María, Avenida España 1680, Casilla 110-V, Valparaíso, Chile E-mail</json:string><json:string>E-mail: ccastro@inf.utfsm.cl</json:string></affiliations></json:item><json:item><name>Peter Borovanský</name><affiliations><json:string>Institute of Informatics, MFF UK Mlynská dolina, 842 15, Bratislava, Slovakia E-mail</json:string><json:string>E-mail: borovan@fmph.uniba.sk</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>rewriting logic</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>strategies</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>computational systems</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>constraint satisfaction problems</value></json:item></subject><articleId><json:string>317328</json:string><json:string>Art3</json:string></articleId><arkIstex>ark:/67375/VQC-8H490384-0</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>74</abstractWordCount><abstractCharCount>545</abstractCharCount><keywordCount>4</keywordCount><score>7.888</score><pdfWordCount>11544</pdfWordCount><pdfCharCount>64358</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>30</pdfPageCount><pdfPageSize>595 x 841 pts</pdfPageSize></qualityIndicators><title>The use of a strategy language for solving search problems</title><genre><json:string>research-article</json:string></genre><host><title>Annals of Mathematics and Artificial Intelligence</title><language><json:string>unknown</json:string></language><publicationDate>2000</publicationDate><copyrightDate>2000</copyrightDate><issn><json:string>1012-2443</json:string></issn><eissn><json:string>1573-7470</json:string></eissn><journalId><json:string>10472</json:string></journalId><volume>29</volume><issue>1-4</issue><pages><first>35</first><last>64</last></pages><genre><json:string>journal</json:string></genre><subject><json:item><value>Computer Science, general</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematics, general</value></json:item><json:item><value>Complexity</value></json:item></subject></host><ark><json:string>ark:/67375/VQC-8H490384-0</json:string></ark><publicationDate>2000</publicationDate><copyrightDate>2000</copyrightDate><doi><json:string>10.1023/A:1018900617693</json:string></doi><id>A4BAF2583F6A5608EE0C43A6B3AC845815D67801</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-8H490384-0/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-8H490384-0/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/VQC-8H490384-0/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">The use of a strategy language for solving search problems</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://scientific-publisher.data.istex.fr">Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><availability><licence><p>Kluwer Academic Publishers, 2000</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</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></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">The use of a strategy language for solving search problems</title><author xml:id="author-0000"><persName><forename type="first">Carlos</forename><surname>Castro</surname></persName><email>ccastro@inf.utfsm.cl</email><affiliation>Departamento de Informática, Universidad Técnica Federico Santa María, Avenida España 1680, Casilla 110-V, Valparaíso, Chile E-mail</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Peter</forename><surname>Borovanský</surname></persName><email>borovan@fmph.uniba.sk</email><affiliation>Institute of Informatics, MFF UK Mlynská dolina, 842 15, Bratislava, Slovakia E-mail</affiliation></author><idno type="istex">A4BAF2583F6A5608EE0C43A6B3AC845815D67801</idno><idno type="ark">ark:/67375/VQC-8H490384-0</idno><idno type="DOI">10.1023/A:1018900617693</idno><idno type="article-id">317328</idno><idno type="article-id">Art3</idno></analytic><monogr><title level="j">Annals of Mathematics and Artificial Intelligence</title><title level="j" type="abbrev">Annals of Mathematics and Artificial Intelligence</title><idno type="pISSN">1012-2443</idno><idno type="eISSN">1573-7470</idno><idno type="journal-ID">true</idno><idno type="issue-article-count">8</idno><idno type="volume-issue-count">4</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2000-02-01"></date><biblScope unit="volume">29</biblScope><biblScope unit="issue">1-4</biblScope><biblScope unit="page" from="35">35</biblScope><biblScope unit="page" to="64">64</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: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><item><term>rewriting logic</term></item><item><term>strategies</term></item><item><term>computational systems</term></item><item><term>constraint satisfaction problems</term></item></list></keywords></textClass><textClass><keywords scheme="Journal Subject"><list><head>Computer Science</head><item><term>Computer Science, general</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Mathematics, general</term></item><item><term>Complexity</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2000-02-01">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/VQC-8H490384-0/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-journals not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Kluwer Academic Publishers</PublisherName><PublisherLocation>Dordrecht</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>10472</JournalID><JournalPrintISSN>1012-2443</JournalPrintISSN><JournalElectronicISSN>1573-7470</JournalElectronicISSN><JournalTitle>Annals of Mathematics and Artificial Intelligence</JournalTitle><JournalAbbreviatedTitle>Annals of Mathematics and Artificial Intelligence</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Computer Science</JournalSubject><JournalSubject Type="Secondary">Computer Science, general</JournalSubject><JournalSubject Type="Secondary">Artificial Intelligence (incl. Robotics)</JournalSubject><JournalSubject Type="Secondary">Mathematics, general</JournalSubject><JournalSubject Type="Secondary">Complexity</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo TocLevels="0" VolumeType="Regular"><VolumeIDStart>29</VolumeIDStart><VolumeIDEnd>29</VolumeIDEnd><VolumeIssueCount>4</VolumeIssueCount></VolumeInfo><Issue IssueType="Combined"><IssueInfo TocLevels="0"><IssueIDStart>1</IssueIDStart><IssueIDEnd>4</IssueIDEnd><IssueArticleCount>8</IssueArticleCount><IssueHistory><CoverDate><DateString>02-2000</DateString><Year>2000</Year><Month>2</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName><CopyrightYear>2000</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art3"><ArticleInfo ArticleType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ArticleID>317328</ArticleID><ArticleDOI>10.1023/A:1018900617693</ArticleDOI><ArticleSequenceNumber>3</ArticleSequenceNumber><ArticleTitle Language="En">The use of a strategy language for solving search problems</ArticleTitle><ArticleFirstPage>35</ArticleFirstPage><ArticleLastPage>64</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2004</Year><Month>10</Month><Day>1</Day></RegistrationDate></ArticleHistory><ArticleCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName><CopyrightYear>2000</CopyrightYear></ArticleCopyright><ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ArticleGrants><ArticleContext><JournalID>10472</JournalID><VolumeIDStart>29</VolumeIDStart><VolumeIDEnd>29</VolumeIDEnd><IssueIDStart>1</IssueIDStart><IssueIDEnd>4</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Carlos</GivenName><FamilyName>Castro</FamilyName></AuthorName><Contact><Email>ccastro@inf.utfsm.cl</Email></Contact></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Peter</GivenName><FamilyName>Borovanský</FamilyName></AuthorName><Contact><Email>borovan@fmph.uniba.sk</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>Departamento de Informática</OrgDivision><OrgName>Universidad Técnica Federico Santa María</OrgName><OrgAddress><Street>Avenida España 1680, Casilla 110-V</Street><City>Valparaíso</City><Country>Chile E-mail</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Institute of Informatics</OrgDivision><OrgName>MFF UK Mlynská dolina</OrgName><OrgAddress><Postcode>842 15</Postcode><City>Bratislava</City><Country>Slovakia E-mail</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.</Para></Abstract><KeywordGroup Language="En"><Keyword>rewriting logic</Keyword><Keyword>strategies</Keyword><Keyword>computational systems</Keyword><Keyword>constraint satisfaction problems</Keyword></KeywordGroup><ArticleNote Type="Corrigendum"><SimplePara>This revised version was published online in June 2006 with corrections to the Cover Date.</SimplePara></ArticleNote></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>The use of a strategy language for solving search problems</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>The use of a strategy language for solving search problems</title></titleInfo><name type="personal"><namePart type="given">Carlos</namePart><namePart type="family">Castro</namePart><affiliation>Departamento de Informática, Universidad Técnica Federico Santa María, Avenida España 1680, Casilla 110-V, Valparaíso, Chile E-mail</affiliation><affiliation>E-mail: ccastro@inf.utfsm.cl</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Peter</namePart><namePart type="family">Borovanský</namePart><affiliation>Institute of Informatics, MFF UK Mlynská dolina, 842 15, Bratislava, Slovakia E-mail</affiliation><affiliation>E-mail: borovan@fmph.uniba.sk</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper" 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>Kluwer Academic Publishers</publisher><place><placeTerm type="text">Dordrecht</placeTerm></place><dateIssued encoding="w3cdtf">2000-02-01</dateIssued><copyrightDate encoding="w3cdtf">2000</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.</abstract><subject lang="en"><topic>rewriting logic</topic><topic>strategies</topic><topic>computational systems</topic><topic>constraint satisfaction problems</topic></subject><relatedItem type="host"><titleInfo><title>Annals of Mathematics and Artificial Intelligence</title></titleInfo><titleInfo type="abbreviated"><title>Annals of Mathematics and Artificial Intelligence</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>Springer</publisher><dateIssued encoding="w3cdtf">2000-02-01</dateIssued><copyrightDate encoding="w3cdtf">2000</copyrightDate></originInfo><subject><genre>Computer Science</genre><topic>Computer Science, general</topic><topic>Artificial Intelligence (incl. Robotics)</topic><topic>Mathematics, general</topic><topic>Complexity</topic></subject><identifier type="ISSN">1012-2443</identifier><identifier type="eISSN">1573-7470</identifier><identifier type="JournalID">10472</identifier><identifier type="IssueArticleCount">8</identifier><identifier type="VolumeIssueCount">4</identifier><part><date>2000</date><detail type="volume"><number>29</number><caption>vol.</caption></detail><detail type="issue"><number>1-4</number><caption>no.</caption></detail><extent unit="pages"><start>35</start><end>64</end></extent></part><recordInfo><recordOrigin>Kluwer Academic Publishers, 2000</recordOrigin></recordInfo></relatedItem><identifier type="istex">A4BAF2583F6A5608EE0C43A6B3AC845815D67801</identifier><identifier type="ark">ark:/67375/VQC-8H490384-0</identifier><identifier type="DOI">10.1023/A:1018900617693</identifier><identifier type="ArticleID">317328</identifier><identifier type="ArticleID">Art3</identifier><accessCondition type="use and reproduction" contentType="copyright">Kluwer Academic Publishers, 2000</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource><recordOrigin>Kluwer Academic Publishers, 2000</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-8H490384-0/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 002692 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002692 | 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:A4BAF2583F6A5608EE0C43A6B3AC845815D67801
|texte= The use of a strategy language for solving search problems
}}
| This area was generated with Dilib version V0.6.33. |  |