Resolution Method in Linguistic Propositional Logic

Resolution Method in Linguistic Propositional Logic

In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra - refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a res...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of advanced computer science & applications 2016, Vol.7 (1)
Hauptverfasser: Nguyen, Thi-Minh-Tam, Tran, Duc-Khanh
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Hedges
Linguistics
Logic
Propositions
Semantics
Syntax
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 1
container_start_page
container_title International journal of advanced computer science & applications
container_volume 7
creator Nguyen, Thi-Minh-Tam
Tran, Duc-Khanh
description In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra - refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on linguistic-valued logic which includes incomparable information.
doi_str_mv 10.14569/IJACSA.2016.070191
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2656495669</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2656495669</sourcerecordid><originalsourceid>FETCH-LOGICAL-c202t-56a3dab5b595007b63aaf66a8c49090fcda090442def1f33d00e3619ac87542f3</originalsourceid><addsrcrecordid>eNotkMtOwzAQRS0EElXpF7CJxDplbMeTeFlVPIqCQDwkdpbr2MVVqYOdLPj7pg2zubM4uro6hFxTmNNCoLxdPS2W74s5A4pzKIFKekYmjArMhSjh_PRXOYXy65LMUtrCcFwyrPiE8Debwq7vfNhnz7b7Dk3m91nt95vep86b7DWGNiR_BPQuq8PGmyty4fQu2dl_Tsnn_d3H8jGvXx5Wy0WdGwasywVq3ui1WAspAMo1cq0doq5MIUGCM40eoihYYx11nDcAliOV2lSlKJjjU3Iz9rYx_PY2dWob-jjMSIqhwEIKRDlQfKRMDClF61Qb_Y-Of4qCOglSoyB1FKRGQfwAY31X9A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2656495669</pqid></control><display><type>article</type><title>Resolution Method in Linguistic Propositional Logic</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Nguyen, Thi-Minh-Tam ; Tran, Duc-Khanh</creator><creatorcontrib>Nguyen, Thi-Minh-Tam ; Tran, Duc-Khanh</creatorcontrib><description>In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra - refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on linguistic-valued logic which includes incomparable information.</description><identifier>ISSN: 2158-107X</identifier><identifier>EISSN: 2156-5570</identifier><identifier>DOI: 10.14569/IJACSA.2016.070191</identifier><language>eng</language><publisher>West Yorkshire: Science and Information (SAI) Organization Limited</publisher><subject>Algebra ; Hedges ; Linguistics ; Logic ; Propositions ; Semantics ; Syntax</subject><ispartof>International journal of advanced computer science &amp; applications, 2016, Vol.7 (1)</ispartof><rights>2016. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4014,27914,27915,27916</link.rule.ids></links><search><creatorcontrib>Nguyen, Thi-Minh-Tam</creatorcontrib><creatorcontrib>Tran, Duc-Khanh</creatorcontrib><title>Resolution Method in Linguistic Propositional Logic</title><title>International journal of advanced computer science &amp; applications</title><description>In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra - refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on linguistic-valued logic which includes incomparable information.</description><subject>Algebra</subject><subject>Hedges</subject><subject>Linguistics</subject><subject>Logic</subject><subject>Propositions</subject><subject>Semantics</subject><subject>Syntax</subject><issn>2158-107X</issn><issn>2156-5570</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNotkMtOwzAQRS0EElXpF7CJxDplbMeTeFlVPIqCQDwkdpbr2MVVqYOdLPj7pg2zubM4uro6hFxTmNNCoLxdPS2W74s5A4pzKIFKekYmjArMhSjh_PRXOYXy65LMUtrCcFwyrPiE8Debwq7vfNhnz7b7Dk3m91nt95vep86b7DWGNiR_BPQuq8PGmyty4fQu2dl_Tsnn_d3H8jGvXx5Wy0WdGwasywVq3ui1WAspAMo1cq0doq5MIUGCM40eoihYYx11nDcAliOV2lSlKJjjU3Iz9rYx_PY2dWob-jjMSIqhwEIKRDlQfKRMDClF61Qb_Y-Of4qCOglSoyB1FKRGQfwAY31X9A</recordid><startdate>2016</startdate><enddate>2016</enddate><creator>Nguyen, Thi-Minh-Tam</creator><creator>Tran, Duc-Khanh</creator><general>Science and Information (SAI) Organization Limited</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7T9</scope><scope>7XB</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>2016</creationdate><title>Resolution Method in Linguistic Propositional Logic</title><author>Nguyen, Thi-Minh-Tam ; Tran, Duc-Khanh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c202t-56a3dab5b595007b63aaf66a8c49090fcda090442def1f33d00e3619ac87542f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algebra</topic><topic>Hedges</topic><topic>Linguistics</topic><topic>Logic</topic><topic>Propositions</topic><topic>Semantics</topic><topic>Syntax</topic><toplevel>online_resources</toplevel><creatorcontrib>Nguyen, Thi-Minh-Tam</creatorcontrib><creatorcontrib>Tran, Duc-Khanh</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Linguistics and Language Behavior Abstracts (LLBA)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of advanced computer science &amp; applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nguyen, Thi-Minh-Tam</au><au>Tran, Duc-Khanh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Resolution Method in Linguistic Propositional Logic</atitle><jtitle>International journal of advanced computer science &amp; applications</jtitle><date>2016</date><risdate>2016</risdate><volume>7</volume><issue>1</issue><issn>2158-107X</issn><eissn>2156-5570</eissn><abstract>In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra - refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on linguistic-valued logic which includes incomparable information.</abstract><cop>West Yorkshire</cop><pub>Science and Information (SAI) Organization Limited</pub><doi>10.14569/IJACSA.2016.070191</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2158-107X
ispartof International journal of advanced computer science & applications, 2016, Vol.7 (1)
issn 2158-107X
2156-5570
language eng
recordid cdi_proquest_journals_2656495669
source Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Algebra
Hedges
Linguistics
Logic
Propositions
Semantics
Syntax
title Resolution Method in Linguistic Propositional Logic
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T05%3A59%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Resolution%20Method%20in%20Linguistic%20Propositional%20Logic&rft.jtitle=International%20journal%20of%20advanced%20computer%20science%20&%20applications&rft.au=Nguyen,%20Thi-Minh-Tam&rft.date=2016&rft.volume=7&rft.issue=1&rft.issn=2158-107X&rft.eissn=2156-5570&rft_id=info:doi/10.14569/IJACSA.2016.070191&rft_dat=%3Cproquest_cross%3E2656495669%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2656495669&rft_id=info:pmid/&rfr_iscdi=true