Generalizing predicates with string arguments

Download

index.pdf

Date

2006-08-01

Author

Cicekli, Ilyas
Çiçekli, Fehime Nihan

Metadata

Show full item record

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

Item Usage Stats

106
views

0
downloads

The least general generalization (LGG) of strings may cause an over-generalization in the generalization process of the clauses of predicates with string arguments. We propose a specific generalization (SG) for strings to reduce over-generalization. SGs of strings are used in the generalization of a set of strings representing the arguments of a set of positive examples of a predicate with string arguments. In order to create a SG of two strings, first, a unique match sequence between these strings is found. A unique match sequence of two strings consists of similarities and differences to represent similar parts and differing parts between those strings. The differences in the unique match sequence are replaced to create a SG of those strings. In the generalization process, a coverage algorithm based on SGs of strings or learning heuristics based on match sequences are used.

Subject Keywords

Artificial Intelligence

URI

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

Journal

APPLIED INTELLIGENCE

DOI

https://doi.org/10.1007/s10489-006-8864-1

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

LinGraph: a graph-based automated planner for concurrent task planning based on linear logic Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01) In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
AN EFFICIENT DATABASE TRANSITIVE CLOSURE ALGORITHM Toroslu, İsmail Hakkı; HENSCHEN, L (Springer Science and Business Media LLC, 1994-05-01) The integration of logic rules and relational databases has recently emerged as an important technique for developing knowledge management systems. An important class of logic rules utilized by these systems is the so-called transitive closure rules, the processing of which requires the computation of the transitive closure of database relations referenced by these rules. This article presents a new algorithm suitable for computing the transitive closure of very large database relations. This algorithm proc...
Improving reinforcement learning by using sequence trees Girgin, Sertan; Polat, Faruk; Alhajj, Reda (Springer Science and Business Media LLC, 2010-12-01) This paper proposes a novel approach to discover options in the form of stochastic conditionally terminating sequences; it shows how such sequences can be integrated into the reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure during the learning process. The constructed tree facilitates the process of identifying frequently used action sequences together with states that are visit...
A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations Sozat, MI; Yazıcı, Adnan (Elsevier BV, 2001-01-15) This paper first introduces the formal definitions of fuzzy functional and multivalued dependencies which are given on the basis of the conformance values presented here. Second, the inference rules are listed after both fuzzy functional and multivalued dependencies are shown to be consistent, that is, they reduce to those of the classic functional and multivalued dependencies when crisp attributes are involved. Finally, the inference rules presented here are shown to be sound and complete for the family of...
Multi-objective multi-item fixed-charge solid transportation problem under twofold uncertainty Roy, Sankar Kumar; Midya, Sudipta; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2019-12-01) In this paper, we investigate a multi-objective multi-item fixed-charge solid transportation problem (MOMIFCSTP) with fuzzy-rough variables as coefficients of the objective functions and of the constraints. The main focus of the paper is to analyze MOMIFCSTP under a fuzzy-rough environment for a transporting system. In practical situations, the parameters of a MOMIFCSTP are imprecise in nature, due to several uncontrollable factors. For these reasons, we introduce the fuzzy-rough variables in MOMIFCSTP to t...

Citation Formats

I. Cicekli and F. N. Çiçekli, “Generalizing predicates with string arguments,” APPLIED INTELLIGENCE, pp. 23–36, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62470.