<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-001-12-0762</article-id>
      <article-id pub-id-type="publisher-id">27192</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>H.3.3 - Information Search and Retrieval</subject>
          <subject>I.2 - ARTIFICIAL INTELLIGENCE</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Constraint Agents for the Information Age</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Andreoli</surname>
            <given-names>Jean-Marc</given-names>
          </name>
          <email xlink:type="simple">andreoli@xerox.fr</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Borghoff</surname>
            <given-names>Uwe M.</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Pareschi</surname>
            <given-names>Remo</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Schlichter</surname>
            <given-names>Johann H.</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Rank Xerox Research Centre, Meylan, France</addr-line>
        <institution>Rank Xerox Research Centre</institution>
        <addr-line content-type="city">Meylan</addr-line>
        <country>France</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">Institut fuer Informatik, Technische Universitaet Muenchen, Muenchen, Germany</addr-line>
        <institution>Institut fuer Informatik, Technische Universitaet Muenchen</institution>
        <addr-line content-type="city">Muenchen</addr-line>
        <country>Germany</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Jean-Marc Andreoli (<email xlink:type="simple">andreoli@xerox.fr</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>1995</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>12</month>
        <year>1995</year>
      </pub-date>
      <volume>1</volume>
      <issue>12</issue>
      <fpage>762</fpage>
      <lpage>789</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/BCD64DA9-7B83-52E7-BDD8-419F0FD9D68E">BCD64DA9-7B83-52E7-BDD8-419F0FD9D68E</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6995176">6995176</uri>
      <permissions>
        <copyright-statement>Jean-Marc Andreoli, Uwe M. Borghoff, Remo Pareschi, Johann H. Schlichter</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>We propose constraints as the appropriate computational constructs for the design of agents with the task of selecting, merging and managing electronic information coming from such services as Internet access, digital libraries, E-mail, or on-line information repositories. Specifically, we introduce the framework of Constraint-Based Knowledge Brokers, which are concurrent agents that use so-called signed feature constraints to represent partially specified information and can flexibly cooperate in the management of distributed knowledge. We illustrate our approach by several examples, and we define application scenarios based on related technology such as Telescript and workflow management systems.</p>
      </abstract>
    </article-meta>
  </front>
</article>
