resistance < resolution < resolution narrowing

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f KwdFr.f Mesh.f MeshFr.f Teeft.f

List of bibliographic references indexed by resolution

Number of relevant bibliographic references: 24.
[0-20] [0 - 20][0 - 24][20-23][20-40]

Ident.	Authors (with country if any)	Title
007472 (2003)	Gilles Dowek ; Thérèse Hardin ; Claude Kirchner	Theorem Proving Modulo
007981 (2003)	Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]	Theorem Proving Modulo
007D38 (2003)	Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]	Theorem Proving Modulo Revised Version
007D46 (2003)	Harald Ganzinger ; Jürgen Stuber [France]	Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transformation
009095 (2001)	Jürgen Stuber	A Model-based Completeness Proof of Extended Narrowing And Resolution
009711 (2001)	Jürgen Stuber [France]	A Model-based Completeness Proof of Extended Narrowing And Resolution
00A252 (2000)	Florent Jacquemard [France] ; Michaël Rusinowitch [France] ; Laurent Vigneron	Compiling and Verifying Security Protocols
00AF97 (1998)	Fabrice Rouillier	Solving zero-dimensional systems through the Rational Univariate Representation
00B578 (1998)	Fabrice Rouillier [France]	Solving Zero-dimensional Polynomial Systems through the Rational Univariate Representation
00C468 (1995)	Michael Rusinowitch ; Laurent Vigneron	Automated Deduction with Associative Commutative Operators
00C911 (1994)	Laurent Vigneron	Déduction automatique avec contraintes symboliques dans les théories équationnelles
00CA64 (1994)	Laurent Vigneron	Associative-Commutative Deduction with Constraints
00CB80 (1994)	Laurent Vigneron	Superposition in AC Theories : Proof of Completeness by Semantic Trees
00D248 (1993)	Michaël Rusinowitch [France] ; Laurent Vigneron [France]	Automated deduction with associative commutative operators
00D758 (1991)	A. Bouhoula	Preuve automatique par paramodulation, réécriture et induction
00D861 (1991)	J. Hsiang ; M. Rusinowitch	Proving Refutational Completeness of Theorem-Proving Strategies : The Transfinite Semantic Tree Method
00DB51 (1990)	F. Alexandre	Une transformation de programmes logiques en systèmes de réécriture
00DC75 (1990)	F. Alexandre	A Transformation of Logic Programs into Term Rewrite Systems
00E159 (1988)	E. Kounalis ; M. Rusinowitch	On word problems in Horn theories
00E192 (1988)	M. Rusinowitch	Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.
00E410 (1987)	M. Rusinowitch	Démonstration automatique par des techniques de réécriture

---

Pour manipuler ce document sous Unix (Dilib)

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

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i -k "resolution" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "resolution" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    resolution
}}

---

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