Refutational theorem proving using term-rewriting systems
Artificial Intelligence
VDM: axiomatising its propositional logic
The Computer Journal
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Gröbner bases and factorisation in discrete probability and Bayes
Statistics and Computing
A Methodology for Constructing Expert Systems for Medical Diagnosis
ISMDA '01 Proceedings of the Second International Symposium on Medical Data Analysis
A Certified Polynomial-Based Decision Procedure for Propositional Logic
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
A Computer Algebra Approach to Relational Systems Using Gröbner Bases
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
George Boole, a Forerunner of Symbolic Computation
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
A Symbolic Computation-Based Expert System for Alzheimer's Disease Diagnosis
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Automated deduction for many-valued logics
Handbook of automated reasoning
Limits of theory sequences over algebraically closed fields and applications
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Expert Systems with Applications: An International Journal
A Groebner Bases Based Many-Valued Modal Logic Implementation in Maple
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
A Groebner bases-based approach to backward reasoning in rule based expert systems
Annals of Mathematics and Artificial Intelligence
An algebraic approach to Parkinson disease diagnosis
Expert Systems with Applications: An International Journal
A Polynomial Model for Logics with a Prime Power Number of Truth Values
Journal of Automated Reasoning
Mathematics and Computers in Simulation
| Hi-index | 0.00 |
In the case of classical logic, the Stone isomorphism between Boolean Algebras and Boolean Rings is at the basis of the methods which reduce a logical problem to an algebraic one about polynomials. In this paper, we generalize this kind of reduction to the case of any multi-valued logic. Our main result is the Theorem 4.4 which transforms a deduction problem in a multi-valued logic to an equivalent problem about ideal membership in a polynomial ring. We give some examples of applications; for instance we detail the case of Lukasiewicz's modal logic.