An annotated logic theorem prover for an extended possibilistic logic

Fuzzy Sets and Systems

Volumn 144, Issue 1, 2004, Pages 67-91

  Kullmann, Peter ^a   Sandri, Sandra ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Annotated logic; Fuzzy sets; PLFC; Possibilistic logic

Indexed keywords

INFORMATION ANALYSIS; INFORMATION MANAGEMENT; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

ANNOTATED LOGIC; POSSIBILISTIC LOGIC;

FUZZY SETS;

EID: 1842842039     PISSN: 01650114     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.fss.2003.10.014     Document Type: Article

References (17)

1. T. Alsinet, L. Godo, A complete calculus for possibilistic logic programming with fuzzy propositional variables, Proc. XV Ann. Conf. on Uncertainty in Artificial Intelligence (UAI'2000), Stanford, CA, USA, 2000, pp. 1-10.
2. T. Alsinet, L. Godo, A proof procedure for possibilistic logic programming with fuzzy constants, Proc. of ECSQARU'2001, Toulouse, France, Lecture Notes in Artificial Intelligence, Vol. 2143, Springer, Berlin, 2001.
3. T. Alsinet, L. Godo, S. Sandri, On the semantics and automated deduction for PLFC, a logic of possibilistic uncertainty and fuzziness, Proc. UAI'99, Stockholm, Sweden, 1999, pp. 3-12.
4. T. Alsinet, L. Godo, S. Sandri, Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification: a comparative description, in: P. Eklund, M. Ojeda-Aciego (Eds.), Electronic Notes in Theoretical Computer Science, Vol. 66(5), 2002, 21p. URL: http://www.elsevier. nl/locate/entcs/volume66.html.
5. Calmet J., Jekutsch S., Kullmann P., Schü S. KOMET - A system for the integration of heterogeneous information sources. Raś Z.W., Skowron A. Foundations of Intelligent Systems. Lecture Notes in Artificial Intelligence. Vol. 1325:1997;318-327 Springer, Berlin.
6. D. Dubois, J. Lang, H. Prade, Possibilistic logic, in: D.M. Gabbay, et al. (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Oxford Univ. Press, Oxford, 1994, pp. 435-513.
7. Dubois D., Lang J., Prade H. Automated reasoning using possibilistic logic. semantics, belief revision and variable certainty weights IEEE Trans. on Data Knowledge Eng. 6(1):1994;64-71.
8. D. Dubois, H. Prade, S. Sandri, Possibilistic logic augmented with fuzzy constants and fuzzy quantifiers, Proc. VI Internat. Conf. on Information Processing and Management of Uncertainty (IPMU'96), Granada, Spain, 1996, pp. 1009-1014.
9. Dubois D., Prade H., Sandri S. Possibilistic logic with fuzzy constants and fuzzy quantifiers. Martin T., Arcelli F. Programming and Soft Computing. 1998;69-90 Research Studies Press, Wiley, New York.
10. L. Godo, L. Vila, Possibilistic temporal reasoning on fuzzy temporal constraints, Proc. XIV Internat. Joint Conf. On Artificial Intelligence (IJCAI'95), 1995, pp. 1916-1922.
11. Kifer M., Subrahmanian V.S. Theory of generalized annotated logic programming and its applications. J. Logic Programming. 12(4):1992;335-367.
12. P. Kullmann, S. Sandri, Possibilistic logic as an annotated logic, Proc. Eighth Internat. IEEE Fuzzy Systems Conf. (Fuzz-IEEE'99), Vol. I, Seoul, South Korea, 1999, pp. 210-215.
13. P. Kullmann, S. Sandri, Implementation of PLFC in KOMET, Technical Report INPE/LAC 001/01, SJ. Campos, Brazil, 2001.
14. Loveland D.W. Automated Theorem Proving. 1978;North-Holland, Amsterdam.
15. S. Sandri, L. Godo, Treatment of temporal information in possibilistic logic with fuzzy constants, Proc. VIII Fuzzy Systems Assoc. World Congress (IFSA'99), Taipei, ROC, 1999, pp. 561-565.
16. S. Sandri, P. Kullmann, Possibilistic logic as an annotated logic: basic ideas and formal proofs, Technical Report, INPE/LAC 001/99, SJ dos Campos, Brazil, 1999.
17. V.S. Subrahmanian, On the semantics of quantitative logic programs, Proc. IV IEEE Symp. Logic Programming, Computer Society Press, Washington, DC, USA, 1987, pp. 173-182.