Quantifier-Free Equational Logic and Prime Implicate Generation
نویسندگان
چکیده
منابع مشابه
Abduction and prime implicates, from propositional logic to equational logic
Contents Motivations 4 1 State of the art for prime implicate generation in propositional logic 6 1.1 Abduction and prime implicates in propositional logic .
متن کاملPrime Implicate Generation in Equational Logic
We present an algorithm for the generation of prime implicates in equational logic, that is, of the most general consequences of formulæ containing equations and disequations between first-order terms. This algorithm is defined by a calculus that is proved to be correct and complete. We then focus on the case where the considered clause set is ground, i.e., contains no variables, and devise a s...
متن کاملMinimum bases for equational theories of groups and rings: the work of Alfred Tarski and Thomas Green
Suppose that T is an equational theory of groups or of rings. If T is finitely axiomatizable, then there is a least number μ so that T can be axiomatized by μ equations. This μ can depend on the operation symbols that occur in T . In the 1960’s, Alfred Tarski and Thomas C. Green completely determined the values of μ for arbitrary equational theories of groups and of rings. While Tarski and Gree...
متن کاملSatisfiability Problem in Composition-Nominative Logics of Quantifier-Equational Level
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 ...
متن کاملCategory-based Semantics for Equational and Constraint Logic Programming
This thesis proposes a general framework for equational logic programming, called catf:gory based equational logic by placing the general principles underlying the design of the pro gramming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfy ing certain natural conditions; completeness i...
متن کامل