Ban3

Informations sur l'auteur

Ricardo Caferra

http://pistou.imag.fr/site/author/70

  
Équipe(s) :
CAPP Du 01/01/2007 au 31/12/2099 		 

Publications de l'auteur

La liste contient 42 élément(s)

(Les éditeurs apparaissent en italique)


Ajouter toute la liste au panier

Exporter la liste au format
Retrier la liste par :

International peer reviewed journal [ACL]
2011
1
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
Decidability and Undecidability Results for Propositional Schemata.
Journal of Artificial Intelligence Research, 40:599--656, 2011.
Www-128x128
bibtex/ html
2010
2
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
Simplified Handling of Iterated Term Schemata.
Annals of Mathematics and Artificial Intelligence, 2010. Note: Accepted, to appear.
bibtex/ html
2008
3
Ricardo Caferra, Rachid Echahed, Nicolas Peltier.
A Term-Graph Clausal Logic: Completeness and Incompleteness Results.
Journal of Applied Non-Classical Logics, 18(4):373--411, 2008.
bibtex/ html
4
Ricardo Caferra, Nicolas Peltier.
Accepting/Rejecting Propositions from Accepted/Rejected Propositions: a Unifying Overview.
International Journal of Intelligent Systems, 23(10):999-1020, 2008.
bibtex/ html
2000
5
Ricardo Caferra, Nicolas Peltier.
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models.
Journal of Symbolic Computation, 29:177--211, 2000.
bibtex/ html
1997
6
Ricardo Caferra, Nicolas Peltier.
A new technique for verifying and correcting logic programs.
Journal of Automated Reasoning, 19(3):277--318, 1997.
bibtex/ html
International peer-reviewed conference proceedings [ACT]
2011
7
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
Linear Temporal Logic and Propositional Schemata, Back and Forth.
TIME'2011 - 18th International Symposium on Temporal Representation and Reasoning, 2011.
bibtex/ html
2010
8
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
Complexity of the Satisfiability Problem for a Class of Propositional Schemata.
LATA 2010 (Language, Automata Theory and Applications), LNCS, 2010.
bibtex/ html
9
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
A Decidable Class of Nested Iterated Schemata.
IJCAR 2010 (International Joint Conference on Automated Reasoning), LNCS, 2010.
bibtex/ html
10
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
RegSTAB: a SAT-Solver for Propositional Schemata.
IJCAR 2010 (International Joint Conference on Automated Reasoning), LNCS, 2010.
bibtex/ html
11
Hicham Bensaid, Ricardo Caferra, Nicolas Peltier.
Perfect discrimination graphs: indexing terms with integer exponents.
IJCAR 2010 (International Joint Conference on Automated Reasoning), LNCS, 2010.
bibtex/ html
12
Hicham Bensaid, Ricardo Caferra, Nicolas Peltier.
I-terms in ordered resolution and superposition calculi : retrieving lost completeness.
AISC 2010 (10th International Conference on Artificial Intelligence and Symbolic Computation), LNCS, 2010.
bibtex/ html
2009
13
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
A Schemata Calculus For Propositional Logic.
TABLEAUX 09 (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods), 5607:32-46, LNCS, 2009.
bibtex/ html
14
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
A DPLL Proof Procedure for Propositional Iterated Schemata.
Workshop ``Structures and Deduction 2009'' (ESSLI), :24--38, 2009.
bibtex/ html
15
Hicham Bensaid, Ricardo Caferra, Nicolas Peltier.
DEI: A Theorem Prover for Terms with Integer Exponents.
CADE 22 (22nd International Conference on Automated Deduction), 5663:146--150, Lecture Notes in Computer Science, 2009.
bibtex/ html
2008
16
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
More Flexible Term Schematisations via Extended Primal Grammars.
Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM), jan 2008.
bibtex/ html
2007
17
Hicham Bensaid, Ricardo Caferra, Nicolas Peltier.
Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps.
Proc. Wollic'07 (Workshop on Logic, Language, Information and Computation), :38--52, jul 2007. Note: LNCS 4576.
bibtex/ html
2006
18
Ricardo Caferra, Rachid Echahed, Nicolas Peltier.
Rewriting Term-Graphs with Priority.
Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, :109--120, 2006.
bibtex/ html
2005
19
Ricardo Caferra, Rachid Echahed, Nicolas Peltier.
R. Letz.
A Graph Clausal Logic.
FTP'05 (International Workshop First-Order Theorem Proving)., :85--96, sep 2005. Note: Koblenz, Germany.
bibtex/ html
2000
20
Ricardo Caferra, Nicolas Peltier.
The Connection Method, Constraints and Model Building.
Intellectics and Computational Logic, 19:67--84, Applied Logic Series, 2000.
bibtex/ html
21
Ricardo Caferra, Nicolas Peltier, François Puitg.
J. Richter-Gebert, Dongming Wang.
Emphazing human techniques in geometry automated theorem proving:a practical realization.
Workshop on Automated Deduction in Geometry. Zurich, Switzlerland, sep 2000.
bibtex/ html
22
Thierry Boy De La Tour.
Ricardo Caferra, Gernot Salzer.
On the Complexity of Finite Sorted Algebras.
Automated Deduction in Classical and Non-Classical Logics, :95-108, Lecture Notes in Artificial Intelligence 1761, 2000.
bibtex/ html
1998
23
Thierry Boy De La Tour.
Ricardo Caferra, Gernot Salzer.
How complex is a finite first-order sorted interpretation?.
FTP'98 International Workshop on First-Order Theorem Proving, :76-85, Vienne, Autriche, nov 1998.
bibtex/ html
1996
24
Ricardo Caferra, Nicolas Peltier.
A significant extension of logic programming by adapting model buildings rules.
Proc. of Extensions of Logic Programming 96, :51--65, mar 1996.
bibtex/ html
25
Ricardo Caferra, Nicolas Peltier.
Decision Procedures using Model Building techniques.
Proceeding of Computer Science Logic, CSL'95, :130--144, 1996.
bibtex/ html
1995
26
Ricardo Caferra, Nicolas Peltier.
Model Building and Interactive Theory Discovery.
Proceeding of Tableaux'95, :154--168, LNAI 918, 1995.
bibtex/ html
27
Ricardo Caferra, Nicolas Peltier.
Extending semantic resolution via automated model building: applications.
Proceeding of IJCAI'95, :328--334, 1995.
bibtex/ html
1994
28
Ch. Bourely, Ricardo Caferra, N. Pel tier.
A Method for Building Models Automatically. mboxExperiments with an extension of mbox{OTTER.
Proceedings of CADE-12, :72--86, 1994.
bibtex/ html
1988
29
Thierry Boy De La Tour, Ricardo Caferra, Gilles Chaminade.
E. Lusk, R. Overbeek.
Some Tools for an Inference Laboratory (ATINF).
Proccedings of the 9th International Conference on Automated Deduction CADE-9, :744-745, Lecture Notes in Computer Science 310, 1988.
bibtex/ html
30
Thierry Boy De La Tour, Ricardo Caferra, Gilles Chaminade.
P. Lorents, G. Mints, Ernst Tyugu.
Towards an Inference Laboratory.
Proceedings of the International Conference in Computer Logic, part II, :5-13, 1988.
bibtex/ html
31
Thierry Boy De La Tour, Ricardo Caferra, Gilles Chaminade.
Some tools for an inference laboratory ATINF.
Symposium on Theoretical Aspects of Computer Science STACS-88, :395-396, Lecture Notes in Computer Science 294, 1988.
bibtex/ html
32
Thierry Boy De La Tour, Ricardo Caferra.
P. Gianni.
A Formal Approach to Some Usually Informal Techniques Used in Mathematical Reasoning.
Proceedings of the International Symposium on Symbolic and Algebraic Computation ISSAC-88, :402-406, Lecture Notes in Computer Science 358, 1988.
bibtex/ html
1987
33
Thierry Boy De La Tour, Ricardo Caferra.
L'analogie en démonstration automatique: une approche de la généralisation utilisant le filtrage du second ordre.
Actes du Sixième Congrès en Reconnaissance des Formes et Intelligence Artificielle, tome 2, :809-818, 1987.
bibtex/ html
34
Thierry Boy De La Tour, Ricardo Caferra.
Proof Analogy in Interactive Theorem Proving: A Method to Express and Use it via Second Order Matching.
Proceedings of the Sixth National Conference on Artificial Intelligence AAAI-87, :95-99, 1987.
bibtex/ html
Scientific books and chapter [OS]
2004
35
Ricardo Caferra, A. Leitsch, Nicolas Peltier.
Automated Model Building.
31, Applied Logic Series, Kluwer Academic Publishers, 2004.
bibtex/ html
1998
36
Ricardo Caferra, Nicolas Peltier.
Disinference rules, model building and abduction.
``Logic at work. Essays dedicated to the memory of Helena Rasiowa'' (Part 5:Logic in Computer Science, Chap. 20), 20, :331--353, Physica-Verlag, 1998.
bibtex/ html
Other Publications [AP]
2011
37
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version).
Technical Report, abs/1102.2174, 2011.
bibtex/ html
2010
38
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier.
A Decidable Class of Nested Iterated Schemata (extended version).
Technical Report, University of Grenoble, 2010.
Www-128x128
bibtex/ html
2003
39
Nicolas Balacheff, Ricardo Caferra, Nicolas Peltier, Sylvie Pesty, Sophie Soury-Lavergne, Rosamund Sutherland, Jana Trgalova, Carine Webber, Michelle Cerulli, Nathalie Gaudin, Mirko Marraci, M.A. Mariotti, Jean-Michel Muller, Jean-François Nicaud, Michel Occello, Federica Olivero.
Baghera Assessment Project, designing an hybrid and emergent educational society.
Technical Report, 2003. Note: Edited by Sophie Soury-Lavergne ; Available at: http://www-leibniz.imag.fr/LesCahiers/2003/Cahier81/{BAP}_CahiersLaboLeibniz.{PDF} Research report {IST}-2001-33046.
Www-128x128 [ abstract ]
bibtex/ html
40
Ricardo Caferra, Nicolas Peltier.
HOARD-ATINF - A generic logical theorem prover.
Published in the report of the Baghera European Project BAP: ``Designing an hybrid and emergent educational society'', jan 2003.
bibtex/ html
1997
41
Ricardo Caferra, Nicolas Peltier.
Combining inference and disinference rules with enumeration for model building.
Workshop on model-based reasoning. IJCAI'97, 1997.
bibtex/ html
42
Ricardo Caferra, Nicolas Peltier.
Model building in the cross-roads of consequence and non-consequence relations.
FTP'97 (International Workshop First-Order Theorem Proving). Technical Report RISC-Linz Report Series No. 97-50, page 40-44., 1997.
bibtex/ html