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 - General First-order CaseTopics: 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: This paper addresses the deduction problem of a formula from a countable theory in the first-order G\"{o}del logic from a perspective of automated deduction. Our approach is based on the translation of a formula to an equivalent satisfiable CNF one, which contains literals of the augmented form: either a or a → b or (a→b) →b or Qx c→ a or a→Qx c where a, c are atoms different from 0 (the false), 1 (the true); b is an atom different from 1; Q ∈ {∀,∃}; x is a variable occurring in c. A CNF formula is further translated to an equivalent satisfiable finite order clausal theory, which consists of order clauses - finite sets of order literals of the form: either a ≖ b or Qx c ≖ a or a ≖ Qx c or a ≺ b or Qx c ≺ a or a ≺ Qx c where a, b, c are atoms; Q ∈ {∀,∃}; x is a variable occurring in c. ≖ and ≺ are interpreted by the equality and strict linear order on [0,1], respectively. For an input theory, the proposed translation produces a so-called semantically admissible order clausal theory. An order hyperresolution calculus, operating on semantically admissible order clausal theories, is devised. The calculus is proved to be refutation sound and complete for the countable case.(More)

This paper addresses the deduction problem of a formula from a countable theory in the first-order G\"{o}del logic from a perspective of automated deduction. Our approach is based on the translation of a formula to an equivalent satisfiable CNF one, which contains literals of the augmented form: either a or a → b or (a→b) →b or Qx c→ a or a→Qx c where a, c are atoms different from 0 (the false), 1 (the true); b is an atom different from 1; Q ∈ {∀,∃}; x is a variable occurring in c. A CNF formula is further translated to an equivalent satisfiable finite order clausal theory, which consists of order clauses - finite sets of order literals of the form: either a ≖ b or Qx c ≖ a or a ≖ Qx c or a ≺ b or Qx c ≺ a or a ≺ Qx c where a, b, c are atoms; Q ∈ {∀,∃}; x is a variable occurring in c. ≖ and ≺ are interpreted by the equality and strict linear order on [0,1], respectively. For an input theory, the proposed translation produces a so-called semantically admissible order clausal theory. An order hyperresolution calculus, operating on semantically admissible order clausal theories, is devised. The calculus is proved to be refutation sound and complete for the countable case.

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. (2012). An Order Hyperresolution Calculus for Gödel Logic - General First-order Case.In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012) ISBN 978-989-8565-33-4, ISSN 2184-2825, pages 329-342. DOI: 10.5220/0004104103290342

@conference{fcta12, author={Dušan Guller.}, title={An Order Hyperresolution Calculus for Gödel Logic - General First-order Case}, booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012)}, year={2012}, pages={329-342}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0004104103290342}, isbn={978-989-8565-33-4}, }

TY - CONF

JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012) TI - An Order Hyperresolution Calculus for Gödel Logic - General First-order Case SN - 978-989-8565-33-4 AU - Guller, D. PY - 2012 SP - 329 EP - 342 DO - 10.5220/0004104103290342