View in EDS PDF Full Text

Logical inference of clauses based on Petri net models.

Saved in:
Bibliographic Details
Title: Logical inference of clauses based on Petri net models.
Authors: Chuang Lin1, Chanson, Samuel T.2 chanson@cs.ust.hk
Source: International Journal of Intelligent Systems. Sep98, Vol. 13 Issue 9, p821-840. 20p.
Subjects: Horn clauses, Inference (Logic), Petri nets, Logic programming, Graph theory, Nets (Mathematics)
Abstract: This paper extends the logical inference of Horn clauses in Petri net models to cover a large class of non-Horn clauses. Based on four-valued logic and the conflict transition concept, we show how the Petri net model for this class of non-Horn clauses can be constructed. The clause inference is solved by the T-invariant method or the fixpoint of markings. Both forward and backward inference can be used in our model. It is further shown that these techniques are efficient for the common classes of monotonic reasoning. © 1998 John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Intelligent Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 13447353
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Logical inference of clauses based on Petri net models.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chuang+Lin%22">Chuang Lin</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Chanson%2C+Samuel+T%2E%22">Chanson, Samuel T.</searchLink><relatesTo>2</relatesTo><i> chanson@cs.ust.hk</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Intelligent+Systems%22">International Journal of Intelligent Systems</searchLink>. Sep98, Vol. 13 Issue 9, p821-840. 20p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Horn+clauses%22">Horn clauses</searchLink><br /><searchLink fieldCode="DE" term="%22Inference+%28Logic%29%22">Inference (Logic)</searchLink><br /><searchLink fieldCode="DE" term="%22Petri+nets%22">Petri nets</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming%22">Logic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Nets+%28Mathematics%29%22">Nets (Mathematics)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper extends the logical inference of Horn clauses in Petri net models to cover a large class of non-Horn clauses. Based on four-valued logic and the conflict transition concept, we show how the Petri net model for this class of non-Horn clauses can be constructed. The clause inference is solved by the T-invariant method or the fixpoint of markings. Both forward and backward inference can be used in our model. It is further shown that these techniques are efficient for the common classes of monotonic reasoning. © 1998 John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Intelligent Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=13447353
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/(SICI)1098-111X(199809)13:9<821::AID-INT3>3.0.CO;2-K
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 20
        StartPage: 821
    Subjects:
      – SubjectFull: Horn clauses
        Type: general
      – SubjectFull: Inference (Logic)
        Type: general
      – SubjectFull: Petri nets
        Type: general
      – SubjectFull: Logic programming
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Nets (Mathematics)
        Type: general
    Titles:
      – TitleFull: Logical inference of clauses based on Petri net models.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chuang Lin
      – PersonEntity:
          Name:
            NameFull: Chanson, Samuel T.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep98
              Type: published
              Y: 1998
          Identifiers:
            – Type: issn-print
              Value: 08848173
          Numbering:
            – Type: volume
              Value: 13
            – Type: issue
              Value: 9
          Titles:
            – TitleFull: International Journal of Intelligent Systems
              Type: main
ResultId 1