Combining Constraint Solving
Identifieur interne : 000094 ( Istex/Corpus ); précédent : 000093; suivant : 000095Combining Constraint Solving
Auteurs : Franz Baader ; Klaus U. SchulzSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.
Url:
DOI: 10.1007/3-540-45406-3_3
Links to Exploration step
ISTEX:04B1718899ADA73AB4405AC3D891284B2B13C367Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Combining Constraint Solving</title><author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name><affiliation><mods:affiliation>Theoretical Computer Science, RWTH Aachen, Germany</mods:affiliation></affiliation></author><author><name sortKey="Schulz, Klaus U" sort="Schulz, Klaus U" uniqKey="Schulz K" first="Klaus U." last="Schulz">Klaus U. Schulz</name><affiliation><mods:affiliation>CIS, University of Munich, Germany</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:04B1718899ADA73AB4405AC3D891284B2B13C367</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-45406-3_3</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-7VFQZLVC-4/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000094</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000094</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Combining Constraint Solving</title><author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name><affiliation><mods:affiliation>Theoretical Computer Science, RWTH Aachen, Germany</mods:affiliation></affiliation></author><author><name sortKey="Schulz, Klaus U" sort="Schulz, Klaus U" uniqKey="Schulz K" first="Klaus U." last="Schulz">Klaus U. Schulz</name><affiliation><mods:affiliation>CIS, University of Munich, Germany</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Franz Baader</name><affiliations><json:string>Theoretical Computer Science, RWTH Aachen, Germany</json:string></affiliations></json:item><json:item><name>Klaus U. Schulz</name><affiliations><json:string>CIS, University of Munich, Germany</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-7VFQZLVC-4</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>95</abstractWordCount><abstractCharCount>614</abstractCharCount><keywordCount>0</keywordCount><score>8.14</score><pdfWordCount>23787</pdfWordCount><pdfCharCount>124832</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>55</pdfPageCount><pdfPageSize>531 x 774 pts</pdfPageSize></qualityIndicators><title>Combining Constraint Solving</title><chapterId><json:string>3</json:string><json:string>Chap3</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2001</copyrightDate><issn><json:string>0302-9743</json:string></issn></serie><host><title>Constraints in Computational Logics</title><language><json:string>unknown</json:string></language><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45406-3</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-3-540-45406-9</json:string></eisbn><bookId><json:string>3-540-45406-3</json:string></bookId><isbn><json:string>978-3-540-41950-1</json:string></isbn><volume>2002</volume><pages><first>104</first><last>158</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item><json:item><name>Hubert Comon</name><affiliations><json:string>Laboratoire Spécification et Vérification, École Normale Supérieure de Cachan, 61, avenue du Président Wilson, 94234, Cachan Cedex, France</json:string><json:string>E-mail: Hubert.Comon@lsv.ens-cachan.fr</json:string></affiliations></json:item><json:item><name>Claude Marché</name><affiliations><json:string>Laboratoire de Recherche en Informatique, Université Paris-Sud, Bâtiment 490, 91405, Orsay Cedex, France</json:string><json:string>E-mail: treinen@lri.fr</json:string></affiliations></json:item><json:item><name>Ralf Treinen</name><affiliations><json:string>Laboratoire de Recherche en Informatique, Université Paris-Sud, Bâtiment 490, 91405, Orsay Cedex, France</json:string><json:string>E-mail: treinen@lri.fr</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Mathematics of Computing</value></json:item><json:item><value>Mathematical Logic and Foundations</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-7VFQZLVC-4</json:string></ark><publicationDate>2001</publicationDate><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45406-3_3</json:string></doi><id>04B1718899ADA73AB4405AC3D891284B2B13C367</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-7VFQZLVC-4/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-7VFQZLVC-4/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-7VFQZLVC-4/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Combining Constraint Solving</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2001">2001</date></publicationStmt><notesStmt><note type="content-type" subtype="research-article" source="OriginalPaper" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Combining Constraint Solving</title><author><persName><forename type="first">Franz</forename><surname>Baader</surname></persName><affiliation><orgName type="institution">Theoretical Computer Science</orgName><address><settlement>RWTH Aachen</settlement><country key="DE">GERMANY</country></address></affiliation></author><author><persName><forename type="first">Klaus</forename><forename type="first">U.</forename><surname>Schulz</surname></persName><affiliation><orgName type="department">CIS</orgName><orgName type="institution">University of Munich</orgName><address><country key="DE">GERMANY</country></address></affiliation></author><idno type="istex">04B1718899ADA73AB4405AC3D891284B2B13C367</idno><idno type="ark">ark:/67375/HCB-7VFQZLVC-4</idno><idno type="DOI">10.1007/3-540-45406-3_3</idno></analytic><monogr><title level="m" type="main">Constraints in Computational Logics</title><title level="m" type="sub">Theory and Applications International Summer School, CCL ’99 Gif-sur-Yvette, France, September 5–8, 1999 Revised Lectures</title><idno type="DOI">10.1007/3-540-45406-3</idno><idno type="book-id">3-540-45406-3</idno><idno type="ISBN">978-3-540-41950-1</idno><idno type="eISBN">978-3-540-45406-9</idno><idno type="chapter-id">Chap3</idno><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation><orgName type="institution">Karlsruhe University</orgName><address><country key="DE">GERMANY</country></address></affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation><orgName type="institution">Cornell University</orgName><address><settlement>NY</settlement><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName><affiliation><orgName type="institution">Utrecht University</orgName><address><country key=""></country></address></affiliation></editor><editor><persName><forename type="first">Hubert</forename><surname>Comon</surname></persName><email>Hubert.Comon@lsv.ens-cachan.fr</email><affiliation><orgName type="department">Laboratoire Spécification et Vérification</orgName><orgName type="institution">École Normale Supérieure de Cachan</orgName><address><street>61, avenue du Président Wilson</street><postCode>94234</postCode><settlement>Cachan Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><editor><persName><forename type="first">Claude</forename><surname>Marché</surname></persName><email>treinen@lri.fr</email><affiliation><orgName type="department">Laboratoire de Recherche en Informatique</orgName><orgName type="institution">Université Paris-Sud</orgName><address><street>Bâtiment 490</street><postCode>91405</postCode><settlement>Orsay Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><editor><persName><forename type="first">Ralf</forename><surname>Treinen</surname></persName><email>treinen@lri.fr</email><affiliation><orgName type="department">Laboratoire de Recherche en Informatique</orgName><orgName type="institution">Université Paris-Sud</orgName><address><street>Bâtiment 490</street><postCode>91405</postCode><settlement>Orsay Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><imprint><biblScope unit="vol">2002</biblScope><biblScope unit="page" from="104">104</biblScope><biblScope unit="page" to="158">158</biblScope><biblScope unit="chapter-count">6</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="pISSN">0302-9743</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-2">Artificial Intelligence (incl. Robotics)</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-3">Logics and Meanings of Programs</term></item><label>I14010</label><item><term type="Secondary" subtype="priority-4">Programming Techniques</term></item><label>I17001</label><item><term type="Secondary" subtype="priority-5">Mathematics of Computing</term></item><label>M24005</label><item><term type="Secondary" subtype="priority-6">Mathematical Logic and Foundations</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-7VFQZLVC-4/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks 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>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><Book Language="En"><BookInfo BookProductType="Graduate/advanced undergraduate textbook" Language="En" MediaType="eBook" NumberingStyle="ChapterContent" TocLevels="0"><BookID>3-540-45406-3</BookID><BookTitle>Constraints in Computational Logics</BookTitle><BookSubTitle>Theory and Applications International Summer School, CCL ’99 Gif-sur-Yvette, France, September 5–8, 1999 Revised Lectures</BookSubTitle><BookVolumeNumber>2002</BookVolumeNumber><BookSequenceNumber>2002</BookSequenceNumber><BookDOI>10.1007/3-540-45406-3</BookDOI><BookTitleID>66986</BookTitleID><BookPrintISBN>978-3-540-41950-1</BookPrintISBN><BookElectronicISBN>978-3-540-45406-9</BookElectronicISBN><BookChapterCount>6</BookChapterCount><BookHistory><OnlineDate><Year>2001</Year><Month>4</Month><Day>25</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I21017" Priority="2" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I14010" Priority="4" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I17001" Priority="5" Type="Secondary">Mathematics of Computing</BookSubject><BookSubject Code="M24005" Priority="6" Type="Secondary">Mathematical Logic and Foundations</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Hubert</GivenName><FamilyName>Comon</FamilyName></EditorName><Contact><Email>Hubert.Comon@lsv.ens-cachan.fr</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Claude</GivenName><FamilyName>Marché</FamilyName></EditorName><Contact><Email>treinen@lri.fr</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Ralf</GivenName><FamilyName>Treinen</FamilyName></EditorName><Contact><Email>treinen@lri.fr</Email></Contact></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgDivision>Laboratoire Spécification et Vérification</OrgDivision><OrgName>École Normale Supérieure de Cachan</OrgName><OrgAddress><Street>61, avenue du Président Wilson</Street><Postcode>94234</Postcode><City>Cachan Cedex</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>Laboratoire de Recherche en Informatique</OrgDivision><OrgName>Université Paris-Sud</OrgName><OrgAddress><Street>Bâtiment 490</Street><Postcode>91405</Postcode><City>Orsay Cedex</City><Country>France</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap3" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="ChapterContent" TocLevels="0"><ChapterID>3</ChapterID><ChapterDOI>10.1007/3-540-45406-3_3</ChapterDOI><ChapterSequenceNumber>3</ChapterSequenceNumber><ChapterTitle Language="En">Combining Constraint Solving</ChapterTitle><ChapterFirstPage>104</ChapterFirstPage><ChapterLastPage>158</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2001</Year><Month>4</Month><Day>24</Day></RegistrationDate><OnlineDate><Year>2001</Year><Month>4</Month><Day>25</Day></OnlineDate></ChapterHistory><ChapterGrants 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></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3-540-45406-3</BookID><BookTitle>Constraints in Computational Logics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Franz</GivenName><FamilyName>Baader</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Klaus</GivenName><GivenName>U.</GivenName><FamilyName>Schulz</FamilyName></AuthorName></Author><Affiliation ID="Aff6"><OrgName>Theoretical Computer Science</OrgName><OrgAddress><City>RWTH Aachen</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgDivision>CIS</OrgDivision><OrgName>University of Munich</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>Both authors supported by the ESPRIT working group CCL-II, ref.WG # 22457</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Combining Constraint Solving</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Combining Constraint Solving</title></titleInfo><name type="personal"><namePart type="given">Franz</namePart><namePart type="family">Baader</namePart><affiliation>Theoretical Computer Science, RWTH Aachen, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Klaus</namePart><namePart type="given">U.</namePart><namePart type="family">Schulz</namePart><affiliation>CIS, University of Munich, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="research-article" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2001</dateIssued><copyrightDate encoding="w3cdtf">2001</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems.</abstract><relatedItem type="host"><titleInfo><title>Constraints in Computational Logics</title><subTitle>Theory and Applications International Summer School, CCL ’99 Gif-sur-Yvette, France, September 5–8, 1999 Revised Lectures</subTitle></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Hubert</namePart><namePart type="family">Comon</namePart><affiliation>Laboratoire Spécification et Vérification, École Normale Supérieure de Cachan, 61, avenue du Président Wilson, 94234, Cachan Cedex, France</affiliation><affiliation>E-mail: Hubert.Comon@lsv.ens-cachan.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Claude</namePart><namePart type="family">Marché</namePart><affiliation>Laboratoire de Recherche en Informatique, Université Paris-Sud, Bâtiment 490, 91405, Orsay Cedex, France</affiliation><affiliation>E-mail: treinen@lri.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Ralf</namePart><namePart type="family">Treinen</namePart><affiliation>Laboratoire de Recherche en Informatique, Université Paris-Sud, Bâtiment 490, 91405, Orsay Cedex, France</affiliation><affiliation>E-mail: treinen@lri.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I17001">Mathematics of Computing</topic><topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic></subject><identifier type="DOI">10.1007/3-540-45406-3</identifier><identifier type="ISBN">978-3-540-41950-1</identifier><identifier type="eISBN">978-3-540-45406-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">66986</identifier><identifier type="BookID">3-540-45406-3</identifier><identifier type="BookChapterCount">6</identifier><identifier type="BookVolumeNumber">2002</identifier><identifier type="BookSequenceNumber">2002</identifier><part><date>2001</date><detail type="volume"><number>2002</number><caption>vol.</caption></detail><extent unit="pages"><start>104</start><end>158</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><identifier type="istex">04B1718899ADA73AB4405AC3D891284B2B13C367</identifier><identifier type="ark">ark:/67375/HCB-7VFQZLVC-4</identifier><identifier type="DOI">10.1007/3-540-45406-3_3</identifier><identifier type="ChapterID">3</identifier><identifier type="ChapterID">Chap3</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-7VFQZLVC-4/record.json</uri></json:item></metadata></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 000094 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000094 | 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:04B1718899ADA73AB4405AC3D891284B2B13C367
|texte= Combining Constraint Solving
}}
| This area was generated with Dilib version V0.6.33. |  |