A parser for logical formulas
Project description
implies: a Pybound Rust crate for logical formulas
implies is a Rust crate for storing logical formulas as parse trees and performing complex operations on them,
like substitution, rotation, conversion to conjunctive normal form, and more. Propositional logic comes pre-implemented,
but this crate operates on a generic struct Formula<B,U,A>
which can easily be used with your own B
inary and U
nary
operators and Atom
ic formula types: if you can implement those types for your own preferred logic (modal, temporal,
predicate, etc...) you can use the full functionality of this crate for your own language. A lot more information is in
the docs for this crate.
There are Python bindings for propositional logic, but using the API in Python gives much less control and flexibility. You can use the Python APIs from Rust if you want by enabling the "python" feature when compiling, which will add "pyo3" as a dependency.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for implies-0.2.4-cp312-cp312-macosx_10_7_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c30cdd84a0f19aa0e13b9c2544718995bc8b1f82cf4fe062f2305aa8f208ab23 |
|
MD5 | d61a65169d007c66e88876aca4128b06 |
|
BLAKE2b-256 | 95bd3514afbc574d81ac4b8dd7122827d5f96818e9d25ccd43b51faf3e586839 |