Search

Skip to Search Results
  • 1986

    Pelletier, Francis J., Rudnicki, Piotr

    Introduction: Some problems that are difficult for automated theorem provers (ATPs) are so merely because of their size, but not because of any logical or conceptual complexity. Examples of this type of difficult problem have been published in the past: see Pelletier [1986: problems 12, 29, 34,...

1 - 1 of 1