Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping.
Robert S. StreettPublished in: Logic of Programs (1985)
Keyphrases
- default logic
- first order logic
- propositional logic
- autoepistemic logic
- expressive power
- nonmonotonic reasoning
- logic programs
- classical first order logic
- proof procedure
- loop formulas
- multi valued
- probabilistic logic
- decomposable negation normal form
- arbitrarily complex
- propositional variables
- inference rules
- dynamic environments
- knowledge representation
- linearly ordered
- truth maintenance systems
- static analysis
- relational databases
- modal logic
- horn clauses
- strips planning
- decision procedures
- knowledge compilation
- satisfiability testing
- answer set programs
- coalition logic
- logic programming