We present a framework for the Induction of Functional Logic Programs (IFLP) from facts. This can be seen as an extension to the now consolidated field of Inductive Logic Programming (ILP). For that purpose we study the reversal of narrowing, the more usual operational mechanism for Functional Logic Programming. Also we fix the goal and heuristics in consilient programs rather than look for the...

Directional mesenchymal cell invasion in vivo is understood to be a stimulated event and to be regulated by cytokines, chemokines, and types of extracellular matrix (ECM). Instead, by focusing on the cellular response to ECM stiffness, we found that soft ECM (low stiffness) itself is sufficient to prevent stable cell-to-cell adherens junction formation, up-regulate matrix metalloproteinase (MMP...

 To achieve performance, Explicitly Parallel Instruction Computing (EPIC) systems take the responsibility of extracting instruction-level parallelism (ILP) from the hardware and give it to the compiler. They expose a large part of the hardware control at the conventional machine level. Dynamically Trace Scheduled VLIW (DTSVLIW) systems, on the other hand, leave the responsibility of extracting...

Inductive Logic Programming (ILP) systems is a set of Machine Learning techniques that have been quite successful in knowledge discovery in relational domains. These systems implemented in Prolog are among the most successfull ILP systems. They challenge the limits of Prolog systems due to heavy usage of resources, such as database accesses and memory usage, and very long execution times. In th...

• Encourage more research on learning in rich representations, such as relational representations and differential equations, which can be used for modeling a variety of real world problems. Inductive logic programming (ILP) is concerned with learning from data and domain knowledge in relational representations. ILP started off by addressing the task of learning logic programs from examples and...

Deciding c-planarity for a given clustered graph C = (G, T ) is one of the most challenging problems in current graph drawing research. Though it is yet unknown if this problem is solvable in polynomial time, latest research focused on algorithmic approaches for special classes of clustered graphs. In this paper, we introduce an approach to solve the general problem using integer linear program...

This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth nod...

This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning problem, there exist several different classes of examples; there are 77 different Thai characters. Using examples constructed from character images, ILP learns 77 rules each of which defines each character. However, so...

The intention of this study was to estimate the pharmacological advantage of a clinically applicable method of isolated liver perfusion (ILP) over hepatic artery infusion (HAI) administering various doses of 5-fluorouracil (FUra). FUra concentrations were measured using highperformance liquid chromatography in liver tissue (pigs and rats), hepatic tumor tissue (rats), and in the systemic circul...