Reference36 articles.
1. M. Baaz and C. G. Fermüller. Resolution-based theorem proving for many-valued logics. Journal of Symbolic Computation, 19 (4): 353–391, Apr. 1995.
2. E. Balas. Disjunctive programming Annals of Discrete Mathematics, 5(Discrete Optimization II):3–51, 1979. Proc. of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium, Canada 1977. Edited by P. L. Hammer, E. L. Johnson, and B. H. Korte.
3. C. Bell, A. Nerode, R. Ng, and V. Subrahmanian. Mixed integer programming methods for computing nonmonotonic deductive databases. Journal of the ACM, 41 (6): 1178–1215, Nov. 1994.
4. W. A. Carnielli. Systematization of finite many-valued logics through the method of tableaux. Journal of Symbolic Logic, 52 (2): 473–493, June 1987.
5. R. Cignoli and D. Mundici. An invitation to Chang’s MV algebras. In M. Droste and R. Göbel, editors, Advances in algebra and model theory: selected surveys presented at conferences in Essen, 1994 and Dresden, 1995, number 9 in Algebra, logic and applications. Gordon and Breach, Amsterdam, 1997.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing in Łukasiewicz Logic and AF-Algebras;The Logic of Software. A Tasting Menu of Formal Methods;2022