Using fuzzy Petri nets for static analysis of rule-bases

Date

2004-01-01

Author

Bostan-Korpeoglu, B
Yazıcı, Adnan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

235
views

0
downloads

We use a Fuzzy Petri Net (FPN) structure to represent knowledge and model the behavior in our intelligent object-oriented database environment, which integrates fuzzy, active and deductive rules with database objects. However, the behavior of a system can be unpredictable due to the rules triggering or untriggering each other (non-termination). Intermediate and final database states may also differ according to the order of rule executions (non-confluence). In order to foresee and solve problematic behavior patterns, we employ a static analysis on the FPN structure that provides easy checking of the termination property without requiring any extra construct. In addition, with our proposed fuzzy inference algorithm, we guarantee confluent rule executions. The techniques and solutions provided in this study can be utilized in various complex systems, such as weather forecasting applications and environmental information systems.

Subject Keywords

Database

URI

https://hdl.handle.net/11511/62458

Journal

COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

A new hybrid multi-relational data mining technique Toprak, Seda Dağlar; Toroslu, İ. Hakkı; Department of Computer Engineering (2005) Multi-relational learning has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. As patterns involve multiple relations, the search space of possible hypotheses becomes intractably complex. Many relational knowledge discovery systems have been developed employing various search strategies, search heuristics and pattern language limitations in order to cope with the complexity of hypothesis space. In this w...
Efficient computation of strong partial transitive-closures Toroslu, İsmail Hakkı (null; 1993-01-01) The development of efficient algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present a new algorithm suitable for processing one of these forms, the so called strong partially-instantiated, in which one of the query's argument is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values form both of the q...
An attempt to classify Turkish district data : K-Means and Self-Organizing Map (SOM) algorithms Aksoy, Ece; Işık, Oğuz; Department of Geodetic and Geographical Information Technologies (2004) There is no universally applicable clustering technique in discovering the variety of structures display in data sets. Also, a single algorithm or approach is not adequate to solve every clustering problem. There are many methods available, the criteria used differ and hence different classifications may be obtained for the same data. While larger and larger amounts of data are collected and stored in databases, there is increasing the need for efficient and effective analysis methods. Grouping or classific...
An efficient transitive closure algorithm for distributed databases Toroslu, İsmail Hakkı (1993-01-01) © 1993 IEEE.Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for s...
The strong partial transitive-closure problem: Algorithms and performance evaluation Toroslu, İsmail Hakkı (1996-08-01) The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values...

Citation Formats

B. Bostan-Korpeoglu and A. Yazıcı, “Using fuzzy Petri nets for static analysis of rule-bases,” COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS, pp. 72–81, 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62458.