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 sets, make possible the efficient implementation of DatalogFS, i.e., Datalog with rules with Frequency Support (FS-rules) and stratified negation. A large number of applications that could not be supported efficiently, or could not be expressed at all in stratified Datalog can now be easily expressed and efficiently supported in DatalogFS and a powerful DatalogFS system is now being developed at UCLA. Copyright © 2013 [MIRJANA MAZURAN, EDOARDO SERRA and CARLO ZANIOLO].
|Titolo:||A declarative extension of horn clauses, and its significance for datalog and its applications|
|Autori interni:||MAZURAN, MIRJANA|
|Data di pubblicazione:||2013|
|Rivista:||THEORY AND PRACTICE OF LOGIC PROGRAMMING|
|Appare nelle tipologie:||01.1 Articolo in Rivista|