Inferring and Compiling Termination for Constraint Logic Programs.

Sébastien Hoarau Frédéric Mesnard

Published in: LOPSTR (1998)

Keyphrases

logic programs
logic programming
fixpoint
stable models
answer set programming

answer sets
background knowledge
inductive logic programming
partial deduction
computational properties

existentially quantified
term rewriting systems
strong equivalence
answer set semantics
normal logic programs

prolog programs
logic program updates
stable model semantics
linear constraints