Partial algebras and complexity of satisfiability and universal theory for distributive lattices, boolean algebras and Heyting algebras.
Clint J. van AltenPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- distributive lattices
- boolean algebra
- general theory
- belief functions
- set theory
- mathematical theory
- dempster shafer
- computational complexity
- cardinality constraints
- boolean functions
- np complete
- theoretical framework
- satisfiability problem
- artificial intelligence
- uncertain information
- object oriented
- knowledge representation