A Decidable Class of Groundable Formulas in the General Theory of Stable Models.
Michael BartholomewJoohyung LeePublished in: KR (2010)
Keyphrases
- general theory
- stable models
- logic programs
- logic programs with negation
- function symbols
- logic programming
- fixpoint
- normal logic programs
- deductive databases
- stable model semantics
- answer set programming
- minimal models
- morphological operators
- loop formulas
- artificial intelligence
- general purpose
- hidden markov models
- polynomial hierarchy
- semantics for logic programs