A tool for automatically verifying whether a given first-order logic formula is a tautology, based on Herbrand's theory and the Davis-Putnam SAT solver. Implemented in C++.
-
Updated
Jul 2, 2024 - C++
#
first-order-logic
Here are 7 public repositories matching this topic...
Decide the given statement is True or False depending on the given knowledge base, restricted to "For All" Statements. The Algorithm converts the given knowledge base into Resolution tree, and using the proof of restitution, we decide if the given statement is true or false.
-
Updated
Nov 5, 2023 - C++
-
Updated
Oct 2, 2017 - C++
Резолюционный прувер для логики первого порядка
-
Updated
Dec 3, 2021 - C++
C++ implementations of fundamental algorithms taught on the course. Topics from first order logic and problem specification to time complexity. Algorithms for search and sorting, along with a testing module to verify correctness and efficiency.
testing
algorithms
first-order-logic
data-structures
specification
complexity
sorting-algorithms
big-o
pseudocode
search-algorithm
implementation
algorithms-and-data-structures
-
Updated
Apr 3, 2024 - C++
Prove or disprove the given query based on the knowledge base
parsing
cpp
strings
tokenizer
cpp14
first-order-logic
artificial-intelligence
inference-engine
inference-rules
unification-algorithm
resolution-proof
-
Updated
Oct 26, 2018 - C++
-
Updated
Feb 27, 2018 - C++
Improve this page
Add a description, image, and links to the first-order-logic topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the first-order-logic topic, visit your repo's landing page and select "manage topics."