Reference70 articles.
1. Aguzzoli, S.: The complexity of McNaughton functions of one variable. Advances in Applied Mathematics, 21, (1) (1998) 58–77
2. Aguzzoli, S.: Geometric and Proof Theoretic Issues in Lukasiewicz Propositional Logics. PhD thesis, University of Siena, Italy, Feb. (1999)
3. Aguzzoli, S. and Ciabattoni, A.: Finiteness in infinite-valued logic. Journal of Logic, Language and Information, 9, (1) (2000) 5–29
4. Ausiello, G. and Giaccio, R.: On-line algorithms for satisfiability problems with uncertainty. Theoretical Computer Science, 171 (1–2) Jan. (1997) 3–24
5. Baaz, M. and Fermüller, C.G.: Resolution-based theorem proving for many-valued logics. Journal of Symbolic Computation, 19, (4) Apr. (1995) 353–391
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing in Łukasiewicz Logic and AF-Algebras;The Logic of Software. A Tasting Menu of Formal Methods;2022
2. Automated theorem proving by resolution in non-classical logics;Annals of Mathematics and Artificial Intelligence;2007-06-13