Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Keywords » - entrée « automated theorem proving »
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.
automated testing < automated theorem proving < automated translation  Facettes :

List of bibliographic references indexed by automated theorem proving

Number of relevant bibliographic references: 23.
[0-20] [0 - 20][0 - 23][20-22][20-40]
Ident.Authors (with country if any)Title
003665 (2009-03-23) Guillaume Burel [France]Good proofs in deduction modulo
003994 (2009) Clément Houtmann [France]Axiom Directed Focusing
006040 (2005) Guillaume BurelSystèmes Canoniques Abstraits : Application à la Déduction Naturelle et à la Complétion
006396 (2005) Guillaume Burel [France]Systèmes Canoniques Abstraits : Application à la Déduction Naturelle et à la Complétion
006670 (2004-03) Moussa Demba ; Khaled Bsaïes ; Francis Alexandre [France]Proving Theorems by Folding/Unfolding
007472 (2003) Gilles Dowek ; Thérèse Hardin ; Claude KirchnerTheorem Proving Modulo
007755 (2003) Moussa Demba ; Khaled Bsaies ; Francis AlexandreCorrecting Faulty Conjectures by Logic Program Synthesis
007809 (2003) Eric Deplagne ; Claude Kirchner ; Hélène Kirchner ; Quang Huy NguyenProof Search and Proof Check for Equational and Inductive Theorems
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
007E40 (2003) Moussa Demba ; Khaled Bsaïes ; Francis Alexandre [France]Correcting Faulty Conjectures by Logic Program Synthesis
009095 (2001) Jürgen StuberA 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
009B19 (2000) Jürgen StuberDeriving Theory Superposition Calculi from Convergent Term Rewriting Systems
00A702 (1999) Sorin StratulatA General Framework to Build Multi-logic Implicit Induction Provers
00B557 (1998) Gilles Dowek [France] ; Thérèse Hardin ; Claude Kirchner [France]Theorem Proving Modulo
00B641 (1998) Gilles Dowek [France] ; Thérèse Hardin ; Claude Kirchner [France]Holls: an Intentional First-Order Expression of Higher-Order Logic
00C062 (1996) Francois Bronsard [France] ; Uday S. Reddy [États-Unis] ; Robert W. Hasker [États-Unis]Induction using term orders
00CB57 (1994) D. Lugiez ; J.-L. MoyssetTree Automata Help Solve Equational Formulae in AC-Theories
00CF98 (1993) A. Bouhoula ; M. RusinowitchAutomatic Case Analysis in Proof by Induction
00D016 (1993) N. Brown ; D. MéryA Proof Environment for Concurrent Programs

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 "automated theorem proving" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "automated theorem proving" \
         | 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é=    automated theorem proving
}}

Wicri

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