Multi-valued logic and Gröbner bases with applications to modal logic

DOI10.1016/S0747-7171(08)80043-0zbMath0728.03021MaRDI QIDQ804567

N. E. Zubov

Publication date: 1991

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

multi-valued logicdeduction problemideal membership in a polynomial ringLukasiewicz's modal logic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Modal logic (including the logic of norms) (03B45) Other algebras related to logic (03G25) Many-valued logic (03B50)

Related Items (26)

A logic and computer algebra-based expert system for diagnosis of anorexia ⋮ A Groebner bases-based approach to backward reasoning in rule based expert systems ⋮ Quasi-classical reasoning in paraconsistent databases ⋮ On polynomial semantics for propositional logics ⋮ A new algebraic model for implementing expert systems represented under the `concept-attribute-value' paradigm ⋮ A polynomial model for multi-valued logics with a touch of algebraic geometry and computer algebra ⋮ A polynomial model for logics with a prime power number of truth values ⋮ Limits of theory sequences over algebraically closed fields and applications. ⋮ An algebraic model for implementing expert systems based on the knowledge of different experts ⋮ A natural language for implementing algebraically expert systems ⋮ An algebraic approach for detecting nearly dangerous situations in expert systems ⋮ Revisiting four-valued logics from \textit{Maple} using the \textit{Logics Explorer} package ⋮ A portable knowledge-based system for car breakdown evaluation ⋮ A prototype of a RBES for personalized menus generation ⋮ A logic-algebraic tool for reasoning with knowledge-based systems ⋮ The Logics' Explorer: a Maple package for exploring finite many-valued propositional logics ⋮ CWA formalizations in multi-valued logics ⋮ An algebraic approach to rule based expert systems ⋮ Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations ⋮ CWA Extensions to Multi-Valued Logics ⋮ An algebraic approach to DC railway electrification verification ⋮ Polynomial semantics for modal logics ⋮ A Groebner Bases Based Many-Valued Modal Logic Implementation in Maple ⋮ A categorical critical-pair completion algorithm ⋮ An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics ⋮ An expert system for managing medical appropriateness criteria based on computer algebra techniques

Cites Work

• Refutational theorem proving using term-rewriting systems
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• VDM: Axiomatising its Propositional Logic
• The Theory of Representation for Boolean Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multi-valued logic and Gröbner bases with applications to modal logic