Décompilation de clauses, Traitement des predicats assert/1, retract/1, clause/2, ...: Pour une implantation compilée de "tout" Prolog.
J. F. DazyJ. M. PozasPublished in: SPLT (1989)
Keyphrases
- horn clauses
- prime implicates
- prime implicants
- cnf formula
- knowledge compilation
- refinement operators
- search space
- first order logic
- logic programs
- inductive logic programming
- logic programming
- function free horn
- clause learning
- inference rules
- normal form
- boolean functions
- boolean formula
- unit propagation
- belief change
- consequence finding
- modal logic
- abductive reasoning
- expert systems
- knowledge representation
- max sat
- artificial intelligence
- theorem proving
- prolog programs
- database queries
- conjunctive normal form
- constraint logic programming
- propositional logic
- branch and bound algorithm
- description logics
- programming language
- high level