Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation.
Roberta GoriE. LastresR. MorenoFausto SpotoPublished in: APPIA-GULP-PRODE (1998)
Keyphrases
- normal logic programs
- abstract interpretation
- logic programs
- termination analysis
- static analysis
- stable models
- active rules
- default reasoning
- answer sets
- model checking
- logic programming
- deductive databases
- dynamic analysis
- reasoning engine
- active databases
- fixpoint
- knowledge representation and reasoning
- stable model semantics
- answer set programming
- database
- orders of magnitude
- belief revision