InforLorV4, PascalFrancis, Corpus, bibRecord, 000B55

Basic Completion with E-cycle Simplification

Identifieur interne : 000B55 ( PascalFrancis/Corpus ); précédent : 000B54; suivant : 000B56

Basic Completion with E-cycle Simplification

Auteurs : C. Lynch ; C. Scharff

Source :

Lecture notes in computer science [ 0302-9743 ] ; 1998.

RBID : Pascal:99-0034238

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Calcul symbolique, Système réécriture, Démonstration automatique, Démonstration théorème, Règle inférence.

English descriptors

KwdEn :
- Artificial intelligence, Automatic proving, Inference rule, Rewriting systems, Symbolic computation, Theorem proving.

Abstract

We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1476`
A08	`01`	`1`	`ENG`	`@1 Basic Completion with E-cycle Simplification`
A09	`01`	`1`	`ENG`	`@1 AISC'98 : artificial intelligence and symbolic computation : Plattsburgh NY, 16-18 September 1998`
A11	`01`	`1`		`@1 LYNCH (C.)`
A11	`02`	`1`		`@1 SCHARFF (C.)`
A12	`01`	`1`		`@1 CALMET (Jacques) @9 ed.`
A12	`02`	`1`		`@1 PLAZA (Jan) @9 ed.`
A14	`01`			`@1 Department of Mathematics and Computer Science Box 5815, Clarkson University @2 Potsdam, NY 13699-5815 @3 USA @Z 1 aut.`
A14	`02`			`@1 LORIA BP 239 @2 54506 Vandoeuvre-les-Nancy @3 FRA @Z 2 aut.`
A20				`@1 209-221`
A21				`@1 1998`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-64960-3`
A43	`01`			`@1 INIST @2 16343 @5 354000070126370170`
A44				`@0 0000 @1 © 1999 INIST-CNRS. All rights reserved.`
A45				`@0 11 ref.`
A47	`01`	`1`		`@0 99-0034238`
A60				`@1 P @2 C`
A61				`@0 A`
A64		`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	@0 We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.
C02	`01`	`X`		`@0 001D02C01`
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 Calcul symbolique @5 02`
C03	`02`	`X`	`ENG`	`@0 Symbolic computation @5 02`
C03	`02`	`X`	`SPA`	`@0 Cálculo simbólico @5 02`
C03	`03`	`3`	`FRE`	`@0 Système réécriture @5 03`
C03	`03`	`3`	`ENG`	`@0 Rewriting systems @5 03`
C03	`04`	`X`	`FRE`	`@0 Démonstration automatique @5 04`
C03	`04`	`X`	`ENG`	`@0 Automatic proving @5 04`
C03	`04`	`X`	`SPA`	`@0 Demostración automática @5 04`
C03	`05`	`X`	`FRE`	`@0 Démonstration théorème @5 05`
C03	`05`	`X`	`ENG`	`@0 Theorem proving @5 05`
C03	`05`	`X`	`SPA`	`@0 Demostración teorema @5 05`
C03	`06`	`X`	`FRE`	`@0 Règle inférence @5 06`
C03	`06`	`X`	`ENG`	`@0 Inference rule @5 06`
C03	`06`	`X`	`SPA`	`@0 Regla inferencia @5 06`
N21				`@1 018`

A30	`01`	`1`	`ENG`	`@1 Artificial intelligence and symbolic computation. International conference @3 Plattsburgh NY USA @4 1998-09-16`

Format Inist (serveur)

NO :	PASCAL 99-0034238 INIST
ET :	Basic Completion with E-cycle Simplification
AU :	LYNCH (C.); SCHARFF (C.); CALMET (Jacques); PLAZA (Jan)
AF :	Department of Mathematics and Computer Science Box 5815, Clarkson University/Potsdam, NY 13699-5815/Etats-Unis (1 aut.); LORIA BP 239/54506 Vandoeuvre-les-Nancy/France (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1998; Vol. 1476; Pp. 209-221; Bibl. 11 ref.
LA :	Anglais
EA :	We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.
CC :	001D02C01
FD :	Intelligence artificielle; Calcul symbolique; Système réécriture; Démonstration automatique; Démonstration théorème; Règle inférence
ED :	Artificial intelligence; Symbolic computation; Rewriting systems; Automatic proving; Theorem proving; Inference rule
SD :	Inteligencia artificial; Cálculo simbólico; Demostración automática; Demostración teorema; Regla inferencia
LO :	INIST-16343.354000070126370170
ID :	99-0034238

Links to Exploration step

Pascal:99-0034238

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Basic Completion with E-cycle Simplification</title>
<author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<affiliation><inist:fA14 i1="01"><s1>Department of Mathematics and Computer Science Box 5815, Clarkson University</s1>
<s2>Potsdam, NY 13699-5815</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0034238</idno>
<date when="1998">1998</date>
<idno type="stanalyst">PASCAL 99-0034238 INIST</idno>
<idno type="RBID">Pascal:99-0034238</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B55</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Basic Completion with E-cycle Simplification</title>
<author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<affiliation><inist:fA14 i1="01"><s1>Department of Mathematics and Computer Science Box 5815, Clarkson University</s1>
<s2>Potsdam, NY 13699-5815</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1998">1998</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Automatic proving</term>
<term>Inference rule</term>
<term>Rewriting systems</term>
<term>Symbolic computation</term>
<term>Theorem proving</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Calcul symbolique</term>
<term>Système réécriture</term>
<term>Démonstration automatique</term>
<term>Démonstration théorème</term>
<term>Règle inférence</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1476</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Basic Completion with E-cycle Simplification</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>AISC'98 : artificial intelligence and symbolic computation : Plattsburgh NY, 16-18 September 1998</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>LYNCH (C.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SCHARFF (C.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>CALMET (Jacques)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>PLAZA (Jan)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Department of Mathematics and Computer Science Box 5815, Clarkson University</s1>
<s2>Potsdam, NY 13699-5815</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA BP 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>209-221</s1>
</fA20>
<fA21><s1>1998</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-64960-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000070126370170</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>11 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0034238</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C01</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>Calcul symbolique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Symbolic computation</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Cálculo simbólico</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Règle inférence</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Inference rule</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Regla inferencia</s0>
<s5>06</s5>
</fC03>
<fN21><s1>018</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Artificial intelligence and symbolic computation. International conference</s1>
<s3>Plattsburgh NY USA</s3>
<s4>1998-09-16</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 99-0034238 INIST</NO>
<ET>Basic Completion with E-cycle Simplification</ET>
<AU>LYNCH (C.); SCHARFF (C.); CALMET (Jacques); PLAZA (Jan)</AU>
<AF>Department of Mathematics and Computer Science Box 5815, Clarkson University/Potsdam, NY 13699-5815/Etats-Unis (1 aut.); LORIA BP 239/54506 Vandoeuvre-les-Nancy/France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1998; Vol. 1476; Pp. 209-221; Bibl. 11 ref.</SO>
<LA>Anglais</LA>
<EA>We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.</EA>
<CC>001D02C01</CC>
<FD>Intelligence artificielle; Calcul symbolique; Système réécriture; Démonstration automatique; Démonstration théorème; Règle inférence</FD>
<ED>Artificial intelligence; Symbolic computation; Rewriting systems; Automatic proving; Theorem proving; Inference rule</ED>
<SD>Inteligencia artificial; Cálculo simbólico; Demostración automática; Demostración teorema; Regla inferencia</SD>
<LO>INIST-16343.354000070126370170</LO>
<ID>99-0034238</ID>
</server>
</inist>
</record>

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 000B55 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000B55 | 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:99-0034238
   |texte=   Basic Completion with E-cycle Simplification
}}

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
	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.

Serveur d'exploration sur la recherche en informatique en Lorraine

Basic Completion with E-cycle Simplification

Basic Completion with E-cycle Simplification

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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