Universal First-Order Logic is Superfluous for NL, P, NP and coNP.
Nerio BorgesBlai BonetPublished in: Log. Methods Comput. Sci. (2014)
Keyphrases
- first order logic
- expressive power
- natural language
- propositional logic
- knowledge representation
- theorem proving
- theorem prover
- inference rules
- decision problems
- probabilistic reasoning
- data complexity
- transitive closure
- representation language
- relational algebra
- inductive logic programming
- conjunctive queries
- natural language understanding
- probabilistic graphical models
- formal semantics
- quantifier elimination
- quantifier free
- horn clauses
- logical rules
- database
- markov networks
- data management
- expert systems
- function symbols
- machine learning