Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming.
Thomas EiterWolfgang FaberMichael FinkGerald PfeiferStefan WoltranPublished in: KR (2004)
Keyphrases
- answer set programming
- model checking
- pspace complete
- temporal logic
- logic programs
- logic programming
- answer sets
- formal verification
- model checker
- verification method
- formal specification
- finite state machines
- computation tree logic
- reasoning tasks
- satisfiability problem
- epistemic logic
- formal methods
- np complete
- knowledge representation
- stable models
- modal logic
- decision problems