{"payload":{"pageCount":1,"repositories":[{"type":"Public archive","name":"tptp-parser","owner":"leoprover","isFork":false,"description":"TPTP Parser","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":1,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-10T15:22:54.600Z"}},{"type":"Public","name":"Leo-III","owner":"leoprover","isFork":false,"description":"An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics","allTopics":["logic","theorem-proving","atp","higher-order-logic","reasoning","deduction-system"],"primaryLanguage":{"name":"Scala","color":"#c22d40"},"pullRequestCount":0,"issueCount":12,"starsCount":41,"forksCount":9,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-12T07:32:49.565Z"}},{"type":"Public","name":"logic-embedding","owner":"leoprover","isFork":false,"description":"Library and application for encoding non-classical logics into classical higher-order logic.","allTopics":["logic","modal-logic","reasoning","non-classical-logics"],"primaryLanguage":{"name":"Scala","color":"#c22d40"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":2,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-08T15:16:54.820Z"}},{"type":"Public","name":"tptp-utils","owner":"leoprover","isFork":false,"description":"Library for TPTP-related utility services","allTopics":["logic","theorem-proving","tptp"],"primaryLanguage":{"name":"Scala","color":"#c22d40"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-14T08:07:34.417Z"}},{"type":"Public","name":"scala-tptp-parser","owner":"leoprover","isFork":false,"description":"A parser for the TPTP logic languages for automated theorem proving written in Scala","allTopics":["logic","theorem-proving","artificial-intelligence","tptp","automated-reasoning","parser","scala"],"primaryLanguage":{"name":"Scala","color":"#c22d40"},"pullRequestCount":1,"issueCount":0,"starsCount":5,"forksCount":5,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-25T19:12:58.130Z"}},{"type":"Public archive","name":"ddl2thf","owner":"leoprover","isFork":false,"description":"DDL2THF -- A preprocessor for translating problems in Dyadic Deontic Logic into THF problems","allTopics":["theorem-proving","higher-order-logic","deontic-logic"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-03-16T14:00:05.174Z"}},{"type":"Public","name":"embed_modal","owner":"leoprover","isFork":false,"description":"A tool for translating higher-order modal logic problems into classical higher-order logic","allTopics":["higher-order-logic","modal-logic"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":2,"starsCount":5,"forksCount":2,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-01-19T18:20:29.854Z"}},{"type":"Public","name":"tptp","owner":"leoprover","isFork":false,"description":"TPTP python library and benchmarking service","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":10,"forksCount":2,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-10-02T12:37:10.211Z"}},{"type":"Public","name":"ltb","owner":"leoprover","isFork":false,"description":"Batch reasoning framework","allTopics":[],"primaryLanguage":{"name":"OpenEdge ABL","color":"#5ce600"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-10-01T13:50:23.432Z"}},{"type":"Public archive","name":"LEO-II","owner":"leoprover","isFork":false,"description":"LEO-II - A Higher-Order Theorem Prover","allTopics":[],"primaryLanguage":{"name":"OCaml","color":"#ef7a08"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-09-25T10:58:46.457Z"}},{"type":"Public archive","name":"LeoPARD","owner":"leoprover","isFork":false,"description":"Leo's Parallal ARchitecture & Datastructures (LeoPARD)","allTopics":[],"primaryLanguage":{"name":"Scala","color":"#c22d40"},"pullRequestCount":0,"issueCount":0,"starsCount":6,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2016-01-04T09:05:26.389Z"}}],"repositoryCount":11,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"leoprover repositories"}