`Travelled to:`

1 × Canada

1 × France

1 × Germany

1 × Italy

1 × United Kingdom

3 × USA

`Collaborated with:`

N.Peltier V.Aravantinos H.Bensaid S.Demri ∅ R.Echahed C.Bourely T.B.d.l.Tour G.Chaminade

`Talks about:`

schemata (3) term (3) proposit (2) classic (2) proof (2) logic (2) integ (2) graph (2) expon (2) class (2)

## Person: Ricardo Caferra

### DBLP: Caferra:Ricardo

### Contributed to:

### Wrote 10 papers:

- IJCAR-2010-AravantinosCP #decidability
- A Decidable Class of Nested Iterated Schemata (VA, RC, NP), pp. 293–308.
- IJCAR-2010-AravantinosCP10a #named #satisfiability
- RegSTAB: A SAT Solver for Propositional Schemata (VA, RC, NP), pp. 309–315.
- IJCAR-2010-BensaidCP #graph #integer
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (HB, RC, NP), pp. 369–383.
- LATA-2010-AravantinosCP #complexity #problem #satisfiability
- Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.
- CADE-2009-BensaidCP #integer #named #proving #theorem proving
- Dei: A Theorem Prover for Terms with Integer Exponents (HB, RC, NP), pp. 146–150.
- PPDP-2006-CaferraEP
- Rewriting term-graphs with priority (RC, RE, NP), pp. 109–120.
- CADE-1994-BourelyCP #automation #modelling
- A Method for Building Models Automatically. Experiments with an Extension of OTTER (CB, RC, NP), pp. 72–86.
- CADE-1992-CaferraD #logic #proving #semantics
- Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic (RC, SD), pp. 385–399.
- CADE-1988-TourCC #tool support
- Some Tools for an Inference Laboratory (ATINF) (TBdlT, RC, GC), pp. 744–745.
- CADE-1982-Caferra #matrix #proving #reduction #validation
- Proof by Matrix Reduction as Plan + Validation (RC), pp. 309–325.