We propose a simple compositional program logic for an imperative extension of call-by-value PCF, built on Hoare logic and our preceding work on program logics for pure higher-order functions. A systematic use of name...
详细信息
We propose a simple compositional program logic for an imperative extension of call-by-value PCF, built on Hoare logic and our preceding work on program logics for pure higher-order functions. A systematic use of names and operations on them allows precise and general description of complex higher-order imperative behaviour. The logic offers a foundation for general treatment of aliasing and local state on its basis, with minimal extensions. After establishing soundness, we prove that valid assertions for programs completely characterise their behaviour up to observational congruence, which is proved using a variant of finite canonical forms. The use of the logic is illustrated through reasoning examples which are hard to assert and infer using existing program logics.
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The methodology is applied to information ...
详细信息
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The methodology is applied to information extraction from real-world HTML page sets that represent product information sheets, an important task in product data integration. The methodology addresses the problems of defining information extraction rules in the form of logic wrappers and mapping the task of learning these rules to general purpose first-order inductive learning.
This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, ...
详细信息
This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, it adopts the s-semantics approach, whose aim is to find notions of models which really capture the operational semantics. And it defines the program equivalence based on multiset answer constraint. Then it investigates the game semantics and proves that it is consistent with traditional operational semantics. On the basis of these two semantics, programmers can comprehend the programs deeply and develop more sound parallel constraint logic programming systems. Finally, it gives the conclusions and future work.
In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intui...
详细信息
In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intuitionistic logics. This kind of logic programming is particularly useful for data integration with possibly incomplete and inconsistent information. We define an ontological encapsulation of the epistemic many-valued logic programs with negation, based on this bilattice, into 2-valued meta logic programs. Obtained 2-valued logic semantically reflects original epistemic many-valued logic, and can be used in order to define many-valued logic entailment and inference closure for many-valued truth assignments.
This work presents constraint programming (CP) approach applied to determine deadlock-free schedules in concurrent production processes. The rules of resource conflict resolution have been expressed by means of a set ...
详细信息
This work presents constraint programming (CP) approach applied to determine deadlock-free schedules in concurrent production processes. The rules of resource conflict resolution have been expressed by means of a set of predicates, which define constraints for the problem decisive variables. Predicate model has been defined in time and event domains and implemented in procedures of propagating and distributing the variable values. The predicates define sufficient conditions for existence of deadlock-free schedules of operations, which meet the prescribed qualitative and quantitative constraints
A one transistor DRAM cell realized on bulk substrate (lT-Bulk) with CMOS 90nm platform is presented for the first time. The device fabrication is fully compatible with logic process integration and includes only few ...
详细信息
A one transistor DRAM cell realized on bulk substrate (lT-Bulk) with CMOS 90nm platform is presented for the first time. The device fabrication is fully compatible with logic process integration and includes only few additional steps, thus making this IT cell very attractive for low-cost embedded memories. Very scaled devices were fabricated with a gate length down to 80nm and several gate oxide thicknesses: their performances in terms of memory effect amplitude, retention time and disturb margins are very promising for future high density eDRAM.
This article presents an approach to solve the typing problem using algorithms for set covering. Two algorithms to solve this problem were designed and compared. The typing problem consists of distinguishing all seque...
详细信息
This article presents an approach to solve the typing problem using algorithms for set covering. Two algorithms to solve this problem were designed and compared. The typing problem consists of distinguishing all sequences using the least possible reagents. For each reagent, their capacity to distinguish between pairs of sequences is represented in a matrix and-then mapped to the set-covering problem. In (J. Lozano Yecora, MS Thesis. Uni. de las Americas, Puebla, Dept. of Comp. Science, 2004), a proof of the equivalence of this problem with the set covering problem is presented; here, the results of an exact algorithm to solve the set-covering problem are presented. This algorithm uses a branch and bound method based on some intuitive properties of the solution, applying recursion as the final resource. Two approximation algorithms were also implemented and tested. One is an improved greedy algorithm and the other is based on dynamic programming. Real as well as randomly created instances were used to test the algorithms.
This paper proposes agent-based formulation of a Supply Chain Management (SCM) system for manufacturing firms. We model each firm as an intelligent agent, which communicates each other through the blackboard architect...
详细信息
Complex automatic systems require high level discrete event control and low-level implementation. To date in industry, programmable logic controllers dominate the application domain. Detailed analysis of the system wi...
详细信息
Complex automatic systems require high level discrete event control and low-level implementation. To date in industry, programmable logic controllers dominate the application domain. Detailed analysis of the system with discrete event controller (PLC) is not readily available. A methodology of converting the LLD (PLC programming) into a Petri net is developed in this paper. The developed Petri net model captures the dynamics of the system and analyzes the qualitative and quantitative aspects of the system. One of the modeling tools of Petri net namely visual object net is used in this paper for simulation. It provides graphical, mathematical and visual modeling support.
As more health-care providers invest on computerised medical records, more clinical data is made accessible, and more clinical insights will become reliable. As data collection technologies advance, a plethora of data...
详细信息
As more health-care providers invest on computerised medical records, more clinical data is made accessible, and more clinical insights will become reliable. As data collection technologies advance, a plethora of data is available in almost all domains of one's life, being of particular interest to this work that of medicine. An area of particular interest is that of medical diagnosis based systems for computer tomography.
暂无评论