Lower-bound Time-complexity Analysis of Logic Programs.
Andy KingKish ShenFlorence BenoyPublished in: ILPS (1997)
Keyphrases
- complexity analysis
- logic programs
- lower bound
- upper bound
- logic programming
- answer sets
- branch and bound algorithm
- background knowledge
- fixpoint
- optimal solution
- answer set programming
- prolog programs
- branch and bound
- stable models
- normal logic programs
- computational properties
- objective function
- inductive logic programming
- np hard
- artificial intelligence
- partial deduction
- logic program updates
- strong equivalence
- loop formulas
- nonmonotonic reasoning
- autoepistemic logic
- stable model semantics
- monotonicity constraints
- semantics for logic programs
- term rewriting systems