Answer Set programming (ASP) is a declarative programming paradigm with roots in logicprogramming, knowledge representation, and non-monotonic reasoning. the ASP competition series aims at assessing and promoting the...
详细信息
ISBN:
(纸本)9781577357605
Answer Set programming (ASP) is a declarative programming paradigm with roots in logicprogramming, knowledge representation, and non-monotonic reasoning. the ASP competition series aims at assessing and promoting the evolution of ASP systems and applications. Its growing range of challenging application-oriented benchmarks inspires and showcases continuous advancements of the state of the art in ASP.
In this work, we present a radix-16 multi-format multiplier to multiply 64-bit unsigned integer operands, double-precision and single-precision operands. the multiplier is sectioned in two lanes such that two single-p...
详细信息
ISBN:
(纸本)9781538640340
In this work, we present a radix-16 multi-format multiplier to multiply 64-bit unsigned integer operands, double-precision and single-precision operands. the multiplier is sectioned in two lanes such that two single-precision multiplications can be computed in parallel. Radix-16 is chosen for the reduced number of partial products and the resulting power savings. the experimental results show that high power efficiency is obtained by issuing two single-precision multiplications per cycle. Moreover, by converting the double-precision numbers which fit to single-precision, further energy can be saved.
Recent progress in logicprogramming, particularly answer set programming, has enabled us to teach it to undergraduate and high school students. We developed an online answer set programming environment with simple in...
详细信息
ISBN:
(纸本)9781577357605
Recent progress in logicprogramming, particularly answer set programming, has enabled us to teach it to undergraduate and high school students. We developed an online answer set programming environment with simple interface and self contained file system. It is expected to make the teaching of answer set programming more effective and help us to reach more students.
Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can...
详细信息
Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or "emulated") by a cascade product of very simple automata. this led to an elegant algebraic theory of automata based on finite semigroups (Krohn-Rhodes theory). Surprisingly, by relating logic programs and automata, we can show in this paper that the Krohn-Rhodes theory is applicable in Answer Set programming (ASP). More precisely, we recast the concept of a cascade product to ASP, and prove that every program can be represented by a product of very simple programs, the reset and standard programs. Roughly, this implies that the reset and standard programs are the basic building blocks of ASP with respect to the cascade product. In a broader sense, this paper is a first step towards an algebraic theory of products and networks of nonmonotonic reasoning systems based on Krohn-Rhodes theory, aiming at important open issues in ASP and AI in general.
In this position paper, we present certain observed characteristics of global software development for the enterprise, as well as trends in enterprise information technology needs for a global enterprise. We then iden...
详细信息
ISBN:
(纸本)0769526551
In this position paper, we present certain observed characteristics of global software development for the enterprise, as well as trends in enterprise information technology needs for a global enterprise. We then identify IT workforce needs and the consequent curriculum elements desired.
the study of gene networks allows us to better understand some biological processes such as the adaptation of the organism to a disturbance of the environment. In a discrete modelling framework of gene networks, it ha...
详细信息
ISBN:
(纸本)9781538674499
the study of gene networks allows us to better understand some biological processes such as the adaptation of the organism to a disturbance of the environment. In a discrete modelling framework of gene networks, it has been shown that the Hoare logic can help the modeller to identify the parameters of the model, so that the latter exhibits the observed biological traces. In this paper we present a hybrid modelling of gene networks which pays particular attention to the time spent in each state and we introduce an extension of the Hoare logic in this hybrid framework. the weakest precondition calculus associated withthis modified Hoare logic makes it possible to determine the minimal constraints on the dynamic parameters of a gene network from an observed biological trace. these constraints form a continuous CSP that can be solved using the AbSolute continuous solver. the first experimental results show that the obtained solutions are in agreement withthe specification of the Hoare triple coming from biological expertise.
Design and implementation of a PEM fuel cell controller presented. the intelligent controller design is based on a neuro-fuzzy algorithm. the implemented system has successfully controlled the air mass flow rates of t...
详细信息
ISBN:
(纸本)9781509055388
Design and implementation of a PEM fuel cell controller presented. the intelligent controller design is based on a neuro-fuzzy algorithm. the implemented system has successfully controlled the air mass flow rates of the fuel cell stack using labview programming. the real-time data shows the effectiveness of the proposed smart controller algorithm.
Heap management is responsible for the allocation of heap segments to a running application. When the logic of the heap management is left to the application programmer, as it is the case withprogramming languages li...
详细信息
ISBN:
(纸本)0769521991
Heap management is responsible for the allocation of heap segments to a running application. When the logic of the heap management is left to the application programmer, as it is the case withprogramming languages like C and C++, a number of problems may arise. One kind of problems related to imperfect heap management is that of memory leaks, which happen when heap segments become inaccessible before they are deallocated. Closely related to that problem, from the standpoint of programmer's operations, is the problem of corrupted heap due to redundant attempts to deallocate the same heap segment that has been previously allocated. this paper present a method for detecting such flaws in heap management. Our method is based on traces collected during the execution of an application and their off-line analysis in order to determine the presence of memory leaks and redundant deallocations of the same heap segment. When our method is applied to component-based embedded software, it allows to locate the component that had allocated heap memory and did not deallocate it before exiting, as well as the components that are responsible for the redundant deallocation of heap segments.
Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. the same idea can be naturally used to memorize visited states during search for planning. In this paper we ...
详细信息
Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. the same idea can be naturally used to memorize visited states during search for planning. In this paper we present a planner developed in the Picat language to solve the Petrobras planning problem. Picat is a novel Prolog-like language that provides pattern matching, deterministic and non-deterministic rules, and tabling as its core modelling and solving features. We demonstrate these capabilities using the Petrobras problem, where the goal is to plan transport of cargo items from ports to platforms using vessels with limited capacity. Monte Carlo Tree Search has been so far the best technique to tackle this problem and we will show that by using tabling we can achieve much better runtime efficiency and better plan quality.
Digital magnitude comparators are used in digital systems to compare two binary numbers and to determine if the numbers are equal, or if one number is greater or less than the other. In this work the design of magnitu...
详细信息
ISBN:
(数字)9781665490054
ISBN:
(纸本)9781665490054
Digital magnitude comparators are used in digital systems to compare two binary numbers and to determine if the numbers are equal, or if one number is greater or less than the other. In this work the design of magnitude comparators in dynamic logic is examined Two dynamic logic magnitude comparator designs are proposed and compared One of these designs exploits an existing simplification, while the other is a totally new one. the new dynamic logic comparator design compared over the one based on the existing simplification, shows less hardware complexity, consumes less power and has lower power delay-product, for typical operand widths.
暂无评论