On the expressive power of first-order boolean functions in PCF.
Riccardo PucellaPrakash PanangadenPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- boolean functions
- expressive power
- first order logic
- polynomial size
- uniform distribution
- probabilistic reasoning
- propositional logic
- transitive closure
- relational algebra
- data complexity
- query language
- knowledge representation
- inference rules
- quantifier elimination
- theorem prover
- membership queries
- computational properties
- functional properties
- horn clauses
- multi valued
- binary decision diagrams
- relational calculus
- artificial intelligence
- machine learning
- database