Resolution and model building in the infinite-valued calculus of Łukasiewicz

Theoretical Computer Science

Volumn 200, Issue 1-2, 1998, Pages 335-366

  Mundici, Daniele ^a   Olivetti, Nicola ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Davis Putnam procedure; Feasible automated deduction; Horn clauses; Krom clauses; McNaughton functions; Model building; Polynomial complexity; Resolution in infinite valued logic; ukasiewicz calculus

Indexed keywords

EID: 0000366861     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00012-7     Document Type: Article

References (12)

1. G. Escalada Imaz, F. Manyiá Serres, The satisfiability problem for multiple-valued Horn formulae, in: Proc. Internat. Symp. on Multiple-Valued Logics, ISMVL '94., Boston, MA, USA, IEEE Press, Los Alamitos, 1994, pp. 250-256.
2. R. Hähnle, Exploiting data dependencies in many-valued logics, J. Appl. Non-Classical Logics 6 (1996) 49-69.
3. M.R. Krom, The decision problem for formulas in prenex conjunctive normal form with binary disjunctions, J. Symbolic Logic 35 (1970) 210-216.
4. J. Łukasiewicz, A. Tarski, Untersuchungen über den Aussagenkalkül, Comptes Rendus Séances Société Sciences Lettres Varsovie, Classe III 23 (1930) 30-50. English translation in: [11, Ch. IV].
5. R. McNaughton, A theorem about infinite-valued sentential logic, J. Symbolic Logic 16 (1951) 1-13.
6. D. Mundici, Satisfiability in many-valued sentential logic is NP-complete, Theoret. Comput. Sci. 52 (1987) 145-153.
7. D. Mundici, Logic of infinite quantum systems, Internat. J. Theoret. Phys. 32 (1993) 1941-1955.
8. D. Mundici, Łukasiewicz normal forms and toric desingularizations, in: W. Hodges et al. (Eds.), Proc. Logic Coll., 1993, Keele, England, Oxford University Press, Oxford, 1996, pp. 401-423.
9. D. Mundici, A. Trombetta, Optimal comparison strategies in Ulam's searching game with errors, Theoret. Comput. Sci. 182 (1997) 217-232.
10. A. Rose, J.B. Rosser, Fragments of many-valued statement calculi, Trans. Amer. Math, Soc. 87 (1958) 1-53.
11. A. Tarski, Logic, Semantics, Metamathematics, Clarendon Press, Oxford, 1956. Reprinted (1983) by Hackett, Indianapolis.
12. P. VojtásŁ, L. Paulik, Soundness and completeness of non-classical extended SLD-resolution, in: R. Dyckhoff et al. (Eds.), Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, vol. 1050, Springer, Berlin, 1996, pp. 289-301.