| 2011 | TIME | Linear Temporal Logic and Propositional Schemata, Back and Forth. | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
| 2010 | AISC | Untitled record | Hicham Bensaid, Ricardo Caferra, Nicolas Peltier |
| 2010 | CADE | A Decidable Class of Nested Iterated Schemata. | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
| 2010 | CADE | RegSTAB: A SAT Solver for Propositional Schemata. | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
| 2010 | CADE | Perfect Discrimination Graphs: Indexing Terms with Integer Exponents. | Hicham Bensaid, Ricardo Caferra, Nicolas Peltier |
| 2010 | LATA | Complexity of the Satisfiability Problem for a Class of Propositional Schemata. | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
| 2009 | CADE | Dei: A Theorem Prover for Terms with Integer Exponents. | Hicham Bensaid, Ricardo Caferra, Nicolas Peltier |
| 2009 | TABLEAUX | A Schemata Calculus for Propositional Logic. | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
| 2008 | ISAIM | More Flexible Term Schematisations via Extended Primal Grammars. | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
| 2007 | WoLLIC | Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps. | Hicham Bensaid, Ricardo Caferra, Nicolas Peltier |
| 2006 | PPDP | Rewriting term-graphs with priority. | Ricardo Caferra, Rachid Echahed, Nicolas Peltier |
| 1995 | CSL | Decision Procedures Using Model Building Techniques. | Ricardo Caferra, Nicolas Peltier |
| 1995 | IJCAI | Extending Semantic Resolution via Automated Model Building: Applications. | Ricardo Caferra, Nicolas Peltier |
| 1995 | TABLEAUX | Model Building and Interactive Theory Discovery. | Ricardo Caferra, Nicolas Peltier |
| 1994 | CADE | A Method for Building Models Automatically. Experiments with an Extension of OTTER. | Christophe Bourely, Ricardo Caferra, Nicolas Peltier |
| 1993 | IJCAI | Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5. | Ricardo Caferra, Stphane Demri |
| 1992 | CADE | Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. | Ricardo Caferra, Stphane Demri |
| 1991 | AAAI | Logic Morphisms as a Framework for Backward Transfer of Lemmas and Strategies in Some Modal and Epistemic Logics. | Ricardo Caferra, Stphane Demri, Michel Herment |
| 1990 | AIMSA | An Application of Many-Valued Logic to Decide Propositional S5 Formulae: A Strategy Designed for a Parameterized Tableaux-Based Theorem Prover. | Ricardo Caferra, Nicolas Zabel |
| 1990 | JELIA | Extending Resolution for Model Construction. | Ricardo Caferra, Nicolas Zabel |
| 1988 | CADE | Some Tools for an Inference Laboratory (ATINF). | Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade |
| 1988 | ISSAC | A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning. | Thierry Boy de la Tour, Ricardo Caferra |
| 1988 | STACS | Some Tools for an Inference Laboratory (ATINF). | Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade |
| 1987 | AAAI | Proof Analogy in Interactive Theorem Proving: A Method to Express and Use It via Second Order Pattern Matching. | Thierry Boy de la Tour, Ricardo Caferra |
| 1984 | AIMSA | Program Synthesis Through Problem Splitting: A Method for Subproblem Characterization. | Ramn F. Brena, Ricardo Caferra, Bertram Fronhfer, Christian Gresse, Philippe Jacquet, Marie-Laure Potet |
| 1984 | KI | Improvement of Recursive Programs from a Logic Programming Point of View. | Bertram Fronhfer, Ricardo Caferra, Philippe Jacquet |
| 1982 | CADE | Proof by Matrix Reduction as Plan + Validation. | Ricardo Caferra |