Fixpoint&Proof-theoretic Semantics for CLP with Qualification and Proximity

@inproceedings{RodriguezArtalejo2010FixpointProoftheoreticSF,
  title={Fixpoint&Proof-theoretic Semantics for CLP with Qualification and Proximity},
  author={Mario Rodr'iguez-Artalejo and Carlos A. Romero-D'iaz},
  year={2010}
}
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 55 references

Similaritybased reasoning in qualified logic programming

  • R. Caballero, M. Rodŕıguez-Artalejo, C. A. Romero-D́ıaz
  • Proceedings of the 10th international ACM SIGPLAN…
  • 2008
Highly Influential
9 Excerpts

Proximity relations in the fuzzy relational database model

  • S. Shenoi, A. Melton
  • Fuzzy Sets and Systems 100, supl., 51–62.
  • 1999
Highly Influential
4 Excerpts