International audienceWe introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that fibrational se- mantics corresponds with the traditional declarative (ground) semantics and deduce a soundness and completeness result for our SLD-resolution algorithm with respect to the ground semantics
FDE is a logic that captures relevant entailment between implication-free formulae and admits of an ...
AbstractWe study the expressive of two semantics far deductive databases and logic programming: the ...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first g...
AbstractThe paper defines a new declarative semantics for logic programs, which is based on interpre...
AbstractWe introduce global SLS-resolution, a procedural semantics for well-founded negation as defi...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
AbstractSLDNF-resolution is a standard operational semantics for negation as (finite) failure. For s...
AbstractWe extend the abstract interpretation point of view on context-free grammars by Cousot and C...
The paper defines a new declarative semantics for logic programs, which is based on interpretations ...
AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect ...
AbstractWe define in this paper a system of axioms for any general logic program. With regard to thi...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
FDE is a logic that captures relevant entailment between implication-free formulae and admits of an ...
AbstractWe study the expressive of two semantics far deductive databases and logic programming: the ...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first g...
AbstractThe paper defines a new declarative semantics for logic programs, which is based on interpre...
AbstractWe introduce global SLS-resolution, a procedural semantics for well-founded negation as defi...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
AbstractSLDNF-resolution is a standard operational semantics for negation as (finite) failure. For s...
AbstractWe extend the abstract interpretation point of view on context-free grammars by Cousot and C...
The paper defines a new declarative semantics for logic programs, which is based on interpretations ...
AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect ...
AbstractWe define in this paper a system of axioms for any general logic program. With regard to thi...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
FDE is a logic that captures relevant entailment between implication-free formulae and admits of an ...
AbstractWe study the expressive of two semantics far deductive databases and logic programming: the ...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...