Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

Authors:
Ekaterina Komendantskaya;Anthony Karel Seda
Affiliations:
Department of Mathematics, University College Cork, Cork, Ireland;Department of Mathematics, University College Cork, Cork, Ireland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 18
Cited 0

Quantitative deduction and its fixpoint theory

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
RI: A logic for reasoning with inconsistency

Proceedings of the Fourth Annual Symposium on Logic in computer science
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Bilattices and the semantics of logic programming

Journal of Logic Programming
Lp, a logic for representing and reasoning with statistical knowledge

Computational Intelligence
Theory of generalized annotated logic programming and its applications

Journal of Logic Programming
Probabilistic logic programming

Information and Computation
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Fixpoint semantics for logic programming a survey

Theoretical Computer Science
Approximate reasoning by similarity-based SLD resolution

Theoretical Computer Science
Approximating the Semantics of Logic Programs by Recurrent Neural Networks

Applied Intelligence
A Framework for Automated Reasoning in Multiple-Valued Logics

Journal of Automated Reasoning
Signed Formula Logic Programming: Operational Semantics and Applications (Extended Abstract)

ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
Soundness and Completeness of Non-classical SLD-Resolution

ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
On a theory of probabilistic deductive databases

Theory and Practice of Logic Programming
Query answering in normal logic programs under uncertainty

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.