Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies.
Md. Solimul ChowdhuryFangfang LiuWu ChenArash KarimiJia-Huai YouPublished in: LOPSTR (2014)
Keyphrases
- polynomial approximation
- semantics for logic programs
- case study
- logic programs
- answer sets
- stable models
- logic programming
- pointwise
- fixpoint
- open world
- normal form
- lower bound
- artificial intelligence
- answer set programming
- normal logic programs
- database systems
- confidence intervals
- propositional logic
- databases
- inductive logic programming
- linear combination
- knowledge management