Abstract
A suite of algorithms is presented for finding all matrix models for a given propositional calculus from a given search-space. The approach firstly involves finding, for each axiom schema, all minimal partial matrices for the search-space that directly fail to satisfy the axiom (i.e. allrefutations by the axiom). This essentially reduces the problem of generating matrices to a constraint satisfaction problem, albeit a more general one than previously considered in practical settings. A refutation-driven backtracking algorithm is presented for such problems. The algorithms do not rely on any special algebraic properties, although they are capable of exploiting them when available. Preliminary computational experience is reported which demonstrates the practical utility of the algorithms to the logician.
Similar content being viewed by others
References
Aho Alfred V., Sethi Ravi, and Ullman Jeffrey D.,Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, Mass. (1986).
Anderson Alan Ross, and Belnap Nuel D.Jr.,Entailment, The Logic of Relevance and Necessity, Vol. 1, Princeton University Press, Princeton (1975).
Brady Ross T., ‘A computer program for determining matrix models of propositional calculi’,Logique et Analyse 74, 233–253 (1976).
Haralick Robert M., and Elliott Gordon L., ‘Increasing tree search efficiency for constraint satisfaction problems’,Artificial Intelligence 14, 263–313 (1980).
Harrop R., ‘Some structure results for propositional calculi’,J. Symbolic Logic 30, 271–292 (1965).
Kalicki J., ‘Note on truth tables’,J. Symbolic Logic 15, 174–181 (1950).
Kalicki J., ‘A test for the equality of truth tables’,J. Symbolic Logic 17, 161–163 (1952).
Kalicki J., ‘On comparison of finite algebras’,Procs. AMS 3, 36–40 (1952).
Kalicki J., ‘On equivalent truth tables for many-valued logics’,Proc. Edinburgh Math. Soc. 10, 56–61 (1954).
Łukasiewicz Jan, ‘The equivalential calculus’, inPolish Logic, 1920–1939 (StorrsMcCall (ed.)), Clarendon Press, Oxford, pp. 88–115 (1967).
Mackworth Alan K., and Freuder Eugene C., ‘The complexity of some polynomial network consistency algorithms for constraint satisfaction problems’,Artificial Intelligence 25, 65–73 (1985).
Pritchard, Paul, ‘And now for something completely different ... (Notes on a new algorithm for finding matrices)’, unpublished note, October 1 (1978).
Pritchard, Paul, ‘Son of something completely different’, unpublished note, June 25 (1979).
Pritchard, Paul, ‘Opportunistic algorithms for covering with subsets’, Technical Report TR-89-12, Dept. of Computer Sciences, The University of Texas at Austin, May (1989).
Pritchard, Paul, ‘A practical approach to general constraint satisfaction problems’, forthcoming.
Slaney, J. K., ‘Computers and Relevant Logics: A Project in Computing Matrix Model Structures for Propositional Logics’, Ph.D. Thesis, Canberra, Australian National University (1980).
Slaney J. K., ‘3088 varieties: a solution to the Ackermann constant problem’,J. Symbolic Logic 50, 487–501 (1985).
Thistlewaite Paul B., McRobbie Michael A., and Meyer Robert K.,Automated Theorem-Proving in Non-Classical Logics, Pitman, London, and Wiley, New York (1988).
Ulrich Dolph, ‘A five-valued model of theE-p-q theses’,Notre Dame J. Formal Logic 29, 137–138 (1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pritchard, P. Algorithms for finding matrix models of propositional calculi. J Autom Reasoning 7, 475–487 (1991). https://doi.org/10.1007/BF01880325
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01880325