The use of a strategy language for solving search problems. Annals of Mathematics and Artificial Intelligence, 29(1-4):35-64, 2000. abstract bibtex 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.
@article{0034560707,
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.",
number = "1-4",
year = "2000",
title = "The use of a strategy language for solving search problems",
volume = "29",
pages = "35-64",
journal = "Annals of Mathematics and Artificial Intelligence"
}
Downloads: 0
{"_id":"hwzfXDfhsfMNkhYkd","bibbaseid":"anonymous-theuseofastrategylanguageforsolvingsearchproblems-2000","downloads":0,"creationDate":"2017-03-31T20:15:32.870Z","title":"The use of a strategy language for solving search problems","author_short":null,"year":2000,"bibtype":"article","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"article","type":"article","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.","number":"1-4","year":"2000","title":"The use of a strategy language for solving search problems","volume":"29","pages":"35-64","journal":"Annals of Mathematics and Artificial Intelligence","bibtex":"@article{0034560707,\n 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.\",\n number = \"1-4\",\n year = \"2000\",\n title = \"The use of a strategy language for solving search problems\",\n volume = \"29\",\n pages = \"35-64\",\n journal = \"Annals of Mathematics and Artificial Intelligence\"\n}\n\n","key":"0034560707","id":"0034560707","bibbaseid":"anonymous-theuseofastrategylanguageforsolvingsearchproblems-2000","urls":{},"downloads":0,"html":""},"search_terms":["use","strategy","language","solving","search","problems"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}