Detecting decidable classes of finitely ground logic programs with function symbols.
Marco CalauttiSergio GrecoIrina TrubitsynaPublished in: PPDP (2013)
Keyphrases
- function symbols
- logic programs
- tuple generating dependencies
- logic programming
- definite clause
- answer set programming
- answer sets
- horn clauses
- fixpoint
- background knowledge
- stable models
- inductive logic programming
- answer set semantics
- existentially quantified
- relational databases
- data integration
- domain knowledge