International audienceWe propose a SSReflect library for logic programming in the Datalog setting. As part of this work, we give a first mechanization of standard Datalog and of its extension with stratified negation. The library contains a formalization of the model theoretical and fix-point semantics of the languages, implemented through bottom-up and, respectively, through stratified evaluation procedures. We provide corresponding soundness, termination, completeness and model minimality proofs. To this end, we rely on the Coq proof assistant and SSReflect. In this context, we also construct a preliminary framework for dealing with stratified programs. We consider this to be a necessary first step towards the certification of security-aw...
We consider the broad class of stratified Datalog queries (which includes both linear and non-linear...
We describe an approach to logic programming where the execution of a pure logic program is ordered ...
International audienceThe Bernays-Schönfinkel first-order logic fragment over simple linear real ari...
International audienceWe propose a SSReflect library for logic programming in the Datalog setting. A...
AbstractIn this paper a new class of Datalog programs with negation called subsumption-stratified Da...
There has recently been an increasing interest in declarative data analysis, where analytic tasks ar...
This thesis presents a formalization of fundamental database theories and algorithms. This furthers ...
34 pages, 1 figure (file .eps)CTL is the dominant temporal specification language in practice mainly...
We extend DatalogMTL—Datalog with operators from metric temporal logic—by adding stratified negation...
The ?_Dat calculus brings together the power of functional and declarative logic programming in one ...
Stratified least fixpoint logic or SLFP characterizes the expressibility of stratified logic program...
AbstractStratified least fixpoint logic, or SLFP, characterizes the expressibility of stratified log...
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates ...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
International audienceAbstract In a previous paper, we have shown that clause sets belonging to the ...
We consider the broad class of stratified Datalog queries (which includes both linear and non-linear...
We describe an approach to logic programming where the execution of a pure logic program is ordered ...
International audienceThe Bernays-Schönfinkel first-order logic fragment over simple linear real ari...
International audienceWe propose a SSReflect library for logic programming in the Datalog setting. A...
AbstractIn this paper a new class of Datalog programs with negation called subsumption-stratified Da...
There has recently been an increasing interest in declarative data analysis, where analytic tasks ar...
This thesis presents a formalization of fundamental database theories and algorithms. This furthers ...
34 pages, 1 figure (file .eps)CTL is the dominant temporal specification language in practice mainly...
We extend DatalogMTL—Datalog with operators from metric temporal logic—by adding stratified negation...
The ?_Dat calculus brings together the power of functional and declarative logic programming in one ...
Stratified least fixpoint logic or SLFP characterizes the expressibility of stratified logic program...
AbstractStratified least fixpoint logic, or SLFP, characterizes the expressibility of stratified log...
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates ...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
International audienceAbstract In a previous paper, we have shown that clause sets belonging to the ...
We consider the broad class of stratified Datalog queries (which includes both linear and non-linear...
We describe an approach to logic programming where the execution of a pure logic program is ordered ...
International audienceThe Bernays-Schönfinkel first-order logic fragment over simple linear real ari...