| Document Date: 2011-03-22 14:11:30
Open Document File Size: 180,75 KBShare Result on Facebook
City Twelf / / Company CNF / THF / / Country Germany / United States / / Facility University of Miami / Saarland University / Tps library / International University / TPTP library / / IndustryTerm particular search procedure / automated search procedures / resolution proof search loop / output processors / automated search / search procedure / dependent product / few automated systems / higher-order unification algorithm / online interface / corresponding infrastructure / earlier search procedures / search space / proof search / well established infrastructure / resolution proof search / / OperatingSystem UNIX / BSD / Linux / Hurd / / Organization Max Planck Institut f¨ / Saarland University / German Federal Ministry of Education / International University / University of Miami / / Person Peter B. Andrews / Chad Brown / Matthew Bishop / Christoph Benzm / / / Position well known proof assistant / well known proof assistant for higher-order logic / OMEGA proof assistant / Proof General / / ProgrammingLanguage Prolog / / ProvinceOrState Saarland / / Technology higher-order unification algorithm / output processors / Linux / ASCII / perl / / URL www.tptp.org/cgi-bin/SystemOnTPTP / www.tptp.org / http /
SocialTag |
Progress in the Development of Automated Theorem Proving for Higher-order Logic? Geoff Sutcliffe1 , Christoph Benzm¨ uller2 , 3