Login / Signup

Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.

Larry HenschenBarry SmithRobert VeroffSteve WinkerLarry Wos
Published in: Notre Dame J. Formal Log. (1983)
Keyphrases
  • automated theorem proving
  • theorem prover
  • theorem proving
  • answer set programming
  • first order logic
  • cross domain
  • machine learning
  • sufficient conditions
  • logic programming