InforLorV4, PascalFrancis, Corpus, bibRecord, 000B56

SoleX : A domain-independent scheme for constraint solver extension

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

SoleX : A domain-independent scheme for constraint solver extension

Auteurs : E. Monfroy ; C. Ringeissen

Source :

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

RBID : Pascal:99-0033983

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Programmation logique avec contrainte, Démonstration automatique, Démonstration théorème, Robotique.

English descriptors

KwdEn :
- Artificial intelligence, Automatic proving, Constraint logic programming, Robotics, Theorem proving.

Abstract

In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.

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 SoleX : A domain-independent scheme for constraint solver extension`
A09	`01`	`1`	`ENG`	`@1 AISC'98 : artificial intelligence and symbolic computation : Plattsburgh NY, 16-18 September 1998`
A11	`01`	`1`		`@1 MONFROY (E.)`
A11	`02`	`1`		`@1 RINGEISSEN (C.)`
A12	`01`	`1`		`@1 CALMET (Jacques) @9 ed.`
A12	`02`	`1`		`@1 PLAZA (Jan) @9 ed.`
A14	`01`			`@1 CWI, P.O. Box 94079 @2 1090 GB Amsterdam @3 NLD @Z 1 aut.`
A14	`02`			`@1 LORIA-INRIA, 615 rue du Jardin Botanique, BP 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 2 aut.`
A20				`@1 222-233`
A21				`@1 1998`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-64960-3`
A43	`01`			`@1 INIST @2 16343 @5 354000070126370180`
A44				`@0 0000 @1 © 1999 INIST-CNRS. All rights reserved.`
A45				`@0 17 ref.`
A47	`01`	`1`		`@0 99-0033983`
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 In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.
C02	`01`	`X`		`@0 001D02C01`
C02	`02`	`X`		`@0 001D02D11`
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 Programmation logique avec contrainte @5 02`
C03	`02`	`X`	`ENG`	`@0 Constraint logic programming @5 02`
C03	`02`	`X`	`SPA`	`@0 Programación lógica con restricción @5 02`
C03	`03`	`X`	`FRE`	`@0 Démonstration automatique @5 03`
C03	`03`	`X`	`ENG`	`@0 Automatic proving @5 03`
C03	`03`	`X`	`SPA`	`@0 Demostración automática @5 03`
C03	`04`	`X`	`FRE`	`@0 Démonstration théorème @5 04`
C03	`04`	`X`	`ENG`	`@0 Theorem proving @5 04`
C03	`04`	`X`	`SPA`	`@0 Demostración teorema @5 04`
C03	`05`	`X`	`FRE`	`@0 Robotique @5 05`
C03	`05`	`X`	`ENG`	`@0 Robotics @5 05`
C03	`05`	`X`	`SPA`	`@0 Robótica @5 05`
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-0033983 INIST
ET :	SoleX : A domain-independent scheme for constraint solver extension
AU :	MONFROY (E.); RINGEISSEN (C.); CALMET (Jacques); PLAZA (Jan)
AF :	CWI, P.O. Box 94079/1090 GB Amsterdam/Pays-Bas (1 aut.); LORIA-INRIA, 615 rue du Jardin Botanique, BP 101/54602 Villers-lès-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. 222-233; Bibl. 17 ref.
LA :	Anglais
EA :	In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.
CC :	001D02C01; 001D02D11
FD :	Intelligence artificielle; Programmation logique avec contrainte; Démonstration automatique; Démonstration théorème; Robotique
ED :	Artificial intelligence; Constraint logic programming; Automatic proving; Theorem proving; Robotics
SD :	Inteligencia artificial; Programación lógica con restricción; Demostración automática; Demostración teorema; Robótica
LO :	INIST-16343.354000070126370180
ID :	99-0033983

Links to Exploration step

Pascal:99-0033983

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">SoleX : A domain-independent scheme for constraint solver extension</title>
<author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name>
<affiliation><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Ringeissen, C" sort="Ringeissen, C" uniqKey="Ringeissen C" first="C." last="Ringeissen">C. Ringeissen</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-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-0033983</idno>
<date when="1998">1998</date>
<idno type="stanalyst">PASCAL 99-0033983 INIST</idno>
<idno type="RBID">Pascal:99-0033983</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B56</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">SoleX : A domain-independent scheme for constraint solver extension</title>
<author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name>
<affiliation><inist:fA14 i1="01"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Ringeissen, C" sort="Ringeissen, C" uniqKey="Ringeissen C" first="C." last="Ringeissen">C. Ringeissen</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-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>Constraint logic programming</term>
<term>Robotics</term>
<term>Theorem proving</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Programmation logique avec contrainte</term>
<term>Démonstration automatique</term>
<term>Démonstration théorème</term>
<term>Robotique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.</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>SoleX : A domain-independent scheme for constraint solver extension</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>MONFROY (E.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RINGEISSEN (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>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>222-233</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>354000070126370180</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>17 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0033983</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>In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C01</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02D11</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>Programmation logique avec contrainte</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Robotique</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Robotics</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Robótica</s0>
<s5>05</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-0033983 INIST</NO>
<ET>SoleX : A domain-independent scheme for constraint solver extension</ET>
<AU>MONFROY (E.); RINGEISSEN (C.); CALMET (Jacques); PLAZA (Jan)</AU>
<AF>CWI, P.O. Box 94079/1090 GB Amsterdam/Pays-Bas (1 aut.); LORIA-INRIA, 615 rue du Jardin Botanique, BP 101/54602 Villers-lès-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. 222-233; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.</EA>
<CC>001D02C01; 001D02D11</CC>
<FD>Intelligence artificielle; Programmation logique avec contrainte; Démonstration automatique; Démonstration théorème; Robotique</FD>
<ED>Artificial intelligence; Constraint logic programming; Automatic proving; Theorem proving; Robotics</ED>
<SD>Inteligencia artificial; Programación lógica con restricción; Demostración automática; Demostración teorema; Robótica</SD>
<LO>INIST-16343.354000070126370180</LO>
<ID>99-0033983</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 000B56 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000B56 | 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-0033983
   |texte=   SoleX : A domain-independent scheme for constraint solver extension
}}

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

SoleX : A domain-independent scheme for constraint solver extension

SoleX : A domain-independent scheme for constraint solver extension

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