inductiveprogramming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming this, we introduce incremental learnin...
详细信息
ISBN:
(纸本)9783642119309
inductiveprogramming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming this, we introduce incremental learning;a process in which an inductiveprogramming system automatically modifies its inductive bias towards some domain through solving a sequence of gradually more difficult problems in that domain. We demonstrate a simple form of incremental learning in which a system incorporates solution programs into its background knowledge as it progresses through a sequence of problems. Using a search-based inductive functional programming system modelled on the MagicHaskeller system of Katayama [4], we perform a set of experiments comparing the performance of inductiveprogramming with and without incremental learning. Incremental learning is shown to produce a performance improvement of at least a factor of thirty on each of the four problem sequences tested. We describe how, given some assumptions, inductiveprogramming with incremental learning can be shown to have a polynomial, rather than exponential, time complexity with respect to the size of the program to be generated. We discuss the difficulties involved in constructing suitable problem sequences for our incremental learning system, and consider what improvements can be made to overcome these difficulties.
The proceedings contain 9 papers. The topics discussed include: deriving a relationship from a single example;synthesis of functions using generic programming;inductiveprogramming: a survey of program synthesis techn...
ISBN:
(纸本)3642119301
The proceedings contain 9 papers. The topics discussed include: deriving a relationship from a single example;synthesis of functions using generic programming;inductiveprogramming: a survey of program synthesis techniques;incremental learning in inductiveprogramming;enumerating well-typed terms generically;generalisation operators for lists embedded in a metric space;porting IGORII from MAUDE to HASKELL;automated method induction: functional goes object oriented;and recent improvements of MagicHaskeller.
In some application areas, similarities and distances are used to calculate how similar two objects are in order to use these measurements to find related objects, to cluster a set of objects, to make classifications ...
详细信息
ISBN:
(纸本)9783642119309
In some application areas, similarities and distances are used to calculate how similar two objects are in order to use these measurements to find related objects, to cluster a set of objects, to make classifications or to perform an approximate search guided by the distance. In many other application areas, we require patterns to describe similarities in the data. These patterns are usually constructed through generalisation (or specialisation) operators. For every data structure, we can define distances. In fact, we may find different distances for sets, lists, atoms, numbers, ontologies, web pages, etc. We can also define pattern languages and use generalisation operators over them. However, for many data structures, distances and generalisation operators are not consistent. For instance, for lists (or sequences), edit distances are not consistent with regular languages, since, for a regular pattern such as *a, the covered set of lists might be far away in terms of the edit distance (e.g. bbbbbba and aa). In this paper we investigate the way in which, given a pattern language, we can define a pair of generalisation operator and distance which are consistent. We define the notion of (minimal) distance-based generalisation operators for lists. We illustrate positive results with two different pattern languages.
In this paper we consider an extension of Logic programming that tackles the SemanticWeb challenge of acquiring rules combined with ontologies. To face this bottleneck problem we propose a framework that resorts to th...
详细信息
This paper describes the problems with debugging tools for answer set programming, a declarative programming paradigm. Current approaches are difficult to use on most applications due to the considerable bottlenecks i...
详细信息
This paper describes the problems with debugging tools for answer set programming, a declarative programming paradigm. Current approaches are difficult to use on most applications due to the considerable bottlenecks in communicating the reasons to the user. In this paper we examine the reasons for this and suggest some possible future directions.
Fuzzy analytic hierarchy process (AHP) has been widely used for a variety of applications such as supplier selection, customer requirements assessment and the like. The vast majority of the applications, however, were...
详细信息
Fuzzy analytic hierarchy process (AHP) has been widely used for a variety of applications such as supplier selection, customer requirements assessment and the like. The vast majority of the applications, however, were found avoiding the use of sophisticated approaches for fuzzy AHP such as fuzzy least squares method while using a simple extent analysis for the sake of simplicity. The extent analysis proves to be incorrect and may lead to a wrong decision being made. This paper proposes a sound yet simple priority method for fuzzy AHP which utilizes a linear goal programming (LGP) model to derive normalized fuzzy weights for fuzzy pairwise comparison matrices. The proposed LGP priority method is tested with three numerical examples including an application of fuzzy AHP to new product development (NDP) project screening decision making. (C) 2008 Elsevier Inc. All rights reserved.
Within the Unifying Theories of programming framework, program initiation and termination has been modelled by introducing a pair of variables in order to satisfy the required algebraic properties. We replace these va...
详细信息
The idea of polytypic programming is to write programs that are defined by induction on the structure of user-defined datatypes. In this way, many functions with similar functionalities do not have to be written over ...
详细信息
This paper presents the RTR Model, which allows a flexible programming of real-time applications in open distributed systems. The RTR model approach is based on object-orientation and reflective computation. Using thi...
详细信息
ISBN:
(纸本)0818680474
This paper presents the RTR Model, which allows a flexible programming of real-time applications in open distributed systems. The RTR model approach is based on object-orientation and reflective computation. Using this approach, real-time constraints can be easily expressed and implemented. interoperability among distributed heterogeneous components is provided adapting the RTR model to the CORBA architecture. Also, this paper introduces the Java/RTR language, an extension of Java (Sun Microsystems Inc.), that incorporates concepts of the RTR model. Finally the main features of the proposed model are compared with other well-known approaches for real-time programming.
Reasoning about the timing properties of a program is indispensable in the development of time critical systems where failure to meet deadlines can result in loss of life or material. To this end having tools to calcu...
详细信息
Reasoning about the timing properties of a program is indispensable in the development of time critical systems where failure to meet deadlines can result in loss of life or material. To this end having tools to calculate safe and tight Worst Case Execution Time (WCET) bounds can be very valuable. In most of the approaches to date a lot of pessimism is attributed to the fact that many paths that are infeasible are not excluded from the WCET computations. To remedy this, user annotations to the source code were proposed and used. Unfortunately, there is no guarantee that these annotations are always correct. This fact renders such a manual approach unacceptable in the case of R/T systems where safety is an absolute priority. In this paper another approach for the safe elimination of infeasible execution paths is presented. This method is based on the R/T programming language SIGNAL and its internal Dynamic Graph representation.
暂无评论