Combining generic and domain specific Reasoning by using contexts
Identifieur interne :
000779 ( PascalFrancis/Corpus );
précédent :
000778;
suivant :
000780
Combining generic and domain specific Reasoning by using contexts
Auteurs : Silvio RaniseSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2002.
RBID : Pascal:03-0367523
Descripteurs français
English descriptors
Abstract
The most effective theorem proving systems (such as PVS, Acl2, and HOL) provide a kind of two-level reasoning, where the knowledge of a given domain is treated by a special purpose reasoner and a generic reasoning module is used for the actual problem specification. To obtain an effective integration between these two levels of reasoning is far from being a trivial task. In this paper, we propose a combination of Window Reasoning and Constraint Contextual Rewriting to achieve an effective integration of such levels. The former supports hierarchical reasoning for arbitrarily complex expressions. The latter provides the necessary theorem proving support for domain specific reasoning. The two levels of reasoning cooperate by building and exploiting a context, i.e. a set of facts which can be assumed true while transforming a given subexpression. We also argue that the proposed combination schema can be useful for building sound simplifiers to be used in computer algebra systems.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2385 |
|---|
| A08 | 01 | 1 | ENG | @1 Combining generic and domain specific Reasoning by using contexts |
|---|
| A09 | 01 | 1 | ENG | @1 AISC 2002 : artificial intelligence, automated reasoning, and symbolic computation : Marseille, 1-5 July 2002 |
|---|
| A11 | 01 | 1 | | @1 RANISE (Silvio) |
|---|
| A12 | 01 | 1 | | @1 CALMET (Jacques) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 BENHAMOU (Belaid) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 CAPROTTI (Olga) @9 ed. |
|---|
| A12 | 04 | 1 | | @1 HENOCQUE (Laurent) @9 ed. |
|---|
| A12 | 05 | 1 | | @1 SORGE (Volker) @9 ed. |
|---|
| A14 | 01 | | | @1 Université H. Poincaré-Nancy 2 & LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers Les Nancy @3 FRA @Z 1 aut. |
|---|
| A20 | | | | @1 305-318 |
|---|
| A21 | | | | @1 2002 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-43865-3 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000108487530250 |
|---|
| A44 | | | | @0 0000 @1 © 2003 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 25 ref. |
|---|
| A47 | 01 | 1 | | @0 03-0367523 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 The most effective theorem proving systems (such as PVS, Acl2, and HOL) provide a kind of two-level reasoning, where the knowledge of a given domain is treated by a special purpose reasoner and a generic reasoning module is used for the actual problem specification. To obtain an effective integration between these two levels of reasoning is far from being a trivial task. In this paper, we propose a combination of Window Reasoning and Constraint Contextual Rewriting to achieve an effective integration of such levels. The former supports hierarchical reasoning for arbitrarily complex expressions. The latter provides the necessary theorem proving support for domain specific reasoning. The two levels of reasoning cooperate by building and exploiting a context, i.e. a set of facts which can be assumed true while transforming a given subexpression. We also argue that the proposed combination schema can be useful for building sound simplifiers to be used in computer algebra systems. |
|---|
| C02 | 01 | X | | @0 001D02C02 |
|---|
| C03 | 01 | X | FRE | @0 Intelligence artificielle @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Artificial intelligence @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Inteligencia artificial @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Démonstration théorème @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Theorem proving @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Demostración teorema @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Réécriture @5 11 |
|---|
| C03 | 03 | X | ENG | @0 Rewriting @5 11 |
|---|
| C03 | 03 | X | SPA | @0 Reescritura @5 11 |
|---|
| C03 | 04 | X | FRE | @0 Calcul formel @5 21 |
|---|
| C03 | 04 | X | ENG | @0 Computer algebra @5 21 |
|---|
| C03 | 04 | X | SPA | @0 Cálculo formal @5 21 |
|---|
| N21 | | | | @1 258 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Artificial intelligence, automated reasoning, and symbolic computation. Joint international conferences @3 Marseille FRA @4 2002-07-01 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 03-0367523 INIST |
|---|
| ET : | Combining generic and domain specific Reasoning by using contexts |
|---|
| AU : | RANISE (Silvio); CALMET (Jacques); BENHAMOU (Belaid); CAPROTTI (Olga); HENOCQUE (Laurent); SORGE (Volker) |
|---|
| AF : | Université H. Poincaré-Nancy 2 & LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101/54602 Villers Les Nancy /France (1 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2385; Pp. 305-318; Bibl. 25 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | The most effective theorem proving systems (such as PVS, Acl2, and HOL) provide a kind of two-level reasoning, where the knowledge of a given domain is treated by a special purpose reasoner and a generic reasoning module is used for the actual problem specification. To obtain an effective integration between these two levels of reasoning is far from being a trivial task. In this paper, we propose a combination of Window Reasoning and Constraint Contextual Rewriting to achieve an effective integration of such levels. The former supports hierarchical reasoning for arbitrarily complex expressions. The latter provides the necessary theorem proving support for domain specific reasoning. The two levels of reasoning cooperate by building and exploiting a context, i.e. a set of facts which can be assumed true while transforming a given subexpression. We also argue that the proposed combination schema can be useful for building sound simplifiers to be used in computer algebra systems. |
|---|
| CC : | 001D02C02 |
|---|
| FD : | Intelligence artificielle; Démonstration théorème; Réécriture; Calcul formel |
|---|
| ED : | Artificial intelligence; Theorem proving; Rewriting; Computer algebra |
|---|
| SD : | Inteligencia artificial; Demostración teorema; Reescritura; Cálculo formal |
|---|
| LO : | INIST-16343.354000108487530250 |
|---|
| ID : | 03-0367523 |
|---|
Links to Exploration step
Pascal:03-0367523
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Combining generic and domain specific Reasoning by using contexts</title>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation><inist:fA14 i1="01"><s1>Université H. Poincaré-Nancy 2 & LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers Les Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0367523</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0367523 INIST</idno>
<idno type="RBID">Pascal:03-0367523</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000779</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Combining generic and domain specific Reasoning by using contexts</title>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation><inist:fA14 i1="01"><s1>Université H. Poincaré-Nancy 2 & LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers Les Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2002">2002</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Computer algebra</term>
<term>Rewriting</term>
<term>Theorem proving</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Démonstration théorème</term>
<term>Réécriture</term>
<term>Calcul formel</term>
</keywords><front><div type="abstract" xml:lang="en">The most effective theorem proving systems (such as PVS, Acl2, and HOL) provide a kind of two-level reasoning, where the knowledge of a given domain is treated by a special purpose reasoner and a generic reasoning module is used for the actual problem specification. To obtain an effective integration between these two levels of reasoning is far from being a trivial task. In this paper, we propose a combination of Window Reasoning and Constraint Contextual Rewriting to achieve an effective integration of such levels. The former supports hierarchical reasoning for arbitrarily complex expressions. The latter provides the necessary theorem proving support for domain specific reasoning. The two levels of reasoning cooperate by building and exploiting a context, i.e. a set of facts which can be assumed true while transforming a given subexpression. We also argue that the proposed combination schema can be useful for building sound simplifiers to be used in computer algebra systems.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2385</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Combining generic and domain specific Reasoning by using contexts</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>AISC 2002 : artificial intelligence, automated reasoning, and symbolic computation : Marseille, 1-5 July 2002</s1>
</fA09><fA11 i1="01" i2="1"><s1>RANISE (Silvio)</s1>
</fA11><fA12 i1="01" i2="1"><s1>CALMET (Jacques)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>BENHAMOU (Belaid)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>CAPROTTI (Olga)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="04" i2="1"><s1>HENOCQUE (Laurent)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="05" i2="1"><s1>SORGE (Volker)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Université H. Poincaré-Nancy 2 & LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers Les Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>305-318</s1>
</fA20><fA21><s1>2002</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-43865-3</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108487530250</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>25 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>03-0367523</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>The most effective theorem proving systems (such as PVS, Acl2, and HOL) provide a kind of two-level reasoning, where the knowledge of a given domain is treated by a special purpose reasoner and a generic reasoning module is used for the actual problem specification. To obtain an effective integration between these two levels of reasoning is far from being a trivial task. In this paper, we propose a combination of Window Reasoning and Constraint Contextual Rewriting to achieve an effective integration of such levels. The former supports hierarchical reasoning for arbitrarily complex expressions. The latter provides the necessary theorem proving support for domain specific reasoning. The two levels of reasoning cooperate by building and exploiting a context, i.e. a set of facts which can be assumed true while transforming a given subexpression. We also argue that the proposed combination schema can be useful for building sound simplifiers to be used in computer algebra systems.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>11</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>11</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>11</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Calcul formel</s0>
<s5>21</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Computer algebra</s0>
<s5>21</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Cálculo formal</s0>
<s5>21</s5>
</fC03><fN21><s1>258</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Artificial intelligence, automated reasoning, and symbolic computation. Joint international conferences</s1>
<s3>Marseille FRA</s3>
<s4>2002-07-01</s4>
</fA30><server><NO>PASCAL 03-0367523 INIST</NO>
<ET>Combining generic and domain specific Reasoning by using contexts</ET>
<AU>RANISE (Silvio); CALMET (Jacques); BENHAMOU (Belaid); CAPROTTI (Olga); HENOCQUE (Laurent); SORGE (Volker)</AU>
<AF>Université H. Poincaré-Nancy 2 & LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101/54602 Villers Les Nancy /France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2385; Pp. 305-318; Bibl. 25 ref.</SO>
<LA>Anglais</LA>
<EA>The most effective theorem proving systems (such as PVS, Acl2, and HOL) provide a kind of two-level reasoning, where the knowledge of a given domain is treated by a special purpose reasoner and a generic reasoning module is used for the actual problem specification. To obtain an effective integration between these two levels of reasoning is far from being a trivial task. In this paper, we propose a combination of Window Reasoning and Constraint Contextual Rewriting to achieve an effective integration of such levels. The former supports hierarchical reasoning for arbitrarily complex expressions. The latter provides the necessary theorem proving support for domain specific reasoning. The two levels of reasoning cooperate by building and exploiting a context, i.e. a set of facts which can be assumed true while transforming a given subexpression. We also argue that the proposed combination schema can be useful for building sound simplifiers to be used in computer algebra systems.</EA>
<CC>001D02C02</CC>
<FD>Intelligence artificielle; Démonstration théorème; Réécriture; Calcul formel</FD>
<ED>Artificial intelligence; Theorem proving; Rewriting; Computer algebra</ED>
<SD>Inteligencia artificial; Demostración teorema; Reescritura; Cálculo formal</SD>
<LO>INIST-16343.354000108487530250</LO>
<ID>03-0367523</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000779 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000779 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:03-0367523
|texte= Combining generic and domain specific Reasoning by using contexts
}}
| 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 |  |
