Skip to main content
SpringerLink
Log in

Procedural Semantics for Fuzzy Disjunctive Programs

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2514))

Abstract

In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L,≤, ∪, ∩, ⇒, 0,1). A graded strong literal disjunction is a pair (D,c) where D is a strong literal disjunction of the form \(l_1 \dot \vee \cdots \dot \vee l_n \) and c is a truth value from the lattice L. A graded disjunction can be understood as a means of the representation of incomplete and uncertain information, where the incompleteness is formalised by its strong literal disjunction, while the uncertainty by its truth degree. In the end, the coincidence of the procedural and fixpoint semantics, proposed in [18], will be reached.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K., R. Introduction to logic programming. Report CS-R8826, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1986.

    Google Scholar 

  2. Alferes, J., J. and Pereira, L., M. On logic program semantics with two kinds of negation. International Joint Conference and Symposium on Logic Programming, MIT Press, 574–588, 1992.

    Google Scholar 

  3. Baral, C., Lobo, J. and Minker, J. Generalized disjunctive well-founded semantics: Declarative semantics. Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, 465–473, 1990.

    Google Scholar 

  4. Baral, C., Lobo, J. and Minker, J. Generalized disjunctive well-founded semantics: Procedural semantics. Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, 456–464, 1990.

    Google Scholar 

  5. Baral, C., Lobo, J. and Minker, J. WF 3: A semantics for negation in normal disjunctive logic programs. Proceedings of the Sixth International Symposium on Methodologies for Intelligent Systems, 459–468, 1991.

    Google Scholar 

  6. Blair, H., A. and Subrahmanian, V., S. Paraconsistent logic programming. Theoretical Computer Science, 68:135–154, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  7. Bonissone, P. Summarizing and propagating uncertain information with triangular norms. International Journal of Approximate Reasoning, 1:71–101, 1987.

    Article  MathSciNet  Google Scholar 

  8. Cohen, P., R. and Grinberg M., R. A theory of heuristic reasoning about uncertainty. AI Magazine, 4(2):17–23, 1983.

    Google Scholar 

  9. Dekhtyar, A. and Subrahmanian, V., S. Hybrid probabilistic programs. Journal of Logic Programming, 43(3):187–250, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. Dempster, A,. P. A generalization of Bayesian inference. Journal of the Royal Statistical Society, B(30):205–247, 1968.

    MathSciNet  Google Scholar 

  11. Doyle, J. Methodological simplicity in expert system construction: the case of judgements and reasoned assumptions. AI Magazine, 4(2):39–43, 1983.

    MathSciNet  Google Scholar 

  12. Fernández, J., A. and Minker, J. Bottom-up computation of perfect models for disjunctive theories. Journal of Logic Programming, 25(1):33–51, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. Fitting, M., C. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11:91–116, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  14. Gelfond, M. and Lifschitz, V. Logic programs with classical negation. Proceedings of the Seventh International Logic Programming Conference, MIT Press, 579–597, Jerusalem, Israel, 1990.

    Google Scholar 

  15. Ginsberg, M. Bilattices and modal operators. Proc. Intl. Conf. on Theoretical Aspects of Reasoning about Knowledge, Morgan Kaufmann, 273–287, 1990.

    Google Scholar 

  16. Guller, D. Semantics for disjunctive programs. Proceedings of the Fifth Workshop on Logic, Language, Information and Computation, 79–91, Sao Paulo, 1998.

    Google Scholar 

  17. Guller, D. On clausal models. Proceedings of the Sixth Workshop on Logic, Language, Information and Computation, 115–126, Rio de Janeiro, 1999.

    Google Scholar 

  18. Guller, D. Semantics for fuzzy disjunctive programs with weak similarity. Proceedings of the First International Workshop on Hybrid Intelligent Systems. Adelaide, 2001. In Hybrid Information Systems, Abraham, A. and Köppen, M., eds., 285–300, Advances in Soft Computing, Physica (Springer)-Verlag, 2002.

    Google Scholar 

  19. Guller, D. Model and fixpoint semantics for fuzzy disjunctive programs with weak similarity. In Recent Advances in Intelligent Paradigms and Applications, Abraham, A. and Lakhmi, J., eds., Studies in Fuzziness and Soft Computing, Physica (Springer)-Verlag, to appear, 2002.

    Google Scholar 

  20. Ishizuka, M. Inference methods based on extended Dempster and Shafer’s theory with uncertainty/fuzziness. New Generation Computing, 1(2):159–168, 1983.

    Article  Google Scholar 

  21. Kifer, M. and Lozinskii, E., L. A logic for reasoning with inconsistency. Journal of Automated Reasoning, Kluwer Ac. Publ., 9(2):179–215, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  22. Kifer, M. and Subrahmanian, V., S. Theory of the generalized annotated logic programming and its applications. Journal of Logic Programming, 12, 335–367, 1992.

    Article  MathSciNet  Google Scholar 

  23. Lukasiewicz, T. Many-valued disjunctive logic programs with probabilistic semantics. Proc. 5th International Conference LPNMR, Springer-Verlag, LNAI 1730, 277–289, El Paso, USA, 1999.

    Google Scholar 

  24. Lukasiewicz, T. Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Int. Journal of Approximate Reasoning, 21(1):23–61, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  25. Lukasiewicz, T. Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics. Tech. Report INFSYS RR-1843-01-06, TU Wien, Proc. Logic Programming and Non-Monotonic Reasoning, LNAI 2173, Springer-Verlag, 336–350, 2001.

    Google Scholar 

  26. Lukasiewicz, T. Probabilistic logic programming with conditional constraints. ACM Trans. Computational Logic, 2(3):289–337, 2001.

    Article  MathSciNet  Google Scholar 

  27. Marks II, R., J. Fuzzy Logic Technology and Applications. IEEE Technical Activities Board, 1994.

    Google Scholar 

  28. Mateis, C. Extending disjunctive logic programming by t-norms. Proc. 5th International Conference LPNMR, Springer-Verlag, LNAI 1730, 290–304, El Paso, USA, 1999.

    Google Scholar 

  29. Mateis, C. Quantitative disjunctive logic programming: semantics and computation. AI Communications, 13(4):225–248, 2000.

    MATH  MathSciNet  Google Scholar 

  30. Minker, J. and Zanon, G. An extension to linear resolution with selection function. Inform. Process. Lett., 14(3):191–194, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  31. Minker, J. On indefinite databases and the closed world assumption. Lecture Notes in Computer Science, Springer Verlag, 138:292–308, 1982.

    Google Scholar 

  32. Minker, J., Rajasekar, A. and Lobo, J. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293–307, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  33. Minker, J. and Rajasekar, A. A fixpoint semantics for non-Horn logic programs. Journal of Logic Programming, 9(1):45–74, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  34. Minker, J., Rajasekar, A. and Lobo, J. Foundations of disjunctive logic programming. MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  35. Minker, J. and Ruiz, C. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta Informaticae, 20(3/4):145–192, 1994.

    MATH  MathSciNet  Google Scholar 

  36. Minker, J. Overview of disjunctive logic programming. Annals of Mathematics and Artificial Intelligence, 12:1–24, 1994.

    Article  MathSciNet  Google Scholar 

  37. Moore, R., C. Semantic considerations on non-monotonic logic. Journal of Artificial Intelligence, 25:75–94, 1985.

    Article  MATH  Google Scholar 

  38. Morishita, S. A unified approach to semantics of multi-valued logic programs. Tech. Report RT 5006, IBM Tokyo, 1990.

    Google Scholar 

  39. Ng, R., T. and Subrahmanian, V., S. Probabilistic logic programming. Information and Computation, 101:150–201, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  40. Nilsson, N., J. Probabilistic logic. Artificial Intelligence, 28:71–87, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  41. Pearl, J. Probabilistic reasoning in intelligent systems-networks of plausible inference. Morgan Kaufmann, 1988.

    Google Scholar 

  42. Przymusinski, T., C. On the declarative semantics of deductive databases and logic programs. Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 193–216, 1988.

    Google Scholar 

  43. Przymusinski, T., C. Semantics of normal and disjunctive logic programs, a unifying framework. Technical report, University of California at Riverside, 1995.

    Google Scholar 

  44. Ross, K., A. and Topor, R., W. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397–424, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  45. Shafer, G. A mathematical theory of evidence. Princeton University Press, 1976.

    Google Scholar 

  46. Shapiro, E. Logic programs with uncertainties: a tool for implementing expert systems. Proc. IJCAI, William Kauffman, 529–532, 1983.

    Google Scholar 

  47. Shortliffe, E. Computer-based medical consultation: MYCIN. Elsevier Science, 1976.

    Google Scholar 

  48. Subrahmanian, V., S. On the semantics of quantitative logic programs. Proc. 4th IEEE Symposium on Logic Programming, Computer Society Press, Washington DC, 173–182, 1987.

    Google Scholar 

  49. Van Emden, M., H. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 4(1):37–53, 1986.

    Article  Google Scholar 

  50. Van Gelder, A., Ross, K., A. and Schlipf, J., S. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.

    Article  MATH  Google Scholar 

  51. Yahya, A. and Henschen, L. J. Deduction in non-Horn databases. Journal of Automated Reasoning, 1(2):141–160, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  52. Zimmermann, H., J. Fuzzy Set Theory and its Applications. Kluwer, Nijhof, second edition, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Comenius University, Mlynská dolina, 842 15, Bratislava, Slovakia

    Dušan Guller

Authors
  1. Dušan Guller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung für Theoretische Informatik, Institut für Algebra und Diskrete Mathematik, Wiedner Hauptstr. 8-10, 1040, Wien, Austria

    Matthias Baaz

  2. Department of Computer Science, University of Manchester, Kilburn Building, Oxford Road, Manchester, M13, 9PL, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guller, D. (2002). Procedural Semantics for Fuzzy Disjunctive Programs. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-36078-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00010-5

  • Online ISBN: 978-3-540-36078-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation