Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving.
Peter Schneider-KampPublished in: Künstliche Intell. (2010)
Keyphrases
- term rewriting
- sat solving
- termination analysis
- theorem proving
- active rules
- active databases
- theorem prover
- sat solvers
- boolean satisfiability
- operational semantics
- inference rules
- first order logic
- sat problem
- expert systems
- knowledge representation
- logic programming
- object oriented databases
- knowledge base
- programming language
- databases
- max sat
- probabilistic planning
- reinforcement learning
- machine learning