Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction stra...
详细信息
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outermost-fair-like strategy that is allowed to be unfair to some redex of a term when contracting the redex is useless for the normalization of the term. Unlike the strategy of Kennaway, our strategy does not rely on syntactic restrictions that imply confluence. On the contrary, it can easily be applied to any term rewriting system, and we show that the class of term rewriting systems for which our strategy is normalizing properly includes all (almost) orthogonal systems. Our strategy is more versatile;in case of (almost) orthogonal term rewriting systems, it can be used to detect certain cases of non-termination, Our normalization proof is more accessible than Kennaway's. We also show that our sequential strategy sometimes succeeds where the parallel-outermost strategy fails.
the proceedings contains 18 papers. Topics discussed include simulation models of short rotation forestry, willow wood properties, production and economy, poplar cultivation, seasonal amount, growth and depth distribu...
详细信息
the proceedings contains 18 papers. Topics discussed include simulation models of short rotation forestry, willow wood properties, production and economy, poplar cultivation, seasonal amount, growth and depth distribution of roots, demographic studies of canopy development, biomass fuel, and coppice culture.
In this paper, we propose a three-valued completion semantics for abductive logic programs, which solves some problems associated withthe Console et al. two-valued completion semantics. the semantics is a generalizat...
详细信息
ISBN:
(纸本)9783540584315
In this paper, we propose a three-valued completion semantics for abductive logic programs, which solves some problems associated withthe Console et al. two-valued completion semantics. the semantics is a generalization of Kunen's completion semantics for general logic programs, which is known to correspond very well to a class of effective proof procedures for general logic programs. Secondly, we propose a proof procedure for abductive logic programs, which is a generalization of a proof procedure for general logic programs based on constructive negation. this proof procedure is sound and complete with respect to the proposed semantics. By generalizing a number of results on general logic programs to the class of abductive logic programs, we present further evidence for the idea that limited forms of abduction can be added quite naturally to general logic programs.
Fleet operators have begun to explore the use of decision support systems for their decision making processes. Decision support systems could reduce the difficulties of decision making through the assessment of more s...
详细信息
Fleet operators have begun to explore the use of decision support systems for their decision making processes. Decision support systems could reduce the difficulties of decision making through the assessment of more solutions, an automatic evaluation of solutions, a reactivity improvement and reduce the company dependency on operators competencies. A comparative analysis between the needs and the actual system is performed. Constraint logicprogramming contribution for fleet management systems is also assessed.
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint logic programs, emphasizing the visual style of formulation. A ...
详细信息
this article describes BOOM, an object-oriented fourth-generation system. BOOM supports the powerful and elegant development of information systems in an object-oriented manner. By using object-oriented techniques, th...
详细信息
this article describes BOOM, an object-oriented fourth-generation system. BOOM supports the powerful and elegant development of information systems in an object-oriented manner. By using object-oriented techniques, the complexities in building information systems can be handled more easily, and the development process in general can be improved and revived. BOOM decouples development from the physical environment. BOOM developers build a logical object-oriented data model that, after development, is automatically transferred into a relational database system. the toolset supplied for the construction of information systems includes components for the definition of structural object-oriented data models,for the generation of user interfaces, and the arrangement of application logic. Generic operations for manipulating user-defined objects are provided for every BOOM application. BOOM objects are stored in a relational database and are dynamically loaded on demand. Further, how the object model is transformed to relational tables is illustrated.
A system for controlling the traffic lights in an urban network is described. the system consists of a control unit that governs the traffic lights at a single intersection. the behavior of each control unit is govern...
详细信息
A system for controlling the traffic lights in an urban network is described. the system consists of a control unit that governs the traffic lights at a single intersection. the behavior of each control unit is governed by a logic program. the decision process of each control unit is independent from other control units, and is based on the traffic conditions of the streets that converge in the intersection. A developing system called FasTraC (Fast Traffic Control) has been created to provide the designer with a powerful tool to develop and maintain the control units of the decentralized control system.
We present an axiomatic approach to meaninglessness in finite and trąnsfinite term rewriting and lambda calculus. We justify our axioms in two ways. First, they are shown to imply important properties of meaninglessne...
详细信息
Random numbers are needed in a variety of applications, yet finding good random number generators is a difficult task. In the last decade cellular automata (CA) have been used to generate random numbers. In this paper...
详细信息
We prove a version of the Standardization theorem and the Discrete Normalization theorem in stable Deterministic Residual Structures, Abstract Reduction Systems with axiomatized notions of residual, which model orthog...
详细信息
暂无评论