Abstract
In a recent work we defined a possibilistic logic programming language, called PGL+, dealing with fuzzy propositions and with a fuzzy unification mechanism. The proof system, modus ponens-style, was shown to be complete when restricted to a class of Horn clauses satisfying two types of constraints. In this paper we complete the definition of the logic programming system. In particular, we first formalize a notion of PGL+ program and discuss the two types of constraints (called modularity and context constraints) we argue they must satisfy; second, we extend the PGL+ calculus with a chaining and fusion mechanism whose application ensures the fulfillment of the modularity constraint; and finally, we define an efficient (as much as possible) proof procedure oriented to goals which is complete for PGL+ programs satisfying the context constraint.
The authors acknowledge partial support of the Spanish CICYT project SMASH TIC96-1038-C04-01/03.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Alsinet and L. Godo. A complete calculus for possibilistic logic programming with fuzzy propositional variables. In Proc. of UAI-2000, 1–10, Stanford, CA, 2000.
T. Alsinet and L. Godo. A complete proof method for possibilistic logic programming with semantical unification of fuzzy constants. In Proc. of ESTYLF-2000, 279–284, Sevilla, Spain, 2000.
T. Alsinet and L. Godo. A proof procedure for possibilistic logic programming with fuzzy constants (extended version). Technical Report DIEI-01-RT-1, 2001. Available at http://fermat.eup.udl.es/~tracy/report011.ps.
T. Alsinet, L. Godo, and S. Sandri. On the semantics and automated deduction for PLFC, a logic of possibilistic uncertainty and fuzziness. In Proc. of UAI-99, 3–12, Stockholm, Sweden, 1999.
F. Arcelli, F. Formato, and G. Gerla. Fuzzy unification as a foundation of fuzzy logic programming. In Logic Programming and Soft Computing, (Arcelli and Martin eds.), 51–68. Research Studies Press, 1998.
J. Baldwin. Support logic programming. International Journal of Intelligent Systems, 1:73–104, 1986.
J. Baldwin, T. Martin, and B. Pilsworth. Fril-Fuzzy and Evidential Reasoning in Artificial Intelligence. Research Studies Press, 1995.
D. Dubois, J. Lang, and H. Prade. Towards possibilistic logic programming. In Proc. of the Joint Intl. Conf. on Logic Programming, 581–595, Paris, France, 1991.
D. Dubois, J. Lang, and H. Prade. Possibilistic logic. In Handbook of Logic in Artificial Intelligence and Logic Programming (Gabbay et al. eds.) Vol. 3, 439–513. Oxford Univ. Press, 1994.
D. Dubois and H. Prade. Fuzzy sets in approximate reasoning-Part 1: Inference with possibility distributions. Fuzzy Sets and Systems, 40(1):143–202, 1991.
D. Dubois, H. Prade, and S. Sandri. Possibilistic logic with fuzzy constants and fuzzily restricted quantifiers. In Logic Programming and Soft Computing (Arcelli and Martin eds.), 69–90. Research Studies Press, 1998.
F. Formato, G. Gerla, and M. Sessa. Similarity-based unification. Fundamenta Informaticae, 40:1–22, 2000.
L. Godo and L. Vila. Possibilistic temporal reasoning based on fuzzy temporal constraint. In Proc. of IJCAI-95, pages 1916–1922, Montreal, Canada, 1995.
P. Hájek. Metamathematics of Fuzzy Logic. Kluwer, 1998.
F. Klawonn and R. Kruse. A Lukasiewicz logic based Prolog. Mathware and Soft Computing, 1:5–29, 1994.
R. Lee. Fuzzy logic and the resolution principle. Journal of the ACM, 19(1):109–119, 1972.
T. Lukasiewicz. Probabilistic logic programming. In Proceedings of ECAI-98 Conference, pages 388–392, Brighton, UK, 1998.
H. Virtanen. Linguistic logic programming. In F. Arcelli and T. Martin, editors, Logic Programming and Soft Computing, 91–128. Research Studies Press, 1998.
P. Vojtás. Fuzzy reasoning with tunable t-operators. Journal for Advanced Computer Intelligence, 2:121–127, 1998.
T. Weigert, J. Tsai, and X. Liu. Fuzzy operator logic and fuzzy resolution. Journal of Automated Reasoning, 10:59–78, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alsinet, T., Godo, L. (2001). A Proof Procedure for Possibilistic Logic Programming with Fuzzy Constants. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_67
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive