The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, DeltaTopics: Approximate Reasoning and Fuzzy Inference; Mathematical Foundations: Fuzzy Set Theory and Fuzzy Logic

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
completeness, 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)

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 completeness, 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.

*Limit of Downloads ExceededJoin SciTePress now to download more papers for free and get access to over
full text papers.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

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