Exploiting data dependencies in many-valued logics

Journal of Applied Non-Classical Logics

Volumn 6, Issue 1, 1996, Pages 49-69

  Hähnle, Reiner ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Davis Putnam procedur; Direct products of structures; Hom formula; Many valued logic; Polarity; Resolution

Indexed keywords

EID: 0001787165     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.1080/11663081.1996.10510866     Document Type: Conference Paper

References (27)

1. R. Anderson and W. Bledsoe. A linear format for resolution with merging and a new technique for establishing completeness. JACM, 17:525-534, July 1970. Reprinted in [S-W 83b].
2. M. Buro and H. K. Biining. Report on a SAT competition. Reihe Informatik 110, FB 17-Mathematik/Informatik, Universitat Paderborn, Nov 1992.
3. M. Baaz and C. G. Fermiiller. Resolution for many-valued logics. In A. Voronkov, editor, Proc. Logic Programming and Automated Reasoning LPAR'92, pages 107-118. Springer, LNAI 624, 1992.
4. P. M. Cohn. Universal Algebra. Reidel, Dordrecht, second edition, 1981.
5. W. Dowling and J. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formula:. Journal of Logic Programming, 3:267-284, 1984. (Pubitemid 15564552)
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, 1962.
7. G. Escalada Imaz and F. Manya Serres. The satisfiability problem for multiple-valued Horn formul:e. In Proc. International Symposium on MultipleValued Logics, ISMVL'94, Boston/MA, USA, pages 250-256. IEEE Press, Los Alamitos, 1994.
8. G. Gallo and G. Urbani. Algorithms for testing the satisfiability of propositional formulae. Journal of Logic Programmming, 7(1):45-62, July 1989.
9. W. Hodges. Logical features of Horn clauses. In D. M. Gab bay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1: Logical Foundations, pages 449-503. Oxford University Press, 1992.
10. R. Hahnle. Short normal forms for arbitrary finitely-valued logics. In Proceedings ISM/S'93, Trondheim, Norway, pages 49-58. Springer LNCS 689, 1993.
11. W. Hodges. Model Theory, volume 42 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, 1993.
12. J. N. Hooker. Logic-based methods for optimization. A tutorial. Working Paper, GSIA, CMU Pittsburgh, December 1993.
13. R. Hahnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, to appear, 1994.
14. R. G. Jeroslow and J. Wang. Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence, 1:167-187, 1990.
15. R. Kowalski and P J. Hayes. Semantic trees in automatic theorem proving. In Machine Intelligence, volume 4, pages 87-101. Edinburgh University Press, 1969. Reprinted in [S-W 83b].
16. J. J. Lu, L. J. Henschen, V. S. Subrahmanian, and N.C. A. da Costa. Reasoning in paraconsistent logics. In R. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, pages 181-210. Kluwer, 1991.
17. J. J. Lu, N. V. Murray, and E. Rosenthal. Signed formulas and annotated logics. In Proc. International Symposium on Multiple- Valued Logics, pages 48-53, 1993. (Pubitemid 23697832)
18. J. J. Lu, N. V. Murray, and E. Rosenthal. Signed formulas and fuzzy operator logics. In Proc. International Conference on Methodo/ogiesfor Intelligent Systems, ISMIS'94, Charlotte/NC, USA, pages 75-84. Springer, LNCS 869, 1994.
19. N. V. Murray. Completely non-clausal theorem proving. Artificial Intelligence, 18:67-85, 1982.
20. J. A. Makowsky. Why Horn formulas matter in computer science: Initial structures and generic examples. Journal of Compute rand System Sciences, 34:266-292, 1987. (Pubitemid 17596956)
21. N. V. Murray and E. Rosenthal. Signed formulas: A liftable meta logic for multiple-valued logics. In Proceedings ISMIS'93, Trondheim, Norway, pages 275-284. Springer LNCS 689, 1993.
22. J. A. Robinson. Automatic deduction with hyper-resolution. Int. Journal of Computer Math., 1:227-234, 1965. Reprinted in [S-W 83a].
23. P. H. Schmitt. Computational aspects of three-valued logic. In J. H. Siekmann, editor, Proc. 8th International Conference on Automated Deduction, pages 190-198. Springer, LNCS, 1986.
24. Z. Stachniak and P. O'Hearn. Resolution in the domain of strongly finite logics. Fundamenta lnformaticae, XIII:333-351, 1990.
25. J. Siekmann and G. Wrightson, editors. Automation of Reasoning: Classical Papers in Computational Logic /957-1966, volume I. Springer-Verlag, 1983.
26. J. Siekmann and G. Wrightson, editors. Automation of Reasoning: Classical Papers in Computational Logic 1967-!970, volume 2. Springer-Verlag, 1983.
27. J. Waszkiewicz and B. W vglorz. On products of structures for generalized logics. Studia Logica, XXV:7-13, 1969.