mirror of
https://github.com/ellmau/adf-obdd.git
synced 2025-12-19 09:29:36 +01:00
Stefan Ellmauthaler
0fec22052c
Signed-off-by: Stefan Ellmauthaler <stefan.ellmauthaler@tu-dresden.de>
38 lines
2.2 KiB
Rust
38 lines
2.2 KiB
Rust
//! This library contains an efficient representation of `Abstract Dialectical Frameworks (ADf)` by utilising an implementation of `Ordered Binary Decision Diagrams (OBDD)`
|
|
//!
|
|
//! # Abstract Dialectical Frameworks
|
|
//! An `abstract dialectical framework` consists of abstract statements. Each statement has an unique label and might be related to other statements (s) in the ADF. This relation is defined by a so-called acceptance condition (ac), which intuitively is a propositional formula, where the variable symbols are the labels of the statements. An interpretation is a three valued function which maps to each statement a truth value (true, false, undecided). We call such an interpretation a model, if each acceptance condition agrees to the interpration.
|
|
//! # Ordered Binary Decision Diagram
|
|
//! An `ordered binary decision diagram` is a normalised representation of binary functions, where satisfiability- and validity checks can be done relatively cheap.
|
|
//!
|
|
//! Note that one advantage of this implementation is that only one oBDD is used for all acceptance conditions. This can be done because all of them have the identical signature (i.e. the set of all statements + top and bottom concepts).
|
|
//! Due to this uniform representation reductions on subformulae which are shared by two or more statements only need to be computed once and is already cached in the data structure for further applications.
|
|
//!
|
|
//! # Input-file format:
|
|
//! Each statement is defined by an ASP-style unary predicate s, where the enclosed term represents the label of the statement.
|
|
//! The binary predicate ac relates each statement to one propositional formula in prefix notation, with the logical operations and constants as follows:
|
|
//! - and(x,y): conjunction
|
|
//! - or(x,y): disjunctin
|
|
//! - iff(x,Y): if and only if
|
|
//! - xor(x,y): exclusive or
|
|
//! - neg(x): classical negation
|
|
//! - c(v): constant symbol "verum" - tautology/top
|
|
//! - c(f): constant symbol "falsum" - inconsistency/bot
|
|
|
|
//! ## Example input file:
|
|
//! ```prolog
|
|
//! s(a).
|
|
//! s(b).
|
|
//! s(c).
|
|
//! s(d).
|
|
//!
|
|
//! ac(a,c(v)).
|
|
//! ac(b,or(a,b)).
|
|
//! ac(c,neg(b)).
|
|
//! ac(d,d).
|
|
//! ```
|
|
pub mod adf;
|
|
pub mod datatypes;
|
|
pub mod obdd;
|
|
//pub mod obdd2;
|