InforLorV4, Main, Exploration, bibRecordById, ISTEX:CF8DA7BA0D6989BB6E0BD4E57BF247E6641ADFCB

A model for generalization based on confirmatory induction

Identifieur interne : 00BC83 ( Main/Exploration ); précédent : 00BC82; suivant : 00BC84

A model for generalization based on confirmatory induction

Auteurs : Nicolas Lachiche [France] ; Pierre Marquis [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:CF8DA7BA0D6989BB6E0BD4E57BF247E6641ADFCB

Descripteurs français

Pascal (Inist)
- Algorithme apprentissage, Circonscription, Intelligence artificielle.
Wicri :
- topic : Intelligence artificielle.

English descriptors

KwdEn :
- Artificial intelligence, Circumscription, Learning algorithm.

Abstract

Abstract: Confirmatory induction is based on the assumption that unknown individuals are similar to known ones, i.e. they satisfy the properties shared by known individuals. This assumption can be represented inside a non-monotonic logical framework. Accordingly, existing approaches to confirmatory induction take advantage of the machinery developed so far for non-monotonic inference. However, they are based on completion policies that are unnecessary strong for the induction purpose. The contribution of this paper is twofold: some basic requirements that any model for generalization based on confirmatory induction should satisfy are proposed. Then, a model for generalization based on Hempel's notion of confirmation is introduced. This model is rational in the sense that it satisfies the rationality postulates we exhibit; moreover, the completion principle on which this model is based captures exactly the similarity assumption, hence the model can be considered minimal as well.

Url:

https://api.istex.fr/ark:/67375/HCB-682XM91Z-R/fulltext.pdf

DOI: 10.1007/3-540-62858-4_80

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A model for generalization based on confirmatory induction</title>
<author><name sortKey="Lachiche, Nicolas" sort="Lachiche, Nicolas" uniqKey="Lachiche N" first="Nicolas" last="Lachiche">Nicolas Lachiche</name>
</author>
<author><name sortKey="Marquis, Pierre" sort="Marquis, Pierre" uniqKey="Marquis P" first="Pierre" last="Marquis">Pierre Marquis</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:CF8DA7BA0D6989BB6E0BD4E57BF247E6641ADFCB</idno>
<date when="1997" year="1997">1997</date>
<idno type="doi">10.1007/3-540-62858-4_80</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-682XM91Z-R/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003129</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003129</idno>
<idno type="wicri:Area/Istex/Curation">003089</idno>
<idno type="wicri:Area/Istex/Checkpoint">002816</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002816</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Lachiche N:a:model:for</idno>
<idno type="wicri:Area/Main/Merge">00C461</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:97-0390502</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C48</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000C31</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000C46</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C46</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Lachiche N:a:model:for</idno>
<idno type="wicri:Area/Main/Merge">00C543</idno>
<idno type="wicri:Area/Main/Curation">00BC83</idno>
<idno type="wicri:Area/Main/Exploration">00BC83</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A model for generalization based on confirmatory induction</title>
<author><name sortKey="Lachiche, Nicolas" sort="Lachiche, Nicolas" uniqKey="Lachiche N" first="Nicolas" last="Lachiche">Nicolas Lachiche</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Campus scientifique, CRIN/CNRS - INRIA Lorraine, Bâtiment LORIA, B.P. 239, 54506, Vandœzuvre-lès-Nancy Cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœzuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Marquis, Pierre" sort="Marquis, Pierre" uniqKey="Marquis P" first="Pierre" last="Marquis">Pierre Marquis</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIL/Université d'Artois, Rue de l'Université, S.P. 16, 62307, Lens Cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Hauts-de-France</region>
<region type="old region" nuts="2">Nord-Pas-de-Calais</region>
<settlement type="city">Lens (Pas-de-Calais)</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Circumscription</term>
<term>Learning algorithm</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme apprentissage</term>
<term>Circonscription</term>
<term>Intelligence artificielle</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Confirmatory induction is based on the assumption that unknown individuals are similar to known ones, i.e. they satisfy the properties shared by known individuals. This assumption can be represented inside a non-monotonic logical framework. Accordingly, existing approaches to confirmatory induction take advantage of the machinery developed so far for non-monotonic inference. However, they are based on completion policies that are unnecessary strong for the induction purpose. The contribution of this paper is twofold: some basic requirements that any model for generalization based on confirmatory induction should satisfy are proposed. Then, a model for generalization based on Hempel's notion of confirmation is introduced. This model is rational in the sense that it satisfies the rationality postulates we exhibit; moreover, the completion principle on which this model is based captures exactly the similarity assumption, hence the model can be considered minimal as well.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Hauts-de-France</li>
<li>Lorraine (région)</li>
<li>Nord-Pas-de-Calais</li>
</region>
<settlement><li>Lens (Pas-de-Calais)</li>
<li>Vandœzuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Lachiche, Nicolas" sort="Lachiche, Nicolas" uniqKey="Lachiche N" first="Nicolas" last="Lachiche">Nicolas Lachiche</name>
</region>
<name sortKey="Lachiche, Nicolas" sort="Lachiche, Nicolas" uniqKey="Lachiche N" first="Nicolas" last="Lachiche">Nicolas Lachiche</name>
<name sortKey="Marquis, Pierre" sort="Marquis, Pierre" uniqKey="Marquis P" first="Pierre" last="Marquis">Pierre Marquis</name>
<name sortKey="Marquis, Pierre" sort="Marquis, Pierre" uniqKey="Marquis P" first="Pierre" last="Marquis">Pierre Marquis</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BC83 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00BC83 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:CF8DA7BA0D6989BB6E0BD4E57BF247E6641ADFCB
   |texte=   A model for generalization based on confirmatory induction
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

A model for generalization based on confirmatory induction

A model for generalization based on confirmatory induction

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.