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

DOI10.1016/j.entcs.2008.12.071zbMath1336.68029OpenAlexW1996595767MaRDI QIDQ4982058

Ekaterina Komendantskaya, Anthony Karel Seda

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.071

zbMATH Keywords

operational semanticsbilatticesSLD-resolutiondeclarative semanticsannotated logic programming

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logic programming
• A framework for automated reasoning in multiple-valued logics
• Fixpoint semantics for logic programming a survey
• Approximate reasoning by similarity-based SLD resolution.
• A logic for reasoning about probabilities
• Logic programming with signs and annotations
• Quantitative deduction and its fixpoint theory
• Bilattices and the semantics of logic programming
• The Semantics of Predicate Logic as a Programming Language
• A Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty