An algorithm based on Ant Colony System for solving Traveling Salesman Problem is proposed. the new algorithm, introduces in Ant Colony System an inner loop aiming to update the pheromone trails. the update increases ...
详细信息
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to use computational methods of answer set...
详细信息
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. the tool, integrated in the system TOY, can be used to navigate a computation tree corresponding to some errone...
详细信息
ISBN:
(纸本)354021402X
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. the tool, integrated in the system TOY, can be used to navigate a computation tree corresponding to some erroneous computation. During the navigation the users can either follow a fixed strategy or move freely providing information about the validity of the nodes as they like. We show by means of examples how this flexibility can reduce boththe number and the complexity of the questions that the user must consider w.r.t. the usual top-down navigation strategy. Moreover, the tool includes some extra features that can be used to automatically simplify the computation trees.
We have been studying abstractions of linked structures, in which cells are connected by pointers, using temporal logic. this paper presents some our results for these abstractions. the system to be verified is a tran...
详细信息
ISBN:
(纸本)354021402X
We have been studying abstractions of linked structures, in which cells are connected by pointers, using temporal logic. this paper presents some our results for these abstractions. the system to be verified is a transition system on a graph. the shape of the graph does not change as a result of the transition, but the label assigned to each cell (node) changes according to rewrite rules. the labels of cells are changed synchronously or asynchronously. We abstract such systems using abstract cells and abstract graphs. Abstract cells are characterized by a set of temporal formulas, and different abstractions can be tried by changing the set of formulas. Some examples of analysis are also described.
this paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. the partial evaluator is shown to achieve non-trivial specialisation and be effectively self-applied. the attempts to s...
详细信息
A lightweight approach to debugging functionallogic programs by observations is presented, implemented for the language Curry. the Curry Object Observation System (COOSy) comprises a portable library plus a viewing t...
详细信息
ISBN:
(纸本)3540222537
A lightweight approach to debugging functionallogic programs by observations is presented, implemented for the language Curry. the Curry Object Observation System (COOSy) comprises a portable library plus a viewing tool. A programmer can observe data structures and functions by annotating expressions in his program. the possibly partial values of observed expressions that are computed during program execution are recorded in a trace file, including information on non-deterministic choices and logical variables. A separate viewing tool displays the trace content. COOSy covers all aspects of modern functionallogic multiparadigm languages such as lazy evaluation, higher order functions, non-deterministic search, logical variables, concurrency and constraints. Both use and implementation of COOSy are described.
Justification is the process of constructing evidence, in terms of proof, for the truth or falsity of an answer derived by tabled evaluation. the evidence is most easily constructed by post-processing the memo tables ...
详细信息
Genetic algorithms use numerous parameters in their work. Most researches investigated different selection strategies and genetic operators and their influence on schema dynamics, but only few of them tried to underst...
详细信息
Genetic algorithms use numerous parameters in their work. Most researches investigated different selection strategies and genetic operators and their influence on schema dynamics, but only few of them tried to understand deeply influence of population size and generations number limit. In this paper we will try to take a deeper look on the problem of the population size and limit of generations given for the search of the solution. this research involves investigation of GA's behavior on the different types of functions. these include functions with many optimums, functions with limits in search space (non-linear programming tasks) and NP-problem functions. Author is going to show that population size increase improves the performance of GA and affects results more than change of generations number limit.
暂无评论