Publication:2328910

DOI10.1016/J.FSS.2018.09.008zbMATH Open1423.03080OpenAlexW2891547273MaRDI QIDQ2328910FDOQ2328910

Dušan Guller

Publication date: 16 October 2019

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2018.09.008

zbMATH Keywords

resolutionautomated deductionmany-valued logicsGödel logic

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A structure-preserving clause form translation
• On Fuzzy Logic I Many‐valued rules of inference
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• GRASP: a search algorithm for propositional satisfiability
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• On the structure of semi-groups on a compact manifold with boundary
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• The \(L\Pi\) and \(L\Pi\frac 12\) logics: Two complete fuzzy systems joining Łukasiewicz and product logics
• An optimality result for clause form translation
• Ordered chaining calculi for first-order theories of transitive relations
• On expansions of WNM t-norm based logics with truth-constants
• On Product Logic with Truth-constants
• Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results
• First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties
• Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
• On the refutational completeness of signed binary resolution and hyperresolution
• Short Conjunctive Normal Forms in Finitely Valued Logics
• Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semantics
• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
• On modal extensions of Product fuzzy logic
• Notes on Strong Completeness in Łukasiewicz, Product and BL Logics and in Their First-Order Extensions
• On strong standard completeness in some \(\mathrm{MTL}_\Delta\) expansions
• Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability
• A Resolution Mechanism for Prenex Gödel Logic

Cited In (4)

• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
• A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains
• Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable
• A \textit{DPLL} procedure with dichotomous branching for propositional product logic

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Hypersequent Calculi for Godel Logics -- a Survey 👍 👎
• A family of Gödel hybrid logics 👍 👎
• A non-hyperarithmetical Gödel logic 👍 👎
• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic 👍 👎
• A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains 👍 👎
• A realization theorem for the Gödel-Löb provability logic 👍 👎
• A Resolution Mechanism for Prenex Gödel Logic 👍 👎
• Gödel justification logics and realization 👍 👎

This page was built for publication: Hyperresolution for Gödel logic with truth constants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328910)