Teeft.i
Checkpoint
Istex
Racine
Checkpoint
Istex
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (Istex)

Index « Teeft.i » - entrée « Clause »
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.
Clausal subsumption < Clause < Clause component  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 20.
Ident.Authors (with country if any)Title
001D95 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
001E62 (2001) N. Peltier [France]On the decidability of the PVD class with equality
001F31 (2001) He Le Ne Kirchner ; Peter D. MossesAlgebraic Specifications, Higher‐order Types and Set‐theoretic Models
001F42 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
001F63 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
002134 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
002454 (1999) K. Stokkermans [Autriche]A Categorical Critical-pair Completion Algorithm
002462 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
002583 (1998) Christopher Lynch [France]Local Simplification
002759 (1997) Robert Nieuwenhuis [Espagne] ; Albert Rubio [Espagne]Paramodulation with Built-in AC-Theories and Symbolic Constraints
002761 (1997) Christopher Lynch [France]Oriented Equational Logic Programming is Complete
002804 (1997) Adel Bouhoula [États-Unis]Automated Theorem Proving by Test Set Induction
002807 (1997) Gilles Richard ; Fre De Ric SaubionAnswer Synthesis for CLP Programs with Negation
002831 (1996) Adel Bouhoula [France]Using induction and rewriting to verify and complete parameterized specifications
002980 (1996) Nadia Creignou [France] ; Miki Hermann [France]Complexity of Generalized Satisfiability Counting Problems
002A69 (1995) Dan E. Tamir [États-Unis] ; Ravi Ananthakrishnan [États-Unis] ; Abraham Kandel [États-Unis]A visual debugger for pure Prolog
002B29 (1995) Emmanuel Kounalis [France] ; Michaël Rusinowitch [France]Reasoning with conditional axioms
002B62 (1995) Adel Bouhoula [France] ; Michaël Rusinowitch [France]Implicit induction in conditional theories
002B95 (1995) Michaël Rusinowitch [France] ; Laurent Vigneron [France]Automated deduction with associative-commutative operators
003693 (1985) Jieh Hsiang [États-Unis]Refutational theorem proving using term-rewriting systems

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i -k "Clause" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i  \
                -Sk "Clause" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Teeft.i
   |clé=    Clause
}}
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