References in zbMATH (referenced in 15 articles )

Showing results 1 to 15 of 15.
Sorted by year (citations)

  1. Kersani, Abdelkader; Peltier, Nicolas: Completeness and decidability results for first-order clauses with indices (2013)
  2. Kersani, Abdelkader; Peltier, Nicolas: Combining superposition and induction: a practical realization (2013)
  3. Aravantinos, V.; Caferra, R.; Peltier, N.: Decidability and undecidability results for propositional schemata (2011)
  4. Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas: Perfect discrimination graphs: indexing terms with integer exponents (2010)
  5. Aravantinos, Vincent; Caferra, Ricardo; Peltier, Nicolas: A schemata calculus for propositional logic (2009)
  6. Nahon, Fabrice; Kirchner, Claude; Kirchner, Hélène; Brauner, Paul: Inductive proof search modulo (2009)
  7. Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas: Towards systematic analysis of theorem provers search spaces: First steps (2007)
  8. Gramlich, Bernhard: Strategic issues, problems and challenges in inductive theorem proving (2005)
  9. Gramlich, Bernhard: Strategic issues, problems and challenges in inductive theorem proving. (2005)
  10. Ponsini, Olivier; Fédéle, Carine; Kounalis, Emmanuel: Rewriting of imperative programs into logical equations (2005)
  11. Barthe, Gilles; Stratulat, Sorin: Validation of the JavaCard platform with implicit induction techniques (2003)
  12. Deplagne, Eric; Kirchner, Claude; Kirchner, Hélène; Nguyen, Quang Huy: Proof search and proof check for equational and inductive theorems. (2003)
  13. Walther, Christoph; Kolbe, Thomas: On terminating lemma speculations. (2000)
  14. Walther, C.; Kolbe, T.: Proving theorems by reuse (2000)
  15. Bouhoula, Adel; Rusinowitch, Michaël: Implicit induction in conditional theories (1995)