Satisfiability Problem in Composition-Nominative Logics of Quantifier-Equational Level
Mykola S. Nikitchenko, Valentyn G. Tymofieiev · 2012
We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming; they can be considered as generalizations of traditional logics on classes of partial predicates that do not have fixed arity. We show the reduction of the problem in hand to the satisfiability problem for classical first-order predicate logic with equality. The proposed reduction requires extension of logic language and logic models with an infinite number of unessential variables. The method developed in the paper enables us to use existent satisfiability checking procedures also for quantifier composition-nominative logic with equality. Keywords: Composition-nominative logics, partial predicates, partial logics, first-order logics, satisfiability, validity. Key Terms. Research, MathematicalModel, FormalMethods, MachineIntelligence.