Ricardo Caferra

Affiliations:
  • IMAG, Grenoble, France


According to our database1, Ricardo Caferra authored at least 45 papers between 1982 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Decidability and Undecidability Results for Propositional Schemata.
J. Artif. Intell. Res., 2011

Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)
CoRR, 2011

Linear Temporal Logic and Propositional Schemata, Back and Forth.
Proceedings of the Eighteenth International Symposium on Temporal Representation and Reasoning, 2011

2010
A Decidable Class of Nested Iterated Schemata (extended version)
CoRR, 2010

Simplified handling of iterated term schemata.
Ann. Math. Artif. Intell., 2010

Complexity of the Satisfiability Problem for a Class of Propositional Schemata.
Proceedings of the Language and Automata Theory and Applications, 2010

Perfect Discrimination Graphs: Indexing Terms with Integer Exponents.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

RegSTAB: A SAT Solver for Propositional Schemata.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

A Decidable Class of Nested Iterated Schemata.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

<i>I</i>-Terms in Ordered Resolution and Superposition Calculi: Retrieving Lost Completeness.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
A Schemata Calculus for Propositional Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Dei: A Theorem Prover for Terms with Integer Exponents.
Proceedings of the Automated Deduction, 2009

2008
Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview.
Int. J. Intell. Syst., 2008

More Flexible Term Schematisations via Extended Primal Grammars.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

2007
Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps.
Proceedings of the Logic, 2007

2006
Rewriting term-graphs with priority.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

2000
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models.
J. Symb. Comput., 2000

The Connection Method, Constraints and Model Building.
Proceedings of the Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), 2000

Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization.
Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000

1997
A New Technique for Verifying and Correcting Logic Programs.
J. Autom. Reason., 1997

1996
Review of Witold Marciszewski and Roman Murawski: Mechanization of Reasoning in a Historical Perspective.
J. Appl. Non Class. Logics, 1996

A Significant Extension of Logic Programming by Adapting Model Building Rules.
Proceedings of the Extensions of Logic Programming, 5th International Workshop, 1996

1995
A Generic Graphic Framework for Combining Inference Tools and Editing Proofs and Formulae.
J. Symb. Comput., 1995

Model Building and Interactive Theory Discovery.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

Extending Semantic Resolution via Automated Model Building: Applications.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Decision Procedures Using Model Building Techniques.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994
A Method for Building Models Automatically. Experiments with an Extension of OTTER.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993
A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics.
Stud Logica, 1993

A Tableaux Method for Systematic Simultaneous Search for Refutationas and Models Using Equational Problems.
J. Log. Comput., 1993

Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

GLEFATINF: A Graphic Framework for Combining Theorem Provers and Editing Proofs for Different Logics.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

1992
A Method for Simultanous Search for Refutations and Models by Equational Constraint Solving.
J. Symb. Comput., 1992

Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic.
Proceedings of the Automated Deduction, 1992

1991
User-oriented theorem proving with the ATINF graphic proof editor.
Proceedings of the Fundamentals of Artificial Intelligence Research, 1991

Logic Morphisms as a Framework for Backward Transfer of Lemmas and Strategies in Some Modal and Epistemic Logics.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Extending Resolution for Model Construction.
Proceedings of the Logics in AI, European Workshop, 1990

An Application of Many-Valued Logic to Decide Propositional S5 Formulae: A Strategy Designed for a Parameterized Tableaux-Based Theorem Prover.
Proceedings of the Artificial Intelligence IV: Methodology, Systems, Applications, 1990

1988
A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning.
Proceedings of the Symbolic and Algebraic Computation, 1988

Some Tools for an Inference Laboratory (ATINF).
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
Proof Analogy in Interactive Theorem Proving: A Method to Express and Use It via Second Order Pattern Matching.
Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1985
Unification in Parallel with Refined Linearity Test: An Example of Recursive Network Structure in FP2, A Functional Parallel Programming Language.
Proceedings of the EUROCAL '85, 1985

1984
Improvement of Recursive Programs from a Logic Programming Point of View.
Proceedings of the GWAI-84, 1984

Program Synthesis Through Problem Splitting: A Method for Subproblem Characterization.
Proceedings of the Artificial Intelligence: Methodology, Systems, Applications, 1984

1982
Abstraction, partage de structure et retour arrière non aveugle dans la méthode de réduction matricielle en démonstration automatique de théorèmes. (Abstraction, sharing of structure, and non-blind back to acking in the matrix reduction method in the automatic demonstration of theorems).
PhD thesis, 1982

Proof by Matrix Reduction as Plan + Validation.
Proceedings of the 6th Conference on Automated Deduction, 1982


  Loading...