Hybrid Probabilistic Logic Programs as Residuated Logic Programs

@article{Damsio2002HybridPL,
  title={Hybrid Probabilistic Logic Programs as Residuated Logic Programs},
  author={Carlos Viegas Dam{\'a}sio and Lu{\'i}s Moniz Pereira},
  journal={Studia Logica},
  year={2002},
  volume={72},
  pages={113-138}
}
In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs… 

Monotonic and Residuated Logic Programs

TLDR
This paper defines the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated and the embedding of possibilistic logic programming is provided.

A new approach to hybrid probabilistic logic programs

TLDR
This proposal provides the foundational grounds for developing computational methods for implementing the proposed semantics and makes it clearer how to characterize non-monotonic negation in probabilistic logic programming frameworks for commonsense reasoning.

Hybrid Probabilistic Logic Programs with Non-monotonic Negation

TLDR
This paper describes the first time that two different semantics for Hybrid Probabilistic Programs with non-monotonic negation as well as their relationships are described, and provides a foundational ground for developing computational methods for computing the proposed semantics.

Non-monotonic Negation in Hybrid Probabilistic Logic Programs

TLDR
This paper describes the first time that two different semantics for Hybrid Probabilistic Programs with nonmonotonic negation as well as their relationships are described, and provides a foundational ground for developing computational methods for computing the proposed semantics.

Termination of logic programs with imperfect information: applications and query procedure

A comparison of fuzzy and annotated logic programming

Lukasiewicz Logic: From Proof Systems To Logic Programming

TLDR
An algorithm for fuzzy logic programming in Rational Pavelka logic RPL, an extension of L with rational constants, is provided, similar to goal-directed calculi for other logics.

A Tabulation Proof Procedure for Residuated Logic Programming

TLDR
This work provides a tabulation goal-oriented query procedure, and shows that the tabulation procedure terminates if and only if the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely-many steps.

Sorted Multi-adjoint Logic Programs: Termination Results and Applications

A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented. The main contribution is a new sufficient condition which guarantees

References

SHOWING 1-10 OF 29 REFERENCES

Monotonic and Residuated Logic Programs

TLDR
This paper defines the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated and the embedding of possibilistic logic programming is provided.

Hybrid Probabilistic Programs

Hybrid Probabilistic Programs: Algorithms and Complexity

TLDR
This paper classify HPPs into three classes called HPP1, HPP2 and HPPr, r > 3, and provides algorithms and complexity results for the problems of entailment, consistency and consistency.

Multi-adjoint Logic Programming with Continuous Semantics

TLDR
The continuity of the immediate consequences operators is proved and the assumptions required to get continuity are further analysed.

Towards Possibilistic Logic Programming

TLDR
This paper proposes extensions of the possibilistic logic calculus where weighted formulas can be attached to a set of agents or which can be embedded inside another weighted formula, for the expression of mutual beliefs.

Foundations of Logic Programming

  • J. Lloyd
  • Computer Science
    Symbolic Computation
  • 1987
This is the second edition of an account of the mathematical foundations of logic programming. Its purpose is to collect, in a unified and comprehensive manner, the basic theoretical results of the

On Fuzzy Logic III. Semantical completeness of some many-valued propositional calculi

TLDR
The case when the underlying lattice of B is a chain is investigated, viz. an abstract set of formulas, which poses the problem of axiomatizability of the 8-valued propositional calculus over P.

Many-Valued Logics

TLDR
This chapter discusses the method of Finitely Generated Trees in n-valued Logical Calculi of Propositional Calculus for Many-Valued Logics and some examples of fuzzy propositional calculus.