A Generalisation of the Hyperresolution Principle to First Order Gödel Logic

DOI10.1007/978-3-319-11271-8_11zbMath1351.03005OpenAlexW169175576MaRDI QIDQ2829667

Dušan Guller

Publication date: 8 November 2016

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11271-8_11

zbMATH Keywords

resolutionmany-valued logicsGödel logicautomated deduction

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35)

Related Items

Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable ⋮ Hyperresolution for Gödel logic with truth constants

Cites Work

• Unnamed Item
• A structure-preserving clause form translation
• An optimality result for clause form translation
• Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
• Ordered chaining calculi for first-order theories of transitive relations
• A Resolution Mechanism for Prenex Gödel Logic
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• Short Conjunctive Normal Forms in Finitely Valued Logics
• Hypersequent Calculi for Godel Logics -- a Survey