We present a system (ASP − PROLOG) which provides a tight and well-defined integration of Prolog and Answer Set programming (ASP). The combined system enhances the expressive power of ASP, allowing us to write program...
详细信息
This paper presents a functional program transformation that removes intermediate data structures in compositions of two members of a class of recursive functions with accumulating parameters. To avoid multiple traver...
详细信息
This paper presents a functional program transformation that removes intermediate data structures in compositions of two members of a class of recursive functions with accumulating parameters. To avoid multiple traversals of the input data structure, the composition algorithm produces circular programs that make essential use of lazy evaluation and local recursion. The resulting programs are simplified using a post-processing phase sketched in the paper. The presented transformation, called lazy composition, is compared with related transformation techniques both on a qualitative level and based on runtime measurements. An alternative use of higher-orderedness instead of circularity is also briefly explored.
In this paper, an algorithm to generate disjoint cubes representation of a multiple-valued logic function is presented. The algorithm converts an array of non-disjoint multiple-valued cubes to an array of disjoint mul...
详细信息
In this paper, an algorithm to generate disjoint cubes representation of a multiple-valued logic function is presented. The algorithm converts an array of non-disjoint multiple-valued cubes to an array of disjoint multiple-valued cubes by applying different multiple-valued cube calculus operations. Efforts to reduce the calculation time and the number of resulting disjoint cubes have been integrated into the presented algorithm. Experimental results of the algorithm for several test files are also shown.
Guarino and Welty have developed the notion of identity condition (IC) as a subsumption constraint of ontological analysis, that is, IC must be inherited or carried among sorts, In practical cases, a sort is often reg...
详细信息
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search heuristic. The use of such clauses has be...
详细信息
The Arithmetic-logic-Unit (ALU) is at the heart of a modern microprocessor, and its size and speed are often significant contributors to the overall processor's cost and performance. This paper presents the design...
详细信息
The Arithmetic-logic-Unit (ALU) is at the heart of a modern microprocessor, and its size and speed are often significant contributors to the overall processor's cost and performance. This paper presents the design of the ALU used in Altera's NIOS 2.0 soft processor implemented on Altera's Apex 20KE FPGA architecture. This ALU enabled the 32-bit NIOS 2.0 to consume only 1200 LEs and run at 85MHz. This is a 50% size reduction and 70% speed improvement over its predecessor, NIOS 1.1. The logic-element (LE) is the basic building block within the Apex architecture. Making full use of the advanced features of the LE has resulted in this novel ALU design. A functional representation of the logic is used to describe how the ALU performs the core set of NIOS instructions, and an LE representation shows the amount of logic-resources needed for the implementation. The cost of additional features such as a barrel-shifter and custom instructions is also described. Likely worst-case delays for different routing and logic elements are used to estimate the ALU's speed. Further speed and size optimizations are also presented from which it is possible to create ALU ranging in speed from 87 MHz to over 100 MHz.
The two predominant program specialization techniques, partial evaluation and staged programming, take opposite approaches to automating binding-time analysis (BTA). Despite their common goal, there are no systems int...
详细信息
ISBN:
(纸本)354021299X
The two predominant program specialization techniques, partial evaluation and staged programming, take opposite approaches to automating binding-time analysis (BTA). Despite their common goal, there are no systems integrating both methods. Programmers must choose between the precision of manually placing staging annotations and the convenience of automating such annotation. We present an automatic BTA algorithm for a subset of MetaML. Such an algorithm provides a basis for a system integrating staged programming and partial evaluation because it allows programmers to switch between automatic and manual staging. Our algorithm is based on typing algorithm coupled with arithmetic-constraint solving. The algorithm decorates each subexpression of both a program and its type with numeric variables representing staging-an notations and then generates simple arithmetic constraints that describe the space of all possible stagings of the original program. Benefits of our approach include expressive BTA specifications in the form of stage-annotated types as well as support for polyvariance.
In answer set programming, programs often contain auxiliary atoms, "defined" in terms of atoms introduced earlier. To prove that the answer sets of a program containing definitions correspond to the solution...
详细信息
A non-deterministic program is a program that may have more than one possible computation for a single input. It terminates with respect to a given set of inputs if and only if each possible computation of the program...
详细信息
ISBN:
(纸本)1932415343
A non-deterministic program is a program that may have more than one possible computation for a single input. It terminates with respect to a given set of inputs if and only if each possible computation of the program for each input in the set is of finite length. The purpose of this paper is to investigate termination of non-deterministic programs in the Equivalent Transformation (ET) model, where programs consist of ET rules, each of which is applied to transform a set of definite clauses into another one. Termination of a sample program is discussed, based on a concept of substantial length on stem terms in body atoms of definite clauses.
We give a many-one reduction of the set of true II20 sentences to the set of consequences of the lambda calculus with the omega rule. This solves in the affirmative a well known problem of H. Barendregt. The technique...
详细信息
We give a many-one reduction of the set of true II20 sentences to the set of consequences of the lambda calculus with the omega rule. This solves in the affirmative a well known problem of H. Barendregt. The technique of proof has interest in itself and can be extended to prove that the theory which identifies all unsolvable terms together with the omega rule is II11-complete which solves another long-standing conjecture of H. Barendregt.
暂无评论