Research.Publish.Connect.

## Paper

Author: Dušan Guller

Affiliation: Comenius University, Slovak Republic

ISBN: 978-989-758-157-1

Keyword(s): Gödel Logic, Resolution, Many-valued Logics, Automated Deduction.

Related Ontology Subjects/Areas/Topics: Approximate Reasoning and Fuzzy Inference ; Artificial Intelligence ; Computational Intelligence ; Fuzzy Systems ; Mathematical Foundations: Fuzzy Set Theory and Fuzzy Logic ; Soft Computing

Abstract: In (Guller, 2014), we have generalised the well-known hyperresolution principle to the first-order Godel logic ¨ with truth constants. This paper is a continuation of our work. We propose a hyperresolution calculus suitable for automated deduction in a useful expansion of Godel logic by intermediate truth constants and the equality, ¨ P, strict order, ≺, projection, ∆, operators. We solve the deduction problem of a formula from a countable theory in this expansion. We expand Godel logic by a countable set of intermediate truth constants ¯ ¨ c, c ∈ (0,1). Our approach is based on translation of a formula to an equivalent satisfiable finite order clausal theory, consisting of order clauses. An order clause is a finite set of order literals of the form ε1  ε2 where εi is an atom or a quantified atom, and  is the connective P or ≺. P and ≺ are interpreted by the equality and standard strict linear order on [0,1], respectively. We shall investigate the so-called canonical standard comple teness, where the semantics of Godel logic is given by the standard ¨ G-algebra and truth constants are interpreted by ’themselves’. The hyperresolution calculus is refutation sound and complete for a countable order clausal theory under a certain condition for the set of truth constants occurring in the theory. As an interesting consequence, we get an affirmative solution to the open problem of recursive enumerability of unsatisfiable formulae in Godel logic with truth constants and the equality, ¨ P, strict order, ≺, projection, ∆, operators. (More)

You are not signed in, therefore limits apply to your IP address 54.92.164.184

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Guller D. (2015). An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta.In Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 2: FCTA, (ECTA 2015) ISBN 978-989-758-157-1, pages 31-46. DOI: 10.5220/0005587600310046

@conference{fcta15,
author={Dušan Guller},
title={An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta},
booktitle={Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 2: FCTA, (ECTA 2015)},
year={2015},
pages={31-46},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005587600310046},
isbn={978-989-758-157-1},
}

TY - CONF

JO - Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 2: FCTA, (ECTA 2015)
TI - An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta
SN - 978-989-758-157-1
AU - Guller D.
PY - 2015
SP - 31
EP - 46
DO - 10.5220/0005587600310046