View in EDS

Constraint acquisition.

Saved in:
Bibliographic Details
Title: Constraint acquisition.
Authors: Bessiere, Christian1 bessiere@lirmm.fr, Koriche, Frédéric2, Lazaar, Nadjib1, O'Sullivan, Barry3
Source: Artificial Intelligence. Mar2017, Vol. 244, p315-342. 28p.
Subjects: Constraint programming, Acquisition of data, Complexity (Philosophy), Machine learning, Constraint satisfaction
Abstract: Constraint programming is used to model and solve complex combinatorial problems. The modeling task requires some expertise in constraint programming. This requirement is a bottleneck to the broader uptake of constraint technology. Several approaches have been proposed to assist the non-expert user in the modeling task. This paper presents the basic architecture for acquiring constraint networks from examples classified by the user. The theoretical questions raised by constraint acquisition are stated and their complexity is given. We then propose Conacq , a system that uses a concise representation of the learner's version space into a clausal formula. Based on this logical representation, our architecture uses strategies for eliciting constraint networks in both the passive acquisition context, where the learner is only provided a pool of examples, and the active acquisition context, where the learner is allowed to ask membership queries to the user. The computational properties of our strategies are analyzed and their practical effectiveness is experimentally evaluated. [ABSTRACT FROM AUTHOR]
Copyright of Artificial Intelligence is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 121131846
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Constraint acquisition.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bessiere%2C+Christian%22">Bessiere, Christian</searchLink><relatesTo>1</relatesTo><i> bessiere@lirmm.fr</i><br /><searchLink fieldCode="AR" term="%22Koriche%2C+Frédéric%22">Koriche, Frédéric</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Lazaar%2C+Nadjib%22">Lazaar, Nadjib</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22O'Sullivan%2C+Barry%22">O'Sullivan, Barry</searchLink><relatesTo>3</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Artificial+Intelligence%22">Artificial Intelligence</searchLink>. Mar2017, Vol. 244, p315-342. 28p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Constraint+programming%22">Constraint programming</searchLink><br /><searchLink fieldCode="DE" term="%22Acquisition+of+data%22">Acquisition of data</searchLink><br /><searchLink fieldCode="DE" term="%22Complexity+%28Philosophy%29%22">Complexity (Philosophy)</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+learning%22">Machine learning</searchLink><br /><searchLink fieldCode="DE" term="%22Constraint+satisfaction%22">Constraint satisfaction</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Constraint programming is used to model and solve complex combinatorial problems. The modeling task requires some expertise in constraint programming. This requirement is a bottleneck to the broader uptake of constraint technology. Several approaches have been proposed to assist the non-expert user in the modeling task. This paper presents the basic architecture for acquiring constraint networks from examples classified by the user. The theoretical questions raised by constraint acquisition are stated and their complexity is given. We then propose Conacq , a system that uses a concise representation of the learner's version space into a clausal formula. Based on this logical representation, our architecture uses strategies for eliciting constraint networks in both the passive acquisition context, where the learner is only provided a pool of examples, and the active acquisition context, where the learner is allowed to ask membership queries to the user. The computational properties of our strategies are analyzed and their practical effectiveness is experimentally evaluated. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Artificial Intelligence is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=121131846
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.artint.2015.08.001
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 28
        StartPage: 315
    Subjects:
      – SubjectFull: Constraint programming
        Type: general
      – SubjectFull: Acquisition of data
        Type: general
      – SubjectFull: Complexity (Philosophy)
        Type: general
      – SubjectFull: Machine learning
        Type: general
      – SubjectFull: Constraint satisfaction
        Type: general
    Titles:
      – TitleFull: Constraint acquisition.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bessiere, Christian
      – PersonEntity:
          Name:
            NameFull: Koriche, Frédéric
      – PersonEntity:
          Name:
            NameFull: Lazaar, Nadjib
      – PersonEntity:
          Name:
            NameFull: O'Sullivan, Barry
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2017
              Type: published
              Y: 2017
          Identifiers:
            – Type: issn-print
              Value: 00043702
          Numbering:
            – Type: volume
              Value: 244
          Titles:
            – TitleFull: Artificial Intelligence
              Type: main
ResultId 1