All Projects → MarisaKirisame → first_order_logic_prover

MarisaKirisame / first_order_logic_prover

Licence: LGPL-3.0 License
No description or website provided.

Programming Languages

C++
36643 projects - #6 most used programming language
QMake
1090 projects

Projects that are alternatives of or similar to first order logic prover

LinearOne
LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
Stars: ✭ 16 (-69.23%)
Mutual labels:  theorem-proving, first-order-logic
pyprover
Resolution theorem proving for predicate logic in pure Python.
Stars: ✭ 71 (+36.54%)
Mutual labels:  theorem-proving, first-order-logic
Lean
Homepage Theorem Proving in Lean FAQ
Stars: ✭ 2,006 (+3757.69%)
Mutual labels:  theorem-proving
informatica-public
Public code developed during my MSc study at University of Bologna
Stars: ✭ 79 (+51.92%)
Mutual labels:  theorem-proving
ostrich
An SMT Solver for string constraints
Stars: ✭ 18 (-65.38%)
Mutual labels:  theorem-proving
rusty-razor
Razor is a tool for constructing finite models for first-order theories
Stars: ✭ 54 (+3.85%)
Mutual labels:  theorem-proving
fm-notes
Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
Stars: ✭ 19 (-63.46%)
Mutual labels:  theorem-proving
Set-Theory
Coq encoding of ZFC and formalization of the textbook Elements of Set Theory
Stars: ✭ 55 (+5.77%)
Mutual labels:  theorem-proving
archsat
A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superposition and Rewriting.
Stars: ✭ 20 (-61.54%)
Mutual labels:  theorem-proving
Leo-III
An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
Stars: ✭ 29 (-44.23%)
Mutual labels:  theorem-proving
lsw2
OWL and Semantic Web toolkit for Common Lisp, used for construction and reasoning over ontologies and ontology-structured data
Stars: ✭ 22 (-57.69%)
Mutual labels:  first-order-logic
awesome-rust-formalized-reasoning
An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
Stars: ✭ 185 (+255.77%)
Mutual labels:  theorem-proving
gapt
GAPT: General Architecture for Proof Theory
Stars: ✭ 83 (+59.62%)
Mutual labels:  theorem-proving
Fstar
A Proof-oriented Programming Language
Stars: ✭ 2,171 (+4075%)
Mutual labels:  theorem-proving
coq jupyter
Jupyter kernel for Coq
Stars: ✭ 70 (+34.62%)
Mutual labels:  theorem-proving
Coq
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
Stars: ✭ 3,566 (+6757.69%)
Mutual labels:  theorem-proving
pomagma
An inference engine for extensional untyped λ-calculus
Stars: ✭ 15 (-71.15%)
Mutual labels:  theorem-proving
consistency
Implementation of models in our EMNLP 2019 paper: A Logic-Driven Framework for Consistency of Neural Models
Stars: ✭ 26 (-50%)
Mutual labels:  first-order-logic
tarski
Tarski - An AI Planning Modeling Framework
Stars: ✭ 30 (-42.31%)
Mutual labels:  first-order-logic
TheoLog
Vorlesungsunterlagen "Theoretische Informatik und Logik", Fakultät Informatik, TU Dresden
Stars: ✭ 20 (-61.54%)
Mutual labels:  first-order-logic

First order logic prover

This is a library which contains:

  • Backward chaining algorithm
  • Dependent typed First order logic
  • Forward chaining algorithm
  • Gentzen system
  • Parser for parsing FOL.
  • Resolution method
  • Unification

Dependency: See .pro. Use a lot of C++1y feature so need a good compiler.

Build: This is a header only library. Include the header you want.

Document: Just ask in issue. I'm not writing documents when no one seems interested.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].