We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established
Extended logic programs and annotated logic programs are two important extensions of normal logic pr...
Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in log...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
AbstractWe introduce the class of normal bilattice-based annotated first-order logic programs (BAPs)...
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and dev...
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and dev...
Abstract. We introduce the class of bilattice-based annotated logic programs (BAPs). These programs ...
Abstract. Bilattice-based annotated logic programs (BAPs) form a very general class of programs whic...
This paper presents a new operational semantics for logic programs with external procedures, introdu...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
AbstractWe introduce a generalized definition of SLD-resolution admitting restrictions on atom and/o...
AbstractWe introduce a new operational semantics, SLDR-resolution, for a class of recursive logic pr...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
Extended logic programs and annotated logic programs are two important extensions of normal logic pr...
Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in log...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
AbstractWe introduce the class of normal bilattice-based annotated first-order logic programs (BAPs)...
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and dev...
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and dev...
Abstract. We introduce the class of bilattice-based annotated logic programs (BAPs). These programs ...
Abstract. Bilattice-based annotated logic programs (BAPs) form a very general class of programs whic...
This paper presents a new operational semantics for logic programs with external procedures, introdu...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
AbstractWe introduce a generalized definition of SLD-resolution admitting restrictions on atom and/o...
AbstractWe introduce a new operational semantics, SLDR-resolution, for a class of recursive logic pr...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
Extended logic programs and annotated logic programs are two important extensions of normal logic pr...
Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in log...
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-reso...
DOI
Add to ORKG