The Boundedness Problem for Monadic Universal First-Order Logic.
Martin OttoPublished in: LICS (2006)
Keyphrases
- first order logic
- datalog programs
- expressive power
- propositional logic
- theorem proving
- probabilistic reasoning
- valued logic
- transitive closure
- data complexity
- inference rules
- knowledge representation
- representation language
- theorem prover
- deductive databases
- sufficient conditions
- inductive logic programming
- markov networks
- probabilistic graphical models
- monadic second order logic
- relational algebra
- incomplete information
- query answering
- horn clauses
- special case
- markov logic
- fixpoint
- function symbols
- logical rules
- conjunctive queries
- relational databases
- search algorithm
- knowledge base
- quantifier elimination
- artificial intelligence