A declarative extension of horn clauses, and its significance for datalog and its applications

@article{Mazuran2013ADE,
  title={A declarative extension of horn clauses, and its significance for datalog and its applications},
  author={Mirjana Mazuran and Edoardo Serra and Carlo Zaniolo},
  journal={TPLP},
  year={2013},
  volume={13},
  pages={609-623}
}
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates in recursion by reasoning on the multiplicity of occurrences satisfying existential goals. The least fixpoint semantics, and its equivalent least model semantics, hold for logic programs with FS-rules; moreover, generalized notions of stratification and stable models are easily derived when negated goals are allowed. Finally, the generalization of techniques such as seminaive fixpoint and magic… CONTINUE READING