On decompositions of chain datalog programs into P (left-)linear 1-rule components

Chain Queries Expressible by Linear Datalog Programs

Linearisability on datalog programs

LinearDatalog programs are programs whose clauses have at most one intensional atom in their bodies We explore syntactic classes of Datalog programs syntactically non linear which turn out to express no more than the queries expressed by linear Datalog programs In particular we investigate linearisability of database queries corresponding to piecewise linear Datalog programs and chain queries a...

on the effect of linear & non-linear texts on students comprehension and recalling

چکیده ندارد.

Symmetric Chain Decompositions of Linear Lattices

Refinement of Datalog Programs

Refinement operators are exploited to change in an automated way incorrect clauses of a logic program. In this paper, we present four refinement operators for Datalog programs and demonstrate that all of them meet the properties of local finiteness, properness, and completeness (ideality). Such operators are based on the quasi-ordering induced upon a set of clauses by the generalization model o...