Generalization for a propositional calculus: a constraints-based approach

  • Raoul Vorc'h
Part of the Lecture Notes in Computer Science book series (LNCS, volume 541)


In order to provide a propositional tableau-based theorem prover with learning capabilities, we describe generalization mechanisms that characterize the concepts of valid and non-valid formulae. Our generalization language is founded on the notion of formula schemata enriched with a system of constraints. We show how the most “attractive” generalizations of a given instance can be found. Successes or failures of proofs are handled within a same formalism.


Generalization Explanation Semantic Tableaux Sequents Schemata Constraints 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Belleannee et al. 91]
    Belleannée (C.) and Nicolas (J.). — Static learning for an adaptative theorem prover. In: Proccedings of EWSL 91 (European Working Session on Learning). pp. 298–311. — Springer-Verlag.Google Scholar
  2. [Gallier 86]
    Gallier (J.H.). — Logic for Computer Science: Foundations of Automatic Theorem Proving. — Harper and Row, New-York, 1986.Google Scholar
  3. [Harmelen et al. 88]
    Harmelen (van F.) and Bundy (A.). — Explanation based-generalisation = partial evaluation. Artificial Intelligence, vol. 36, 1988, pp. 401–412.Google Scholar
  4. [Korf 85]
    Korf. — Macro-operators: a weak method for learning. Artificial Intelligence, vol. 26, 1985, pp. 35–77.Google Scholar
  5. [Mackworth 77]
    Mackworth (A.K.). — Consistency in networks of relations. Artificial Intelligence, vol. 8, 1977, pp. 99–118.Google Scholar
  6. [Minton et al. 89]
    Minton (S.N.), Carbonel (J.G.), Knoblock (C.A.), Kuokka (D.R.), Etzioni (O.) and Gil (Y.). — Explanation based learning: A problem solving perspective. Artificial Intelligence, vol. 40, 1989, pp. 63–118.Google Scholar
  7. [Mitchell et al. 86]
    Mitchell (T.M.), Keller (R.M.) and Kedar-Cabelli (S.T.). — Explanation based learning: A unifying view. Machine Learning, vol. 1, 86, pp. 47–80.Google Scholar
  8. [Mitchell 82]
    Mitchell (T.M.). — Generalization as search. Artificial Intelligence, vol. 18, 1982, pp. 203–226.Google Scholar
  9. [Ororke 89]
    O'Rorke (P.). — Lt revisited: Explanation-based learning and the logic of principia mathematica. Machine Learning, vol. 2, 1989, pp. 117–159.Google Scholar
  10. [Plotkin 70]
    Plotkin (G.D.). — A note on inductive generalization. Machine Intelligence, vol. 5, 1970, pp. 47–80.Google Scholar
  11. [Reynolds 70]
    Reynolds (J.C.). — Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence, vol. 5, 1970, pp. 135–152.Google Scholar
  12. [Smullyan 68]
    Smullyan (R.M.). — First Order Logic. — Springer-Verlag, 1968.Google Scholar
  13. [Whitehead et al. 62]
    Whitehead (A.N.) and Russel (A.N.). — Principia Mathematica. — Cambridge University Press, London, 1962.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Raoul Vorc'h
    • 1
  1. 1.IRISARennes CédexFrance

Personalised recommendations