Skip to main content
SpringerLink
Log in

Advanced Many-Valued Logics

  • Chapter
Handbook of Philosophical Logic

Part of the book series: Handbook of Philosophical Logic ((HALO,volume 2))

Abstract

Let me begin with a brief discussion of the name of this chapter: the adjective “advanced” in the title can only be understood in the temporal sense; the bulk of Urquhart’s chapter in this Handbook was written for the first edition in the early 1980s and, therefore, does not cover recent results in depth. Perhaps “complementary” would be an altogether more fitting qualification for the present text. It is not required to have read “Basic Many-Valued Logic” in order to use my chapter. It is (I hope) not more difficult to read, either. On the other hand, you will find few overlaps and for sure some quite different points of view. Urquhart’s chapter, for example, covers functional completeness, model theory, or theory of consequence relations very well, and I do not repeat this material.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Bibliography

  1. Aguilera Venegas, G., Perez de Guzman, I., and Ojeda Aciego, M. Increasing the efficiency of automated theorem proving. Journal of Applied Non-Classical Logics, 5 (1), 9–29.

    Google Scholar 

  2. Aguilera Venegas, G., Perez de Guzman, I., and Ojeda Aciego, M. A reduction-based theorem prover for 3-valued logic. Mathware & Soft Computing, IV (2), 99-127. Special Issue on Deduction in Many-Valued Logic.

    Google Scholar 

  3. Aguilera Venegas, G., Perez de Guzman, I., Ojeda Aciego, M., and Valverde, A. Reducing signed propositional formulas. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 2 (4), 157–166.

    Google Scholar 

  4. Agusti-Cullell et al., 1991] Agusti-Cullell, J., Esteva, F., Garcia, P., Godo, L., and Sierra, C. Combining multiple-valued logics in modular expert systems. Pages 1725 of: D’Ambrosio, Bruce D., Smets, Philippe, and Bonissone, P. P. (eds.), Proc. 7th Conference on Uncertainty in Artificial Intelligence. San Mateo/CA: Morgan Kaufmann.

    Google Scholar 

  5. Agusti-Cullell, J., Esteva, F., Garcia, P., Godo, L., Lopez de Mantaras, R., and Sierra, C. Local multi-valued logics in modular expert systems. Journal of Experimental and Theoretical Artificial Intelligence, 6, 303–321.

    Article  Google Scholar 

  6. Aguzzoli, S. The complexity of McNaughton functions of one variable. Advances in Applied Mathematics, 21 (1), 58–77.

    Google Scholar 

  7. Aguzzoli, S. A note on the representation of McNaughton lines by basic literals. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 2 (3), 111–115.

    Google Scholar 

  8. Aguzzoli, S. Geometric and Proof Theoretic Issues in Lukasiewicz Propositional Logics. Ph.D. thesis, University of Siena, Italy.

    Google Scholar 

  9. Aguzzoli, S., and Ciabattoni, A. Finiteness in infinite-valued logic. Journal of Logic, Language and Information, 9(1), 5–29.

    Google Scholar 

  10. Akers, S. B. Binary decision diagrams. IEEE Transactions on Computers, 27 (6), 509–516.

    Article  Google Scholar 

  11. Anantharaman, S., and Bonacina, M. P. An application of the theorem prover SBR3 to many-valued logic. Pages 156-161 of: Kaplan, S., and Okada, M. (eds.), Proc. 2nd International Workshop on Conditional and Typed Term Rewriting Systems, Montreal, Canada. LNCS, vol. 516. Springer-Verlag. 1990

    Google Scholar 

  12. Angel J. Gil, Torrens, A., and Verdi.), V. On Gentzen systems associated with the finite linear MV-algebras. Journal of Logic and Computation, 7 (4), 473–500. 1997

    Article  Google Scholar 

  13. Arieli, O., and Avron, A. The value of the four values. Artificial Intelligence, 102 (1), 97–141. 1998

    Article  Google Scholar 

  14. Ausiello, G., and Giaccio, R. On-line algorithms for satisfi- ability problems with uncertainty. Theoretical Computer Science, 171 (1-2), 3–24. 1997

    Article  Google Scholar 

  15. Avellone, A., Ferrari, M., and Miglioli, P. Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic Journal of the IGPL, 7 (4), 447–480. 1999

    Article  Google Scholar 

  16. Avron, A. A constructive analysis of RM. Journal of Symbolic Logic, 52 (4), 939–951. 1987

    Article  Google Scholar 

  17. Avron, A. Hypersequents, logical consequence and intermediate logics for concurrency. Annals of Mathematics and Artificial Intelligence, 4 (3-4), 225–248. 1991

    Article  Google Scholar 

  18. Avron, A. Natural 3-valued logics—characterization and proof theory. Journal of Symbolic Logic, 56 (1), 276–294. 1991

    Article  Google Scholar 

  19. Avron, A. The method of hypersequents in the proof theory of propositional non-classical logics. Pages 1-32 of: Hodges, W., Hyland, M., Steinhorn, C., and Truss, J. (eds.), Logic: from foundations to applications. Proc. Logic Colloquium, Keele, UK, 1993. New York: Oxford University Press. 1996

    Google Scholar 

  20. Baaz, M. Infinite-valued Gödel logics with 0-1-projections and relativizations. Pages 23-33 of: Hâjek, P. (ed.), Proc. GODEL’96: Logical Foundations of Mathematics, Computer Science and Physics. Lecture Notes in Logic, vol. 6. Springer-Verlag. 1996

    Google Scholar 

  21. Baaz, M., and Fermüller, C. G. Resolution for many-valued logics. Pages 107-118 of: Voronkov, A. (ed.), Proc. Logic Programming and Automated Reasoning LPAR, St. Petersburg, Russia. LNCS, vol. 624. Springer-Verlag. 1992

    Google Scholar 

  22. Baaz, M., and Fermüller, C. G. Nonelementary speedups between different versions of tableaux. Pages 217-230 of: Baumgartner, P., Hähnle, R., and Posegga, J. (eds.), Proc. 4th Workshop on Deduction with Tableaux and Related Methods, St. Goar, Germany. LNCS, vol. 918. Springer-Verlag. 1995

    Google Scholar 

  23. Baaz, M., and Fermüller, C. G. Resolution-based theorem proving for many-valued logics. Journal of Symbolic Computation, 19 (4), 353–391. 1995

    Article  Google Scholar 

  24. Baaz, M., and Fermüller, C. G. Combining many-valued and intuitionistic tableaux. Pages 65-79 of: Miglioli, P., Moscato, U., Mundici, D., and Ornaghi, M. (eds.), Theorem Proving with Tableaux and Related Methods, 5th International Workshop, TABLEA UX’96, Terrasini, Palermo, Italy. LNCS, vol. 1071. Springer-Verlag. 1996

    Google Scholar 

  25. Baaz, M., and Zach, R. Approximating propositional calculi by finite-valued logics. Pages 257-263 of: Proc. 24th International Symposium on Multiple-Valued Logics (ISMVL), Boston/MA, USA. IEEE CS Press, Los Alamitos. 1994

    Google Scholar 

  26. Baaz, M., Fermüller, C. G., and Zach, R. Elimination of cuts in first-order many-valued logics. Journal on Information Processing and Cybernetics, 29 (6), 333–355. 1994

    Google Scholar 

  27. Baaz, M., Leitsch, A., and Zach, R. Incompleteness of a first-order Gödel logic and some temporal logics of programs. Pages 1-15 of: Kleine Büning, H. (ed.), Selected Papers from Computer Science Logic, CSL’95, Paderborn, Germany. LNCS, vol. 1092. Springer-Verlag. 1996

    Google Scholar 

  28. Baaz, M., Hajek, P., Svejda, D., and Krajiéek, J. Embedding logics into product logic. Studia Logica, 61 (1), 35–47. 1998

    Article  Google Scholar 

  29. Baaz, M:, Fermüller, C. G., Salzer, G., and Zach, R. Labeled calculi and finite-valued logics. Studia Logica, 61 (1), 7–33. Many-valued logics. 1998

    Google Scholar 

  30. Baaz, M., Ciabattoni, A., Fermueller, C. G., and Veith, H. Proof theory of fuzzy logics: Urquhart’s C and related logics. Pages 203-212 of: Brim, L., Gruska, J., and Zlatuska, J. (eds.), Proc. 23rd International Symposium Mathematical Foundations of Computer Science, Brno, Czech Republic. LNCS, vol. 1450. 1998

    Google Scholar 

  31. Baaz, M., Fermüller, C. G., and Salzer, G. Automated deduction for many-valued logics. In: Robinson, A., and Voronkov, A. (eds.), Handbook of Automated Reasoning. Elsevier Science Publishers. 2000

    Google Scholar 

  32. Bachmair, L., and Ganzinger, H. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM, 45 (6), 1007–1049. 1998

    Article  Google Scholar 

  33. Bauer, M., Alexis, R., Atwood, G., Baltar, B., Fazio, A., Frary, K., Hensel, M., Ishac, M., Javanifard, J., Landgraf, M., Leak, D., Loe, K., Mills, D., Ruby, P., Rozman, R., Sweha, S., Talreja, S., and Wojciechowski, K. A multilevel-cell 32 Mb flash memory. Pages 132-133, 351 of: 41st Solid-State Circuits Conference, ISSCC. Digest of Technical Papers. IEEE CS Press. 1995

    Google Scholar 

  34. Beckert, B., and Gabbay, D. Fibring semantic tableaux. Pages 77-92 of: de Swart, H. (ed.), Proc. International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Oisterwijk, The Netherlands. LNCS, no. 1397. Springer-Verlag. 1998

    Google Scholar 

  35. Beckert, B., Hähnle, R., Oel, P., and Sulzmann, M. The tableau-based theorem prover 37AP, version 4.0. Pages 303-307 of: McRobbie, M., and Slaney, J. (eds.), Proc. 13th Conference on Automated Deduction, New Brunswick/NJ, USA. LNCS, vol. 1104. Springer-Verlag. 1996

    Google Scholar 

  36. Beckert, B., Hähnle, R., and Escalada-Imaz, G. Simplification of many-valued logic formulas using anti-links. Journal of Logic and Computation, 8 (4), 569–588. 1998

    Article  Google Scholar 

  37. Beckert, B., Hähnle, R., and Manyâ, F. Transformations between signed and classical clause logic. Pages 248-255 of: Proc. 29th International Symposium on Multiple-Valued Logics,Freiburg, Germany. IEEE CS Press, Los Alamitos. [Beckert et al.,2000a] Beckert, B., Hähnle, R., and Manyâ, F. On the regular 2-SAT problem. Pages 331-336 of: Proc. 30th International Symposium on Multiple-Valued Logics, Portland/OR, USA. IEEE CS Press, Los Alamitos. 1999

    Google Scholar 

  38. Beckert, B., Hähnle, R., and Manyâ, F. The SAT problem of signed CNF formulas. Pages 61-82 of: Basin, D., D’Agostino, M., Gabbay, D., Matthews, S., and Vigan6, L. (eds.), Labelled Deduction. Applied. Logic Series, vol. 17. Kluwer, Dordrecht. 2000

    Google Scholar 

  39. Béjar, R., and Manyà, F. A comparison of systematic and local search algorithms for regular CNF formulas. Pages 22-31 of: Hunter, A., and Parsons, S. (eds.), Proc. Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU’99, London, UK. LNCS, vol. 1638. Springer-Verlag. 1999

    Google Scholar 

  40. Béjar, R., and Manyà, F. Phase transitions in the regular random 3-SAT problem. Pages 292-300 of: Ras, Z. W., and Skowron, A. (eds.), Proc. International Symposium on Methodologies for Intelligent Systems, ISMIS’99, Warsaw, Poland. LNCS, no. 1609. Springer-Verlag. 1996

    Google Scholar 

  41. Béjar, R., and Manyà, F. Solving combinatorial problems with regular local search algorithms. Pages 33-43 of: Ganzinger, H., and McAllester, D. (eds.), Proc. 6th Int. Conference on Logic for Programming and Automated Reasoning, LPAR, Tbilisi, Georgia. LNCS, vol. 1705. Springer-Verlag. 1999

    Google Scholar 

  42. Bell, C., Nerode, A., Ng, R., and Subrahmanian, V. Mixed integer programming methods for computing nonmonotonic deductive databases. Journal of the ACM, 41 (6), 1178–1215. 1994

    Article  Google Scholar 

  43. Belnap, Jr., N. D. Display logic. Journal of Philosophical Logic, 11 (4), 375–417. 1982

    Article  Google Scholar 

  44. Belnap Jr., N. D. A useful four-valued logic. Pages 8-37 of: Dunn, J. M., and Epstein, G. (eds.), Modern uses of multiple-valued logic. Reidel, Dordrecht. 1977

    Google Scholar 

  45. Bibel, W. Automated Theorem Proving. Second revised edn. Vieweg, Braunschweig. 1987

    Google Scholar 

  46. Blair, H. A., and Subrahmanian, V. S. Paraconsistent logic programming. Theoretical Computer Science, 68 (2), 135–154. 1989

    Google Scholar 

  47. Blok, W. J., and Pigozzi, D. Algebraizable logics. Memoirs of the American Mathematical Society, 77(396), vi+78. 1989

    Google Scholar 

  48. Blok and Pigozzi, to appear, 2000] Blok, W. J., and Pigozzi, D. Abstract algebraic logic and the deduction theorem. Bulletin of Symbolic Logic.

    Google Scholar 

  49. Bolc, L., and Borowik, P. Many-Valued Logics. Vol. 1: Theoretical Foundations. Springer-Verlag. 1992

    Google Scholar 

  50. Bolc, L., and Borowik, P. Many-Valued Logics. Vol. 2: Automated Reasoning and Practical Applications. Springer-Verlag. 2000

    Google Scholar 

  51. Bonissone, P. P. Soft computing: the convergence of emerging reasoning technologies. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 1 (1), 6–18. 1997

    Google Scholar 

  52. Boole, G. An Investigation of the Laws of Thought. Walton, London. Reprinted by Dover Books, New York, 1954. 1854

    Google Scholar 

  53. Brink, C. Power structures. Algebra Universalis, 30, 177–216. 1993

    Article  Google Scholar 

  54. Brown, F. M. Boolean Reasoning. Kluwer, Norwell/MA, USA. 1990

    Google Scholar 

  55. Bryant, R. E. A switch-level model and simulator for MOS digital systems. IEEE Transactions on Computers, C-33, 160–169. 1984

    Google Scholar 

  56. Bryant, R. E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35, 677–691. 1986

    Google Scholar 

  57. Bryant, R. E. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24 (3), 293–318. 1992

    Article  Google Scholar 

  58. Bryant, R. E., and Seger, C.-J. H. Formal verification of digital circuits using symbolic ternary system models. Pages 33-43 of: Clarke, E. M., and Kurshan, R. P. (eds.), Proc. 2nd International Conference on Computer-Aided Verification (CAV’90). LNCS, vol. 531. Springer-Verlag. 1991

    Google Scholar 

  59. Burch, J., Clarke, E., McMillan, K., and Dill, D. Sequential circuit verification using symbolic model checking. Pages 46-51 of: Proc. 27th ACM/IEEE Design Automation Conference (DA C). ACM Press. 1990

    Google Scholar 

  60. Cadoli, M., and Schaerf, M. On the complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence, 18 (1), 29–50. 1996

    Google Scholar 

  61. Caferra, R., and Zabel, N. An application of many-valued logic to decide propositional S5 formulae: a strategy designed for a parameterized tableaux-based theorem prover. Pages 23-32 of: Jorrand, Ph., and Sgurev, V. (eds.), Proc. Artificial Intelligence IV: Methodology, Systems, Applications (AIMSA). Elsevier. 1990

    Google Scholar 

  62. Cargile, J. The Sorites paradox. British Journal for the Philosophy of Science, 20, 193–202. 1969

    Article  Google Scholar 

  63. Carnielli, W. A. Systematization of finite many-valued logics through the method of tableaux. Journal of Symbolic Logic, 52 (2), 473–493. 1987

    Article  Google Scholar 

  64. Carnielli, W. A. On sequents and tableaux for many-valued logics. Journal of Non-Classical Logic, 8 (1), 59–76. 1991

    Google Scholar 

  65. Carnielli, W. A. Possible-translations semantics for paraconsistent logics. Pages 149-163 of: Batens, D., Mortensen, C., Priest, G., and Van Bendegem, J. P. (eds.), Frontiers of Paraconsistent Logic. Studies in Logic and Computation, vol. 8. Research Studies Press, Baldock, UK. 2000

    Google Scholar 

  66. Carnielli, W. A., and Coniglio, M. E. A categorial approach to the combination of logics. Manuscrito—Revista Internacional de Filosofia, XXII (2), 69–94. 1999

    Google Scholar 

  67. Carnielli, W. A., and Lima-Marques, M. Society semantics and multiple-valued logics. Pages 33-52 of: Carnielli, W., and D’Ottaviano, I. M. L. (eds.), Advances in Contemporary Logic and Computer Science: Proc. XI Brazilian Logic Conference on Mathematical Logic 1996, Salvador, Brazil. Contemporary Mathematics, vol. 235. American Mathematical Society, Providence. 1999

    Google Scholar 

  68. Carnielli, W. A., Marcos, J., and de Amo, S. Formal inconsistency and evolutionary databases. Logic and Logical Philosophy. 2000

    Google Scholar 

  69. Caste11, T., and Fargier, H. Between SAT and CSP: Propositional satisfaction problems and clausal CSPs. Pages 214-218 of: Prade, H. (ed.), Proc. 13th European Conference on Artificial Intelligence, Brighton. John Wiley Si Sons. 1989

    Google Scholar 

  70. Chang, C. C. Algebraic analysis of many-valued logics. Transactions of the American Mathematical Society, 88, 467–490. 1958

    Article  Google Scholar 

  71. Chang, C. C. A new proof of the completeness of the Lukasiewicz axioms. Transactions of the American Mathematical Society, 93, 74–80. 1959

    Google Scholar 

  72. Ciabattoni, A. On Urquhart’s C logic. Pages 113-118 of: Proc. 30th International Symposium on Multiple-Valued Logics, Portland/OR, USA. IEEE CS Press, Los Alamitos. 2000

    Google Scholar 

  73. Ciabattoni, A. Proof Theoretic Techniques in Many-Valued Logics. Ph.D. thesis, University of Milan, Italy. 2000

    Google Scholar 

  74. Ciabattoni, A., Gabbay, D. M., and Olivetti, N. Cut-free proof systems for logics of weak excluded middle. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 2 (4), 147–156. 1999

    Google Scholar 

  75. Cignoli, R., and Mundici, D. An elementary proof of Chang’s completeness theorem for the infinite-valued calculus of Lukasiewicz. Studia Logica, 58 (1), 79–97. 1997

    Article  Google Scholar 

  76. Cignoli, R., and Mundici, D. An invitation to Chang’s MV algebras. In: Droste, M., and Göbel, R. (eds.), Advances in algebra and model theory: selected surveys presented at conferences in Essen, 1994 and Dresden, 1995. Algebra, logic and applications, no. 9. Gordon Breach, Amsterdam. 1997

    Google Scholar 

  77. Cignoli, R., Esteva, F., Godo, L., and Torrens, A. Basic fuzzy logic is the logic of continuous t-norms and their residua. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 4 (2), 106–112. 2000

    Google Scholar 

  78. Cignoli, R. L. O., D’Ottaviano, I. M. L., and Mundici, D. Algebraic Foundations of Many-Valued Reasoning. Trends in Logic, vol. 7. Kluwer, Dordrecht. 1999

    Google Scholar 

  79. Cohn, P. M. Universal Algebra. Second edn. Reidel, Dordrecht. 1981

    Book  Google Scholar 

  80. D’Agostino, M. Tableaux methods for classical propositional logic. Pages 45-123 of: D’Agostino, M., Gabbay, D., Hähnle, R., and Posegga, J. (eds.), Handbook of Tableau Methods. Kluwer, Dordrecht. 1999

    Google Scholar 

  81. D’Agostino, M., and Gabbay, D. M. A generalization of analytic deduction via labelled deduction sustems. part I: Basic substructural logics. Journal of Automated Reasoning, 13(2), 243–281. 1994

    Google Scholar 

  82. Davey, B. A., and Priestley, H. A. Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press, Cambridge. 1990

    Google Scholar 

  83. Davis, M., Logemann, G., and Loveland, D. A machine program for theorem-proving. Communications of the ACM, 5, 394–397. 1962

    Article  Google Scholar 

  84. de Baets, B., Esteva, F., Fodor, J., and Godo, L. Systems of ordinal fuzzy logic with application to preference modelling. Pages 47-50 of: Proc. Eusfiat-Estylf Joint Conference, Palma de Mallorca, Spain. Univ. de las Islas Baleares. 1999

    Google Scholar 

  85. Di Nola, A., and Lettieri, A. Perfect MV-algebras are categorically equivalent to Abelian t-groups. Studia Logica, 53 (3), 417–432. 1994

    Article  Google Scholar 

  86. Doherty, P. Preliminary report: NM3 — a three-valued non-monotonic formalism. Pages 498-505 of: Ras, Z., Zemankova, M., and Emrich, M. (eds.), Proc. 5th Int. Symposium on Methodologies for Intelligent Systems, Knoxville/TN, USA. North-Holland. 1990

    Google Scholar 

  87. D’Ottaviano, I. M. L., and da Costa, N. C. A. Sur un problem de Jankowski. Comptes Rendus Hebdomadaires des Séances de l’Academie des Sciences, Série A—Sciences Mathématiques, 270 (21), 1349–1353. 1970

    Google Scholar 

  88. Dowling, W., and Gallier, J. Linear-time algorithms for testing the satisfiability of propositional Horn formulæ. Journal of Logic Programming, 3, 267–284. 1984

    Article  Google Scholar 

  89. Driankow, D., Mellendoorp, H., and Reinfrank, M. An Introduction to Fuzzy Control. Springer-Verlag. 1993

    Google Scholar 

  90. Dueck, G. W., and Butler, J. T. Multiple-valued logic operations with universal literals. Pages 73-79 of: Proc. 24th International Symposium on Multiple-Valued Logic, Boston/MA. IEEE CS Press, Los Alamitos. 1994

    Google Scholar 

  91. Dummett, M. A propositional calculus with denumerable matrix. Journal of Symbolic Logic, 24, 97–106. 1959

    Article  Google Scholar 

  92. Dunn, J. M., and Epstein, G. (eds.). Modern Uses of Multiple-Valued Logic. Reidel, Dordrecht. Invited Papers of 5th ISMVL Symposium 1975 with Bibliography by R. G. Wolf. 1977

    Google Scholar 

  93. Dyckhoff, R. A deterministic terminating sequent calculus for GödelDummett logic. Logic Journal of the IGPL, 7 (3), 319–326. 1999

    Article  Google Scholar 

  94. Epstein, R. L. The Semantic Foundations of Logic: Propositional Logic. Second edn. Vol. 1. Oxford University Press. 1996

    Google Scholar 

  95. Escalada-Imaz, G., and Manyà, F. The satisfiability problem for multiple-valued Horn formulae. Pages 250-256 of: Proc. International Symposium on Multiple- Valued Logics, ISMVL ‘9., Boston/MA, USA. IEEE CS Press, Los Alamitos. 1994

    Google Scholar 

  96. Escalada-Imaz, G., and Manyà, F. Efficient interpretation of propositional multi-valued logic programs. Pages 428-439 of: Bouchon-Meunier, B., Yager, R. R., and Zadeh, L. A. (eds.), Advances in Intelligent Computing. IPMU ‘94, 5th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris, France. LNCS, vol. 945. Springer-Verlag. 1995

    Google Scholar 

  97. Esteva, F., and Godo, L. QBL: Towards a logic for left-continuous t-norms. Pages 35-37 of: Proc. Eusfiat-Estylf Joint Conference, Palma de Mallorca, Spain. Univ. de las Islas Baleares. 1999

    Google Scholar 

  98. Esteva, F., Godo, L., Hâjek, P., and Navara, M. Residuated fuzzy logics with an involutive negation. Archive for Mathematical Logic, 39 (2), 103–124. 2000

    Article  Google Scholar 

  99. Eveking, H. Verifikation digitaler Systeme: eine Einführung in den Entwurf korrekter digitaler Systeme. LMI. Teubner, Stuttgart. 1991

    Google Scholar 

  100. Even, S., Itai, A., and Shamir, A. On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing, 5 (4), 691–703. 1976

    Google Scholar 

  101. Fitting, M. C. A Kripke-Kleene semantics for logic programming. Journal of Logic Programming, 4, 295–312. 1985

    Article  Google Scholar 

  102. Fitting, M. C. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11 (2), 91–116. 1985

    Article  Google Scholar 

  103. Fitting, M. C. Many-valued modal logics. Fundamenta Informaticae, XV, 235–254. 1991

    Google Scholar 

  104. Fitting, M. C. Many-valued modal logics II. Fundamenta Informaticae, XVII, 55–74. 1992

    Google Scholar 

  105. Fitting, M. C. Tableaus for many-valued modal logic. Studia Logica, 55 (1), 63–68. 1995

    Article  Google Scholar 

  106. Fitting, M. C. First-Order Logic and Automated Theorem Proving. Second edn. Springer-Verlag, New York. 1996

    Google Scholar 

  107. Frank, M. J. On the simultaneous associativity of F(x, y) and x + y -F(x, y). Aequationes Mathematicae, 19, 194–226. 1979

    Article  Google Scholar 

  108. Gabbay, D. M. Labelled Deductive Systems. Vol. 1—Foundations. Oxford University Press. 1996

    Google Scholar 

  109. Gabbay, D. M. Fibring Logics. Oxford Logic Guides, vol. 38. Oxford University Press. 1999

    Google Scholar 

  110. Ganzinger, H., and Sofronie-Stokkermans, V. Chaining techniques for automated theorem proving in many-valued logics. Pages 337-344 of: Proc. 30th International Symposium on Multiple-Valued Logics, Portland/OR, USA. IEEE CS Press, Los Alamitos. 2000

    Google Scholar 

  111. Geiß, K. Vereinfachung großer Formeln in mehrwertiger Logik mit AntiLinks (in German). Master’s thesis, Fakultät für Informatik, Universität Karlsruhe 1997

    Google Scholar 

  112. Gentzen, G. Untersuchungen über das Logische Schliessen. Mathematische Zeitschrift,39, 176-210, 405-431. English translation

    Google Scholar 

  113. Gerberding, S. DT—an automated theorem prover for multiple-valued first-order predicate logics. Pages 284-289 of: Proc. 26th International Symposium on Multiple-Valued Logics, Santiago de Compostela, Spain. IEEE CS Press, Los Alamitos. 1996

    Google Scholar 

  114. Ginsberg, M. L. Multi-valued logics. Computational Intelligence, 4 (3). 1988

    Google Scholar 

  115. Girard, J.-Y. Linear logic. Theoretical Computer Science, 50, 1–102. 1987

    Article  Google Scholar 

  116. Gödel, K. Zum intuitionistischen Aussagenkalkül. Anzeiger Akademie der Wissenschaften Wien, mathematisch-naturwiss. Klasse, 32, 65-66. Reprinted and translated in [Gödel, 1986 ]. 1932

    Google Scholar 

  117. Gödel, K. Collected Works: Publications 1929-1936. Vol. 1. Oxford University Press. Edited by Solomon Feferman, John Dawson, and Stephen Kleene. 1986

    Google Scholar 

  118. Goldblatt, R. Varieties of complex algebras. Annals of Pure and Applied Logic, 44 (3), 173–242. 1989

    Google Scholar 

  119. Gottwald, S. Mehrwertige Logik. Eine Einführung in Theorie und Anwendungen (in German). Akademie-Verlag Berlin. 1989

    Google Scholar 

  120. Gottwald, S. Fuzzy Sets and Fuzzy Logic. Vieweg, Braunschweig. 1993

    Book  Google Scholar 

  121. Gottwald, S. Axiomatizations of t-norm based logics—a survey. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 4 (2), 63–67. 2000

    Google Scholar 

  122. Gottwald, S. A Treatise on Many- Valued Logics. Research Studies Press, 2000.

    Google Scholar 

  123. Gray, J. Evolution of data management. IEEE Computer, 29(Oct.), 38-46. Special Issue: 50 Years of Computing. 1979

    Google Scholar 

  124. Gulak, P. G. A review of multiple-valued memory technology. Pages 222-231 of: Proc. International Symposium on Multiple-Valued Logics, ISMVL’98, Fukuoka, Japan. IEEE CS Press, Los Alamitos. 1998

    Google Scholar 

  125. Haack, S. Deviant Logic—Some Philosophical Issues. Cambridge University Press. 1974

    Google Scholar 

  126. Haack, S. Deviant Logic, Fuzzy Logic: Beyond the Formalism. University of Chicago Press. Revised edition of [Haack, 1974 ].

    Google Scholar 

  127. Hachtel, G. D., and Somenzi, F. Logic Synthesis and Verification Algorithms. Kluwer Academic Publishers, Boston. 1996

    Google Scholar 

  128. Haenni, R., and Lehmann, N. Assumption-based reasoning with finite set constraints. Pages 1289-1295 of: Proc. Int. Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU, Paris, France. 1996

    Google Scholar 

  129. Haenni, R., and Lehmann, N. Reasoning with finite set constraints. In: Proceedings Workshop 17 Many-valued logic for AI Applications at 13th European Conference in Artificial Intelligence. 1998

    Google Scholar 

  130. Hähnle, R. Towards an efficient tableau proof procedure for multiple-valued logics. Pages 248-260 of: Börger, E., Kleine Büning, H., Richter, M. M., and Schönfeld, W. (eds.), Selected Papers from Computer Science Logic, CSL’90, Heidelberg, Germany. LNCS, vol. 533. Springer-Verlag. 1991

    Google Scholar 

  131. Hähnle, R. Uniform notation of tableaux rules for multiple-valued logics. Pages 238-245 of: Proc. International Symposium on Multiple-Valued Logic, Victoria. IEEE Press, Los Alamitos. 1991

    Google Scholar 

  132. Hähnle, R. Short normal forms for arbitrary finitely-valued logics. Pages 49-58 of: Komorowski, J., and Ras, Z. (eds.), Proc. 7th International Symposium on Methodologies for Intelligent Systems (ISMIS), Trondheim, Norway. LNCS, vol. 689. Springer-Verlag. 1993

    Google Scholar 

  133. Hähnle, R. Automated Deduction in Multiple-Valued Logics. Interntional Series of Monographs on Computer Science, vol. 10. Oxford University Press. 1994

    Google Scholar 

  134. Hähnle, R. Efficient deduction in many-valued logics. Pages 240-249 of: Proc. International Symposium on Multiple-Valued Logics, ISMVL’94, Boston/MA, USA. IEEE CS Press, Los Alamitos. 1994

    Google Scholar 

  135. Hähnle, R. Many-valued logic and mixed integer programming. Annals of Mathematics and Artificial Intelligence, 12 (3,4), 231–264. 1994

    Article  Google Scholar 

  136. Hähnle, R. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4 (6), 905–927. 1994

    Article  Google Scholar 

  137. Hähnle, R. Commodious axiomatization of quantifiers in multiple-valued logic. Pages 118-123 of: Proc. 26th International Symposium on Multiple-Valued Logics, Santiago de Compostela, Spain. IEEE CS Press, Los Alamitos. 1996

    Google Scholar 

  138. Hähnle, R. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6 (1), 49–69. 1996

    Article  Google Scholar 

  139. Hähnle, R. Proof theory of many-valued logic—linear optimization—logic design: Connections and interactions. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 1 (3), 107–119. 1997

    Google Scholar 

  140. Hähnle, R. Commodious axiomatization of quantifiers in multiple-valued logic. Studia Logica, 61 (1), 101–121. Special Issue on Many-Valued Logics, their Proof Theory and Algebras. 1998

    Google Scholar 

  141. Hähnle, R. Tableaux for many-valued logics. Pages 529-580 of: D’Agostino, M., Gabbay, D., Hähnle, R., and Posegga, J. (eds.), Handbook of Tableau Methods. Kluwer, Dordrecht. 1999

    Google Scholar 

  142. Hähnle, R., and Escalada-Imaz, G. Deduction in many-valued logics: a survey. Mathware ft Soft Computing, IV (2), 69–97. 1997

    Google Scholar 

  143. Hähnle, R., and Kernig, W. Verification of switch level designs with many-valued logic. Pages 158-169 of: Voronkov, A. (ed.), Proc. LPAR’93, St. Petersburg, Russia. LNCS, vol. 698. Springer-Verlag. 1993

    Google Scholar 

  144. Hähnle, R., Hasegawa, R., and Shirai, Y. Model generation theorem proving with finite interval constraints. Pages 285-399 of: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L. M., Sagiv, Y., and Stuckey, P. J. (eds.), Proc. Computational Logic–CL 2000, First International Conference, London, UK. LNCS, vol. 1861. Springer-Verlag. 2000

    Google Scholar 

  145. Hâjek, P. Metamathematics of Fuzzy Logic. Trends in Logic: Studia Logica Library, vol. 4. Kluwer Academic Publishers, Dordrecht. 1998

    Google Scholar 

  146. Hâjek, P. Mathematical fuzzy logic—state of art. Pages 197-205 of: Buss, S., Hâjek, P., and Pudl£.k, P. (eds.), Proc. Logic Colloquium ‘98, Prague, Czech Republic. Lecture Notes in Logic, vol. 13. Association for Symbolic Logic with A K Peters. 2000

    Google Scholar 

  147. Hâjek, P., and Paris, J. A dialogue on fuzzy logic. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 1 (1), 3–5. 1997

    Google Scholar 

  148. Hâjek, P., and Zach, R. Review of: Leonard Bolc and Piotr Borowik: Many-Valued Logics 1: Theoretical Foundations. Journal of Applied Non-Classical Logics, 4 (2), 215–220. 1994

    Article  Google Scholar 

  149. Hâjek et al.,1996] Hâjek, P., Godo, L., and Esteva, F. A complete many-valued logic with product conjunction. Archive for Mathematical Logic,35, 191-208. 1996

    Google Scholar 

  150. Hâjek et al.,2000] Hâjek, P., Paris, J., and Sheperdson, J. The liar paradox and fuzzy logic. Journal of Symbolic Logic,65(1), 339-346.

    Google Scholar 

  151. Hâjek, P., Paris, J., and Sheperdson, J. Rational pavelka predicate logic is a conservative extension of Lukasiewicz predicate logic. Journal of Symbolic Logic. 2000

    Google Scholar 

  152. Hayes, J. P. Pseudo-Boolean logic circuits. IEEE Transactions on Computers, C-35(7), 602–612. 1986

    Google Scholar 

  153. Höhle, U. Commutative, residuated f-monoids. Pages 53-106 of: Höhle, U., and Klement, E. P. (eds.), Non-Classical Logics and their Applications to Fuzzy Subsets. Kluwer, Dordrecht. 1995

    Google Scholar 

  154. Hooker, J. N. A quantitative approach to logical inference. Decision Support Systems, 4, 45–69. 1988

    Article  Google Scholar 

  155. Hösli, B. Robuste Logik. Ph.D. thesis, Eidgenössische Technische Hochschule Zürich. 1993

    Google Scholar 

  156. Iturrioz, L. Logics of Approximating Reasoning, Semantically Based on Completely Symmetrical Posets of Cooperating Agents. Draft, Université Claude Bernard, Lyon 1. 1993

    Google Scholar 

  157. Iturrioz, L. (ed.). COST Action 15: Many-valued logics for computer science applications — Final report. EUR 19204. Office for Official Publications of the European Communities, Luxembourg. 2000

    Google Scholar 

  158. Iturrioz, L., Orlowska, E., and Turunen, E. (eds.). Atlas of many-valued structures. Mathematics Report 75. Tampere University of Technology, Department of Information Technology, Tampere, Finland. 2000

    Google Scholar 

  159. Jeroslow, R. G. Logic-Based Decision Support. Mixed Integer Model Formulation. Elsevier, Amsterdam. 1988

    Google Scholar 

  160. Kam, T., Villa, T., Brayton, R. K., and Sangiovanni-Vincentelli, A. Multi-valued decision diagrams: Theory and applications. Multiple-Valued Logic, 4 (1-2), 9–62. 1998

    Google Scholar 

  161. Kameyama, M. Technical activities forum: Multiple-valued logic TC stresses innovation. IEEE Computer, May, 83–85. 1997

    Google Scholar 

  162. Kawahito, S., Ishida, M., Nakamura, T., Kameyama, M., and Higuchi, T. High-speed area-efficient multiplier design using multiple-valued current-mode circuits. IEEE Transactions on Computers, 43 (1), 34–42. 1994

    Article  Google Scholar 

  163. Kerber, M., and Kohlhase, M. A mechanization of strong Kleene logic for partial functions. Pages 371-385 of: Bundy, A. (ed.), Proc. 12th International Conference on Automated Deduction, Nancy/France. LNCS, vol. 814. Springer-Verlag. 1994

    Google Scholar 

  164. Kerber, M., and Kohlhase, M. A resolution calculus for presuppositions. Pages 375-379 of: Proc. 12th European Conference on Artificial Intelligence, ECAI-96. John Wiley Sons. 1996

    Google Scholar 

  165. Kerber, M., and Kohlhase, M. Mechanising partiality without re-implementation. Pages 123-134 of: Brewka, G., Babel, C., and Nebel, B. (eds.), Proc. 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence. LNCS, vol. 1303. Springer-Verlag. 1997

    Google Scholar 

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

    Article  Google Scholar 

  167. Kifer, M., and Lozinskij, E. L. RI: A logic for reasoning with inconsistency. Pages 253-262 of: Proc. Logic in Computer Science LICS. IEEE Press, Los Alamitos. 1989

    Google Scholar 

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

    Article  Google Scholar 

  169. Kirin, V. G. Gentzen’s method of the many-valued propositional calculi. Zeitschrift für mathematische Logik and Grundlagen der Mathematik, 12, 317–332. 1966

    Article  Google Scholar 

  170. Klawonn, F., and Kruse, R. A Lukasiewicz logic based Prolog. Mathware £i Soft Computing, 1 (1), 5–29. 1994

    Google Scholar 

  171. Klement, E. P., Mesiar, R., and Pap, E. Triangular Norms. Trends in Logic, vol. 8. Kluwer, Dordrecht. 2000

    Google Scholar 

  172. Klir, G. J., and Yuan, B. (eds.). Fuzzy Sets, Fuzzy Logic, and Fuzzy Systems: Selected Papers by Lotfi A. Zadeh. Advances in Fuzzy Systems, vol. 6. World Scientific Publishing, Singapore. 1996

    Google Scholar 

  173. Konikowska, B., Morgan, C. G., and Orlowska, E. A relational formalisation of arbitrary finite valued logics. Logic Journal of the IGPL, 6 (5), 755–774. 1998

    Article  Google Scholar 

  174. Kruse, R., Gebhardt, J., and Klawonn, F. Foundations of Fuzzy System. Wiley, Chichester. 1994

    Google Scholar 

  175. Kunen, K. Negation in logic programming. Journal of Logic Programming, 4, 289–308. 1987

    Article  Google Scholar 

  176. Lakshmanan, L. V., and Sadri, F. Modeling uncertainty in deductive databases. Pages 72.4-733 of: Karagiannis, D. (ed.), Proc. Int. Conf. on Database and Expert Systems Applications, DEXA’94, Athens, Greece. LNCS, vol. 856. 1994

    Google Scholar 

  177. Leach, S. M., and Lu, J. J. Query processing in annotationed logic programming: Theory and implementation. Journal of Intelligent Information Systems, 6 (1), 33–58. 1996

    Article  Google Scholar 

  178. Leach, S. M., Lu, J. J., Murray, N. V., and Rosenthal, E. U-resolution: An inference rule for regular multiple-valued logics. Pages 154-168 of: Dix, J., Farinas del Cerro, L., and Furbach, U. (eds.), Proc. 6th European Workshop on Logics in AI (JELIA). LNCS, vol. 1489. Springer-Verlag. 1998

    Google Scholar 

  179. Lee, R. C. T. Fuzzy logic and the resolution principle. Journal of the ACM, 19 (1), 109–119. 1972

    Article  Google Scholar 

  180. Lee, R. C. T., and Chang, C.-L. Some properties of fuzzy logic. Information and Control, 19 (5), 417–431. 1971

    Article  Google Scholar 

  181. Lee, S. Error tolerance method in multiple-valued logic. Pages 392-405 of: Gabbay, D. M., Kruse, R., Nonnengart, A., and Ohlbach, H. J. (eds.), Proc. First Int. Joint Conference on Qualitative and Quantitative Practical Reasoning ECSQARUFAPR, Bad Honnef, Germany. LNCS, vol. 1244. Springer-Verlag. 1997

    Google Scholar 

  182. Lehmke, S. On resolution-based theorem proving in propositional fuzzy logic with `bold’ connectives. Master’s thesis, Universität Dortmund, Fachbereich Informatik. 1995

    Google Scholar 

  183. Lehmke, S. A resolution-based axiomatisation of `bold’ propositional fuzzy logic. Pages 115-119 of: Dubois, D., Klement, E. P., and Prade, H. (eds.), Linz’96: Fuzzy Sets, Logics, and Artificial Intelligence. Abstracts. 1996

    Google Scholar 

  184. Lloyd, J. W. Foundations of Logic Programming. Second edn. Springer, Berlin. 1987

    Google Scholar 

  185. Lobo, J., Minker, J., and Rajasekar, A. Foundations of Disjunctive Logic Programming. MIT Press. 1992

    Google Scholar 

  186. Lu, J. J. Logic programming with signs and annotations. Journal of Logic and Computation, 6 (6), 755–778. 1996

    Article  Google Scholar 

  187. Lu, J. J., and Rosenthal, E. Logic-based deductive reasoning in AI systems. Chap. 29, pages 654-657 of: Tucker, A. B. (ed.), The Computer Science And Engineering Handbook. CRC Press. 1997

    Google Scholar 

  188. Lu, J. J., Henschen, L. J., Subrahmanian, V. S., and da Costa, N. C. A. Reasoning in paraconsistent logics. Pages 181-210 of: Boyer, R. (ed.), Automated Reasoning: Essays in Honor of Woody Bledsoe. Kluwer. 1991

    Google Scholar 

  189. Lu, J. J., Murray, N. V., and Rosenthal, E. Signed formulas and annotated logics. Pages 48-53 of: Proc. 23rd International Symposium on Multiple-Valued Logics. IEEE CS Press, Los Alamitos. 1993

    Google Scholar 

  190. Lu, J. J., Calmet, J., and Schii, J. Computing multiple-valued logic programs. Mathware Soft Computing, IV (2), 129–153. Special Issue on Deduction in Many-Valued Logic. 1997

    Google Scholar 

  191. Lu, J. J., Murray, N. V., and Rosenthal, E. A framework for automated reasoning in multiple-valued logics. Journal of Automated Reasoning, 21 (1), 39–67. 1998

    Article  Google Scholar 

  192. Lukasiewicz, J. O logice trbjwartosciowej. Ruch Filozoficzny, 5, 169-171. Reprinted and translated in [Lukasiewicz, 1970 ].

    Google Scholar 

  193. Lukasiewicz, J. Aristotle’s syllogistic from the standpoint of modern formal logic. 2nd edn. Clarendon Press, Oxford. 1957

    Google Scholar 

  194. Lukasiewicz, J. Jan Lukasiewicz, Selected Writings. North-Holland. Edited by L. Borowski. 1970

    Google Scholar 

  195. Lukasiewicz, J., and Tarski, A. Untersuchungen über den Aussagenkalkül. Comptes Rendus des Séances de la Societé des Sciences et des Lettres de Varsovie, Classe III, 23, 1-21. 1930

    Google Scholar 

  196. Malinowski, G. Many-Valued Logics. Oxford Logic Guides, vol. 25. Oxford University Press. 1993

    Google Scholar 

  197. Mamdani, E. H., and Assilian, S. An experiment in linguistic synthesis with a fuzzy logic controller. International Journal of Man-Machine Studies, 7 (1), 1–13. 1975

    Article  Google Scholar 

  198. Manyà, F. Proof Procedures for Multiple-Valued Propositional Logics. Ph.D. thesis, Facultat de Ciències, Universitat Autbnoma de Barcelona. Published as [Manyà, 1999 ].

    Google Scholar 

  199. Manyà, F. Proof Procedures for Multiple-Valued Propositional Logics. Monografies de l’Institut d’Investigaci6 en Intel•ligència Artificial, vol. 9. IIIA-CSIC, Bellaterra (Barcelona ). 1999

    Google Scholar 

  200. Manyà, F. The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic. An International Journal, 5. 2000

    Google Scholar 

  201. Manyà, F., Béjar, R., and Escalada-Imaz, G. The satisfiability problem in regular CNF-formulas. Soft Computing—A Fusion of Foundations, Methodologies and Applications, 2 (3), 116–123. 1998

    Google Scholar 

  202. Marks, R. J. (ed.). Fuzzy logic technology and applications. IEEE technology updates. IEEE Press, New York. 1994

    Google Scholar 

  203. Martinez, N. G. Priestley duality for Wajsberg algebras. Studio Logica, 49 (1), 31–46. 1990

    Article  Google Scholar 

  204. Martinez, N. G. A topological duality for lattice-ordered algebraic structures, including P-groups. Algebra Universalis, 31, 516–541. 1994

    Article  Google Scholar 

  205. Martinez, N. G. A simplified duality for t-groups and implicative lattices. Studia Logica, 56 (1-2), 185–204. 1996

    Article  Google Scholar 

  206. Martinez, N. G., and Priestley, H. A. On the Priestley space of lattice-ordered algebraic structures. Order.

    Google Scholar 

  207. McNaughton, R. A theorem about infinite-valued sentential logic. Journal of Symbolic Logic, 16 (1), 1–13. 1951

    Article  Google Scholar 

  208. Meinke, K., and Tucker, J. V. Universal algebra. Pages 189409 of: Abramsky, S., Gabbay, D. M., and Maibaum, T. S. E. (eds.), Handbook of Logic in Computer Science. Volume 1. Background: Mathematical Structures. Oxford University Press. 1992

    Google Scholar 

  209. Messing, B. Knowledge representation in many-valued Horn clauses. Pages 83-92 of: Proceedings of the 6th Conference of the Spanish Association for Artificial Intelligence, Alicante. Asociacion Espanola para la Inteligencia Artificial, AEPIA. 1995

    Google Scholar 

  210. Messing, B. Combining knowledge with many-valued logics. Data 84 Knowledge Engineering, 23 (3), 297–316. Special Issue on Distributed Expertise. 1997

    Google Scholar 

  211. Messing, B., and Stackelberg, P. Regular signed resolution applied to annotated logic programs. Poster abstract. Page 268 of: Lloyd, J. (ed.), Proceedings of the International Logic Programming Conference, Portland/OR. MIT Press. 1995

    Google Scholar 

  212. Miglioli, P., Moscato, U., and Ornaghi, M. An improved refutation system for intuitionistic predicate logic. Journal of Automated Reasoning, 13 (3), 361–374. 1994

    Article  Google Scholar 

  213. Miglioli, P., Moscato, U., and Ornaghi, M. Refutation systems for propositional modal logics. Pages 95-105 of: Baumgartner, P., Hähnle, R., and Posegga, J. (eds.), Proc. 4th Workshop on Deduction with Tableaux and Related Methods, St. Goar, Germany. LNCS, vol. 918. Springer-Verlag. 1995

    Google Scholar 

  214. Minato, S. Binary Decision Diagrams and Applications for VLSI CAD. Kluwer, Norwell/MA, USA. 1996

    Google Scholar 

  215. Mitchell, D., Selman, B., and Levesque, H. Hard and easy distributions of SAT problems. Pages 459-465 of: Proc. of AAAI-92, San Jose, CA 1992

    Google Scholar 

  216. Morgan, C. G. A resolution principle for a class of many-valued logics. Logique et Analyse, 19 (74-75-76), 311–339. 1976

    Google Scholar 

  217. Morgan, C. G., and Orlowska, E. Kripke and relational style semantics and associated tableau proof systems for arbitrary finite valued logics. In: Proc. Second Workshop on Theorem Proving with Tableau-Based and Related Methods, Marseille. Tech. Report, MPII Saarbrücken. 1993

    Google Scholar 

  218. Mostert, P. S., and Shields, A. L. On the structure of semigroups on a compact manifold with boundary. Annals of Mathematics, 65, 117–143. 1957

    Article  Google Scholar 

  219. Mostowski, A. Proofs of non-deducibility in intuitionistic functional calculus. Journal of Symbolic Logic, 13 (4), 204–207. 1948

    Article  Google Scholar 

  220. Mostowski, A. Axiomatizability of some many valued predicate calculi. Fundamenta Mathematic z, L, 165–190. 1961

    Google Scholar 

  221. Mundici, D. Interpretation of AF C*-algebras in Lukasiewicz sentential calculus. Journal of Functional Analysis, 65, 15–63. 1986

    Article  Google Scholar 

  222. Mundici, D. Satisfiability in many-valued sentential logic is NPcomplete. Theoretical Computer Science, 52, 145–153. 1987

    Article  Google Scholar 

  223. Mundici, D. The complexity of adaptive error-correcting codes. Pages 300-307 of: Börger, E., Kleine Büning, H., Richter, M. M., and Schönfeld, W. (eds.), Proc. Workshop Computer Science Logic 90, Heidelberg, Germany. LNCS, vol. 533. Springer-Verlag. 1990

    Google Scholar 

  224. Mundici, D. Normal forms in infinite-valued logic: The case of one variable. Pages 272-277 of: Brger, E., Jäger, G., Kleine Büning, H., and Richter, M. M. (eds.), Proc. Workshop Computer Science Logic 91, Berne, Switzerland. LNCS, vol. 626. Springer-Verlag. 1991

    Google Scholar 

  225. Mundici, D. The logic of Ulam’s game with lies. Pages 275-284 of: Bicchieri, C., and Dalla Chiara., M. L. (eds.), Proc. International Conference Knowledge, Belief and Strategic Interaction, Castiglioncello, Italy, 1989. Cambridge Studies in Probability, Induction and Decision Theory. Cambridge University Press. 1992

    Google Scholar 

  226. Mundici, D. Logic of infinite quantum systems. International Journal of Theoretical Physics, 32 (10), 1941–1955. 1993

    Article  Google Scholar 

  227. Mundici, D. A constructive proof of McNaughton’s Theorem in infinite-valued logic. Journal of Symbolic Logic, 59 (2), 596–602. 1994

    Article  Google Scholar 

  228. Mundici, D. Lukasiewicz normal forms and toric desingularizations. Pages 401-423 of: Hodges, W., Hyland, M., Steinhorn, C., and Truss, J. (eds.), Logic: from foundations to applications. Proc. Logic Colloquium 1993, Sta f fordshire, England. Oxford University Press, New York. 1996

    Google Scholar 

  229. Mundici, D., and Olivetti, N. Resolution and model building in the infinite-valued calculus of Lukasiewicz. Theoretical Computer Science, 200(12), 335–366. 1998

    Google Scholar 

  230. Mundici, D., and Pasquetto, M. A proof of the completeness of the infinite-valued calculus of Lukasiewicz with one variable. Pages 107-123 of: Klement, E. P., and Höhle, U. (eds.), Non-classical Logics and their Applications to Fuzzy Subsets (Selected Papers of Int. Conference on Nonclassical Logics and their Applications 1992, Linz, Austria). Kluwer, Dordrecht. 1995

    Google Scholar 

  231. Murata, T., Subrahmanian, V. S., and Wakayama, T. A Petri net model for reasoning in the presence of inconsistency. IEEE Transactions on Knowledge and Data Engineering, 3 (3), 281–292. 1991

    Article  Google Scholar 

  232. Murray, N. V. Completely non-clausal theorem proving. Artificial Intelligence, 18, 67–85. 1982

    Article  Google Scholar 

  233. Murray, N. V., and Rosenthal, E. Improving tableau deductions in multiple-valued logics. Pages 230-237 of: Proceedings 21st International Symposium on Multiple-Valued Logic, Victoria. IEEE Press, Los Alamitos. 1991

    Google Scholar 

  234. Murray, N. V., and Rosenthal, E. Resolution and path-dissolution in multiple-valued logics. Pages 570-579 of: Ras, M., and Zemankova, Z. (eds.), Proc. 6th International Symposium on Methodologies for Intelligent Systems ISMIS, Charlotte/NC, USA. LNCS, vol. 542. Springer-Verlag. 1991

    Google Scholar 

  235. Murray, N. V., and Rosenthal, E. Dissolution: Making paths vanish. Journal of the ACM, 40 (3), 504–535. 1993

    Article  Google Scholar 

  236. Murray, N. V., and Rosenthal, E. Signed formulas: A liftable meta logic for multiple-valued logics. Pages 275-284 of: Komorowski, J., and Ras, Z. (eds.), Proc. 7th International Symposium on Methodologies for Intelligent Systems (ISMIS), Trondheim, Norway. LNCS, vol. 689. Springer-Verlag. 1993

    Google Scholar 

  237. Murray, N. V., and Rosenthal, E. Adapting classical inference techniques to multiple-valued logics using signed formulas. Fundamenta Informaticae, 21 (3), 237–253. 1994

    Google Scholar 

  238. Muzio, J. C., and Wesselkamper, T. Multiple-Valued Switching Theory. Adam Hilger Ltd., Bristol and Boston. 1986

    Google Scholar 

  239. Ng, R., and Subrahmanian, V. S. A semantical framework for supporting subjective and conditional probabilities in deductive databases. Journal of Automated Reasoning, 10 (2), 191–235. 1993

    Article  Google Scholar 

  240. Novak, V. Fuzzy Sets and their Applications. Bristol: Adam Hilger. 1989

    Google Scholar 

  241. Novak, V. A new proof of completeness of fuzzy logic and some conclusions for approximate reasoning. Pages 1461-1468 of: Proc. FUZZ-IEEE/IFES, Yokohama, Japan. IEEE CS Press. 1995

    Google Scholar 

  242. Orlowska, E. Mechanical proof procedure for the n-valued propositional calculus. Bull. de L’Acad. Pol. des Sci., Série des sci. math., astr. et phys., XV (8), 537–541. 1967

    Google Scholar 

  243. Orlowska, E. The resolution principle for w+-valued logic. Fundarnenta Informaticae, II (1), 1–15. 1978

    Google Scholar 

  244. Orlowska, E. Post relation algebras and their proof system. Pages 298307 of: Proc. 21st International Symposium on Multiple-Valued Logic, Victoria/BC, Canada. IEEE Computer Society Press. 1991

    Google Scholar 

  245. Orlowska, E. Relational interpretation of modal logics. Pages 443471 of: Andréka, H., Nemeti, I., and Monk, D. (eds.), Algebraic Logic. Colloquia mathematica Societatis Janos Bolyai, vol. 54. North-Holland, Amsterdam. 1991

    Google Scholar 

  246. Orlowska, E., and Iturrioz, L. A Kripke-style and relational semantics for logics based on lukasiewicz algebras. In: Baghramian, M., and Simons, P. M. (eds.), Lukasiewicz in Dublin: an International Conference on the Work of Jan Lukasiewicz, July 1996. Oxford University Press. 1999

    Google Scholar 

  247. Panti, G. A geometric proof of the completeness of the Lukasiewicz calculus. Journal of Symbolic Logic, 60 (2), 563–578. 1995

    Article  Google Scholar 

  248. Panti, G. Multi-valued logics. Chap. 2, pages 25-74 of: Gabbay, D., and Smets, P. (eds.), Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1: Quantified Representation of Uncertainty and Imprecision. Kluwer, Dordrecht. 1998

    Google Scholar 

  249. Papadimitriou, C. H. Computational Complexity. Addison-Wesley, New York. 1994

    Google Scholar 

  250. Patel-Schneider, P. F. A decidable first-order logic for knowledge representation. Journal of Automated Reasoning, 6, 361–388. 1990

    Article  Google Scholar 

  251. Pavelka, J. On fuzzy logic I: Many-valued rules of inference. Zeitschrift für mathematische Logik and Grundlagen der Mathematik, 25, 45–72. 1979

    Article  Google Scholar 

  252. Pavelka, J. On fuzzy logic II: Enriched residuated lattices and semantics of propositional calculi. Zeitschrift für mathematische Logik and Grundlagen der Mathematik, 25, 119–134. 1979

    Article  Google Scholar 

  253. Pavelka, J. On fuzzy logic III: Semantical completeness of some many-valued propositional calculi. Zeitschrift für mathematische Logik and Grundlagen der Mathematik, 25, 447–464. 1979

    Article  Google Scholar 

  254. Perkowski, M. A. The generalized orthonormal expansion of functions with multiple-valued inputs and some of its application. Pages 442-450 of: Proc. 22nd International Symposium on Multiple-Valued Logic. IEEE CS Press, Los Alamitos. 1992

    Google Scholar 

  255. Pfalzgraf, 1991] Pfalzgraf, J. Logical fiberings and polycontextural systems. Pages 170-184 of: Jorrand, P., and Kelemen, J. (eds.), Proc. International Workshop on Fundamentals of Artificial Intelligence Research (FAIR), Smolenice, Czechoslovakia. LNCS, vol. 535. Springer-Verlag. 1991

    Google Scholar 

  256. Plaisted, D. A., and Greenbaum, S. A structurepreserving clause form translation. Journal of Symbolic Computation, 2, 293–304. 1986

    Article  Google Scholar 

  257. Plaza, J. A. On the propositional SLDNF-resolution. International Journal of Foundations of Computer Science, 7 (4), 359–406. 1996

    Article  Google Scholar 

  258. Pogorzelski, W. A. The deduction theorem for Lukasiewicz many-valued propositional calculi. Studia Logica, 15, 7–23. 1964

    Article  Google Scholar 

  259. Posegga, J. Deduktion mit Shannongraphen für Prädikatenlogik erster Stufe (in German). Ph.D. thesis, University of Karlsruhe. Diski 51, infix Verlag. 1993

    Google Scholar 

  260. Posegga, J., and Schmitt, P. H. Deduction with first-order Shannon graphs. Journal of Logic and Computation, 5 (6), 697–729. 1995

    Article  Google Scholar 

  261. Post, E. L. Introduction to a general theory of elementary propositions. American Journal of Mathematics, 43, 163-185. Reprinted in [van Heijenoort, 1967, pp. 264-283]. 1921

    Google Scholar 

  262. Pottinger, G. Uniform, cut-free formulations of T, S4 and S5 (abstract). Journal of Symbolic Logic, 48 (3), 900. 1983

    Google Scholar 

  263. Prijatelj, A. Bounded contraction and Gentzen-style formulation of Lukasiewicz logics. Studia Logica, 57 (2-3), 437–456. 1996

    Article  Google Scholar 

  264. Puyol-Gruart, J. MILORD II: A Language for Knowledge-Based Systems. Monografies del IIIA, vol. 1. IIIA-CSIC, Artificial Intelligence Research Institute of the Spanish Scientific Research Council. 1996

    Google Scholar 

  265. Ragaz, M. E. Arithmetische Klassifikation von Formelmengen der unendlichwertigen Logik. Ph.D. thesis, ETH Zürich. 1981

    Google Scholar 

  266. Ramesh, A., and Murray, N. V. Computing prime implicants/implicates for regular logics. Pages 115-123 of: Proc. 24th International Symposium on Multiple-Valued Logic, Boston/MA, USA. IEEE CS Press, Los Alamitos. 1994

    Google Scholar 

  267. Ramesh, A., and Murray, N. V. Parameterized prime implicant/implicate computations for regular logics. Mathware Soft Computing, IV (2), 155–179. Special Issue on Deduction in Many-Valued Logic. 1997

    Google Scholar 

  268. Ramesh, A., Becker, G., and Murray, N. V. CNF and DNF considered harmful for computing prime implicants/implicates. Journal of Automated Reasoning, 18 (3), 337–356. 1997

    Article  Google Scholar 

  269. Rasiowa, H. On generalized Post algebras of order w+ and w+-valued predicate calculi. Bull. Acad. Polon. Sci., Sèrie Sci. Math. Astr. Phys., XXI, 209–219. 1997

    Google Scholar 

  270. Rasiowa, H. An Algebraic Approach to Non-Classical Logics. Studies in Logic and the Foundations of Mathematics, vol. 78. North-Holland, Amsterdam. [Rasiowa and Sikorski, 1963 ] Rasiowa, H., and Sikorski, R. The Mathematics of Meta-mathematics. Polish Scientific Publishers, Warszaw. 1974

    Google Scholar 

  271. Rescher, N. Many-Valued Logic. McGraw-Hill, New York. 1969

    Google Scholar 

  272. Rine, D. C. (ed.). Computer Science and Multiple-Valued Logics. Second edn. North-Holland, Amsterdam. Selected Papers from the International Symposium on Multiple-Valued Logics 1974. 1984

    Google Scholar 

  273. Robinson, J. A. The generalized resolution principle. Pages 77-93 of: Machine Intelligence, vol. 3. Oliver and Boyd, Edinburgh. Reprinted in [Siekmann and Wrightson, 1983 ].

    Google Scholar 

  274. Rose, A., and Rosser, J. B. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society, 87, 1–53. 1958

    Article  Google Scholar 

  275. Rosser, J. B., and Turquette, A. R. Many-Valued Logics. Amsterdam: North-Holland. 1952

    Google Scholar 

  276. Rousseau, G. Sequents in many valued logic I. Fundamenta Mathematic, LX, 23–33 1967

    Google Scholar 

  277. Rousseau, G. Sequents in many valued logic II. Fundamenta Mathematic, LXVII, 125–131. 1970

    Google Scholar 

  278. Rudell, R., and Sangiovanni-Vincentelli, A. Multiple-valued minimization for PLA optimization. IEEE Transactions on Computer-Aided Design, 6 (5), 727–750. 1987

    Article  Google Scholar 

  279. Salzer, G. MUltlog: an expert system for multiple-valued logics. Pages 50-55 of: Collegium Logicum. Annals of the Kurt-Gödel-Society, vol. 2. Springer-Verlag, Wien. 1996

    Google Scholar 

  280. Salzer, G. Optimal axiomatizations for multiple-valued operators and quantifiers based on semilattices. Pages 688-702 of: McRobbie, M., and Slaney, J. (eds.), Proc. 13th Conference on Automated Deduction, New Brunswick/NJ, USA. LNCS, vol. 1104. Springer-Verlag. 1996

    Google Scholar 

  281. Sasao, T. Multiple-valued decomposition of generalized Boolean functions and the complexity of programmable logic arrays. IEEE Transactions on Computers, C-30(Sept.), 635–643. 1981

    Google Scholar 

  282. Sasao, T. (ed.). Logic Synthesis and Optimization. Kluwer, Norwell/MA, USA. 1993

    Google Scholar 

  283. Sasao, T. Logic synthesis with EXOR gates. Chap. 12, pages 259-286 of: Sasao, T. (ed.), Logic Synthesis and Optimization. Kluwer, Norwell/MA, USA. 1993

    Google Scholar 

  284. Sasao, T. Ternary decision diagrams and their applications. Chap. 12, pages 269-292 of: Sasao, T., and Fujita, M. (eds.), Representations of Discrete Functions. Kluwer, Norwell/MA, USA. 1996

    Google Scholar 

  285. Sasao, T. Switching Theory for Logic Synthesis. Kluwer, Norwell/MA, USA. 1999

    Google Scholar 

  286. Sasao, T., and Butler, J. T. Comparison of the worst and best sum-of-products expressions for multiple-valued functions. Pages 55-60 of: Proc. 27th International Symposium on Multiple-Valued Logic, Nova Scotia, Canada. IEEE CS Press, Los Alamitos. 1997

    Google Scholar 

  287. Sasao, T., and Fujita, M. (eds.). Representations of Discrete Functions. Kluwer Academic Publishers, Boston. 1996

    Google Scholar 

  288. Scarpellini, B. Die Nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Lukasiewicz. Journal of Symbolic Logic, 27 (2), 159–170. 1962

    Article  Google Scholar 

  289. Schmitt, P. H. Computational aspects of three-valued logic. Pages 190-198 of: Siekmann, J. H. (ed.), Proc. 8th International Conference on Automated Deduction. LNCS, vol. 230. Springer-Verlag. 1986

    Google Scholar 

  290. Schmitt, P. H. Perspectives in multi-valued logic. Pages 206-220 of: Studer, R. (ed.), Proc. International Scientific Symposium on Natural Language and Logic, Hamburg. LNCS, vol. 459. Springer-Verlag. 1989

    Google Scholar 

  291. Schrijver, A. Theory of Linear and Integer Programming. WileyInterscience Series in Discrete Mathematics. John Wiley Sons. 1986

    Google Scholar 

  292. Selman, B., Levesque, H., and Mitchell, D. A new method for solving hard satisfiability problems. Pages 440-446 of: Proc. of AAAI-92, San Jose/CA, USA. AAAI Press. 1992

    Google Scholar 

  293. Selman, B., Kautz, H. A., and Cohen, B. Noise strategies for local search. Pages 337-343 of: Proc. 12th National Conference on Artificial Intelligence, AAAI’94, Seattle/WA, USA. AAAI Press. 1994

    Google Scholar 

  294. Sette, A. M. On the propositional calculus pl. Mathematica Japonicae, 18, 173–180. 1973

    Google Scholar 

  295. Sette, A. M., and Carnielli, W. A. Maximal weaklyintuitionistic logics. Studia Logica, 55(1), 181–203. 1995

    Google Scholar 

  296. Shannon, C. E. A symbolic analysis of relay and switching circuits. AIEE Transactions, 67, 713–723. 1938

    Google Scholar 

  297. Siekmann, J., and Wrightson, G. (eds.). Automation of Reasoning: Classical Papers in Computational Logic 1967-1970. Vol. 2. Springer-Verlag. 1983

    Google Scholar 

  298. Soare, R. I. Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series. Springer-Verlag. 1987

    Google Scholar 

  299. Sofronie-Stokkermans, V. Fibered Structures and Applications to Automated Theorem Proving in Certain Classes of Finitely-Valued Logics and to Modeling Interacting Systems, Ph.D. thesis, Johannes Kepler Universität Linz, Forschungsinstitut für symbolisches Rechnen. 1997

    Google Scholar 

  300. Sofronie-Stokkermans, V. On translation of finitely-valued logics to classical first-order logic. Pages 410-411 of: Prade, H. (ed.), Proc. 13th European Conference on Artificial Intelligence, Brighton. John Wiley Sons. 1998

    Google Scholar 

  301. Sofronie-Stokkermans, V. On the universal theory of varieties of distributive lattices with operators: Some decidability and complexity results. Pages 157-171 of: Ganzinger, H. (ed.), Proc. CADE-16, 16th International Conference on Automated Deduction, Trento, Italy. LNCS, vol. 1632. Springer-Verlag. 1999

    Google Scholar 

  302. Sofronie-Stokkermans, V. Representation theorems and automated theorem proving in non-classical logics. Pages 242-247 of: Proc. 29th International Symposium on Multiple-Valued Logics, Freiburg, Germany. IEEE CS Press, Los Alamitos. 1999

    Google Scholar 

  303. Sofronie-Stokkermans, V. Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I, II. Stadia Logica, 64(1-2), 93-132, 151–172. 2000

    Google Scholar 

  304. Sofronie-Stokkermans, V. Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Multiple-Valued Logic. 2000

    Google Scholar 

  305. Srinivasan, A., Kam, T., Malik, S., and Brayton, R. E. Algorithms for discrete function manipulation. Pages 92-95 of: Proc. IEEE International Conference on CAD, Santa Clara/CA, USA. IEEE CS Press, Los Alamitos. 1990

    Google Scholar 

  306. Stachniak, Z. The resolution rule: An algebraic perspective. Pages 227-242 of: Bergman, C., Maddux, R., and Pigozzi, D. (eds.), Proc. Conference on Algebraic Logic and Universal Algebra in Computer Science, Ames, USA. LNCS, vol. 425. Springer-Verlag. 1988

    Google Scholar 

  307. Stachniak, Z. Resolution Proof Systems: an Algebraic Theory. Kluwer, Dordecht. 1996

    Book  Google Scholar 

  308. Stachniak, Z., and O’Hearn, P. Resolution in the domain of strongly finite logics. Fundamenta Informaticae, XIII, 333–351. 1990

    Google Scholar 

  309. Stärk, R. F. A complete axiomatization of the three-valued completion of logic programs. Journal of Logic and Computation, 1 (6), 811–834. 1991

    Article  Google Scholar 

  310. Strother Moore, J. Introduction to the OBDD algorithm for the ATP community. Journal of Automated Reasoning, 12 (1), 33–45. 1994

    Article  Google Scholar 

  311. Subrahmanian, V. S. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19 (2), 291–331. 1994

    Article  Google Scholar 

  312. Suchon, W. La méthode de Smullyan de construire le calcul n-valent de Lukasiewicz avec implication et négation. Reports on Mathematical Logic, Universities of Cracow and Katowice, 2, 37–42. 1974

    Google Scholar 

  313. Surma, S. J. An algorithm for axiomatizing every finite logic. Reports on Mathematical Logic, 3, 57–62. 1974

    Google Scholar 

  314. Surma, S. J. An algorithm for axiomatizing every finite logic. Pages 143-149 of: Rine, D. C. (ed.), Computer Science and Multiple-Valued Logics, second edn. North-Holland, Amsterdam. Selected Papers from the International Symposium on Multiple-Valued Logics 1974.

    Google Scholar 

  315. Szabo, M. E. (ed.). The Collected Papers of Gerhard Gentzen. North-Holland, Amsterdam. 1969

    Google Scholar 

  316. Takahashi, M. Many-valued logics of extended Gentzen style I. Science Reports of the Tokyo Kyoiku Daigaku, Section A, 9 (231), 95–116. 1967

    Google Scholar 

  317. Tarski, A. On the calculus of relations. Journal of Symbolic Logic, 6 (3), 73–89. 1941

    Article  Google Scholar 

  318. Tassart, G., Iturrioz, L., Klement, E. P., Mundici, D., Prade, H., Schmitt, P., and Hähnle, R. COST Action 15: Many-valued logics for computer science applications. Computational Logic, 2 (2), 32–33. 1995

    Google Scholar 

  319. Thayse, A., Davio, M., and Deschamps, J.-P. Optimization of multiple-valued decision diagrams. Pages 171-177 of: Proc. International Symposium on Multiple-Valued Logics, ISMVL’79, Rosemont/IL, USA. IEEE CS Press, Los Alamitos. 1979

    Google Scholar 

  320. Thiele, H. On closure operators in fuzzy deductive systems and fuzzy algebras. Pages 304-309 of: Proc. 28th International Symposium on Multiple-Valued Logics, Fukuoka, Japan. IEEE Computer Society, Los Alamitos. 1998

    Google Scholar 

  321. Thiele, H., and Kalenka, S. On fuzzy temporal logic. Pages 1027-1032 of: Proc. 2nd IEEE International Conference on Fuzzy Systems, San Francisco, USA, vol. II. IEEE Press. 1993

    Google Scholar 

  322. Thiele, H., and Lehmke, S. On `bold’ resolution theory. Pages 1945-1950 of: Proc. 3rd IEEE Conference on Fuzzy Systems, Orlando, USA, vol. III. IEEE Press. 1994

    Google Scholar 

  323. Thiele, H., and Schmechel, N. On the mutual definability of fuzzy equivalence relations and fuzzy partitions. In: Proc. FUZZ-IEEE/IFES, Yokohama, Japan. IEEE Press. 1995

    Google Scholar 

  324. Tseitin, G. On the complexity of proofs in propositional logics. Seminars in Mathematics, 8. Reprinted in [Siekmann and Wrightson, 1983 ]. 1970

    Google Scholar 

  325. Turner, H. Signed logic programs. Pages 61-75 of: Bruynooghe, M. (ed.), Logic Programming: Proc. of the 1994 International Symposium. The MIT Press. 1994

    Google Scholar 

  326. Turunen, E. Mathematics Behind Fuzzy Logic. Advances in Soft Computing. Springer-Verlag. 1999

    Google Scholar 

  327. Ullman, J. D. Principles of Database and Knowledge-Bade Systems. Volume I: Classical Database Systems. Computer Science Press. 1988

    Google Scholar 

  328. Urquhart, A. Many-valued logic. Chap. 2, pages 71-116 of: Gabbay, D., and Guenthner, F. (eds.), Handbook of Philosophical Logic, Vol. III: Alternatives in Classical Logic. Reidel, Dordrecht.

    Google Scholar 

  329. van Heijenoort, J. (ed.). From Frege to Gödel. A Source Book in Mathematical Logic, 1879-1931. Harvard University Press, Cambridge/MA. 1967

    Google Scholar 

  330. Vienna Group for Multiple Valued Logics. MUltlog 1.0: Towards an expert system for many-valued logics. Pages 226-230 of: McRobbie, M., and Slaney, J. (eds.), Proc. 13th Conference on Automated Deduction, New Brunswick/NJ, USA. LNCS, vol. 1104. Springer-Verlag.

    Google Scholar 

  331. Vojtáš, P. Fuzzy reasoning with tunable t-operators. Journal of Advanced Computational Intelligence, 2, 121–127.

    Google Scholar 

  332. Vojtáš, P., and Paulik, L. Soundness and completeness of non-classical extended SLD-resolution. Pages 289-301 of: Dyckhoff, R., Herre, H., and Schroeder-Heister, P. (eds.), Proc. Extensions of Logic Programming, 5th International Workshop, Leipzig, Germany. LNCS, vol. 1050.

    Google Scholar 

  333. Wagner, H. Nonaxiomatizability and undecidability of an infinite-valued temporal logic. Multiple-Valued Logic, 2 (1), 47–58.

    Google Scholar 

  334. Wójcicki, R. Theory of Logical Calculi. Reidel, Dordrecht.

    Google Scholar 

  335. Yasui, H., and Mukaidono, M. A consideration of fuzzy logic programming based on Lukasiewicz’s implication. Japanese Journal of Fuzzy Theory and Systems, 8 (5), 863–878. 1996

    Google Scholar 

  336. Zach, R. Proof Theory of Finite-valued Logics. Master’s thesis, Institut für Algebra and Diskrete Mathematik, TU Wien. Available as Technical Report TUWE185.2-Z. 1–93.

    Google Scholar 

  337. Zadeh, L. A. A theory of approximate reasoning. Pages 1.¢9-196 of: Hayes, J. E., and Mikulich, L. I. (eds.), Machine Intelligence, vol. 9. Ellis Horwood/John Wiley, New York.

    Google Scholar 

  338. Zimmermann, H.-J. Fuzzy Set Theory—And Its Applications. Second Revised edn. Kluwer, Dordrecht.

    Google Scholar 

  339. Zinov’ev, A. A. Philosophical Problems of Many-Valued Logic. D. Reidel, Dordrecht.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalmers University of Technology, Gothenburg, Sweden

    Reiner Hähnle

Authors
  1. Reiner Hähnle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. King’s College, London, USA

    D. M. Gabbay

  2. Centrum für Informations- und Sprachverarbeitung, Ludwig-Maximilians-Universität München, Germany

    F. Guenthner

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Hähnle, R. (2001). Advanced Many-Valued Logics. In: Gabbay, D.M., Guenthner, F. (eds) Handbook of Philosophical Logic. Handbook of Philosophical Logic, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0452-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0452-6_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5753-2

  • Online ISBN: 978-94-017-0452-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation