Χ
With visiting this site I accept that it uses cookies for website analytics.
Learn more
Fachbereich Informatik
Login (Group Members)
Embedded Systems Group (ES)
Toggle navigation
RPTU
FB
Home
People
Teaching
Research
Publications
Conferences
Tools
Tools
Overview
Averest
Teaching Tools
Jobs
Fachbereich INF
ES
Startseite
Propositional Logic Tools
Using this tool, various computations can be performed for given propositional logic formulas.
truth table
CCNF (canonical conjunctive normal form)
from truth table
from BDD
CDNF (canonical disjunctive normal form)
from truth table
from BDD
SNF (Shannon normal form)
RMNF (Reed-Muller normal form)
FDD (functional decision diagram)
show false leaf
suppress false leaf
show represented sets
suppress represented sets
ZDD (zero-suppressed binary decision diagram)
show false leaf
suppress false leaf
show represented sets
suppress represented sets
BDD (binary decision diagram)
show false leaf
suppress false leaf
Shannon graph
sequent calculus proof tree
linear equi-satisfiable clause set
SAT solver (DPLL with non-chronological backtracking aka clause learning)
my formulas given below with variable order:
a & b -> c; a & b -> a | c; (a ? b : c)
Hidden Weighted Bit Function with N Bits; N=:
Threshold Function (more than K of N) K,N:
Threshold Function (exactly K of N) K,N:
Queen Problem N (caution: has N
2
variables):
remark: This is false for N≤3 and true for N>3.
Comparison of N-bit Numbers:
Addition of N-bit Numbers:
Multiplication of N-bit Numbers:
Multiples of Constants with N-bits:
Square Numbers with N-bits:
Prime Numbers with N-bits:
Zum Seitenanfang