Patrick Lühne
a446aed011
This provides an abstract syntax tree for first-order logic with integer arithmetics. Initially, the following types of formulas are supported: - Booleans values (true and false) - predicates - negated formulas - comparisons of terms (<, ≤, >, ≥, =, ≠) - implications and biconditionals - conjunctions and disjunctions of formulas - existentially and universally quantified formulas In addition, these types of terms are provided: - Boolean values (true and false) - integers - strings - special integers (infimum and supremum) - symbolic functions - variables - binary operations (addition, subtraction, multiplication, division, modulo, exponentiation) - unary operations (absolute value, numeric negation)
14 lines
451 B
TOML
14 lines
451 B
TOML
[package]
|
|
name = "foliage"
|
|
version = "0.1.0"
|
|
authors = ["Patrick Lühne <patrick@luehne.de>"]
|
|
description = "Abstract syntax tree for first-order logic with integer arithmetics"
|
|
documentation = "https://github.com/potassco/foliage"
|
|
homepage = "https://github.com/potassco/foliage"
|
|
repository = "https://github.com/potassco/foliage"
|
|
readme = "README.md"
|
|
keywords = ["logic"]
|
|
categories = ["data-structures", "science"]
|
|
license = "MIT"
|
|
edition = "2018"
|