The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly and computationally. This justifies t...
详细信息
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly and computationally. This justifies the increased interest both on the automatic discovery of useful knowledge from databases, and on using parallel processing for this task. Multi relational data mining (MRDM) techniques, such as inductive logic programming (ILP), can learn rides from relational databases consisting of multiple tables. However, ILP systems are designed to run in main memory and can have long running times. We propose a pipelined data-parallel algorithm for ILP. The algorithm was implemented and evaluated on a commodity PC cluster with 8 processors. The results show that our algorithm yields excellent speedups, while preserving the quality of learning
Devising algorithms for learning from multi-relational data is currently considered an important challenge. The wealth of traditional single-relational machine learning tools, on the other hand, calls for methods of &...
详细信息
Devising algorithms for learning from multi-relational data is currently considered an important challenge. The wealth of traditional single-relational machine learning tools, on the other hand, calls for methods of 'propositionalization', i.e. conversion of multi-relational data into single-relational representations. A major stream of propositionalization algorithms is based on the construction of truth-valued features (first-order logic atom conjunctions), which capture relational properties of data and play the role of binary attributes in the resulting single-table representation. Such algorithms typically use backtrack depth first search for the syntactic construction of features complying to user's mode/type declarations. As such they incur a complexity factor exponential in the maximum allowed feature size. Here we present a polynomial-runtime alternative based on an efficient reduction between the feature construction problems on the propositional satisfiability (SAT) problem, such that the latter involves only Horn clauses and is therefore efficiently solvable.
In this paper we present a flexible automatic test generation framework to detect a variety of design faults in systems with behavioral VHDL descriptions. Predefined fault models may range from the commonly used state...
详细信息
In this paper we present a flexible automatic test generation framework to detect a variety of design faults in systems with behavioral VHDL descriptions. Predefined fault models may range from the commonly used state coverage and transition coverage models to any other fault models which can be described as a set of non-linear constraints on the system's behavior. The test generation problem is formulated as a constraint logic programming problem (CLP) and an industrial CLP engine is used to solve it.
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web services or grid computing, the need for automated contract management increases according...
详细信息
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web services or grid computing, the need for automated contract management increases accordingly. In this paper we evolve a formal representation for contractual agreements together with their monitoring and enforcement by standard components of logic programming. We incorporate different logical formalisms like Horn logic, event calculus, deontic logic and ECA rules into one logical framework to execute complex contract rules on an individual or a group level together with their normative relationships (permissions, obligations and prohibitions). This logical framework supports a high level architecture for the automation of electronic contracts capable of representing complex business rules and business policies, detecting contract violations, authorisation control, conflict detection, service billing, reporting and other contract enforcement processes.
We propose a resource-based model of human-computer interaction, and discuss how WIPPOG, a rule-based language for multiset transformations, can support such a model. WIPPOG is here adopted as an enactment mechanism f...
详细信息
We propose a resource-based model of human-computer interaction, and discuss how WIPPOG, a rule-based language for multiset transformations, can support such a model. WIPPOG is here adopted as an enactment mechanism for task models expressed by a visual notation. We exploit this resource-based perspective to model some common interaction errors and suggest possible prevention and mitigation strategies.
A novel multilevel/analog electrically erasable programmable read only memory (EEPROM) cell fabricated by standard complementary metal oxide semiconductor (CMOS) logic process is presented. The cell is operated by sel...
详细信息
A novel multilevel/analog electrically erasable programmable read only memory (EEPROM) cell fabricated by standard complementary metal oxide semiconductor (CMOS) logic process is presented. The cell is operated by select-gate-controlled channel current induced drain avalanche hot hole for programming and hot electron for erasing. The self-convergent programming scheme is proposed allows this cell to be easily adopted for the multilevel or analog storage. In addition, a compact SPICE sub-circuit model of the cell has been established to facilitate cell behavior simulation with its interfacing circuits, especially for multilevel/analog nonvolatile memory applications.
The paper provides a presentation of a method of balancing the work order requirements of with given production capabilities in a planning horizon. Constraint logic programming (CLP) is an emergent software technology...
详细信息
The paper provides a presentation of a method of balancing the work order requirements of with given production capabilities in a planning horizon. Constraint logic programming (CLP) is an emergent software technology for declarative description and effective solving of combinatorial problems especially in the area of integrated production planning. In that context, the CLP can be considered as a well-suited framework for development of decision-making software supporting small and medium size enterprises in the course of production process planning. The aim of this paper is to present the CLP modeling framework as well as to illustrate its application to decision making in the case of a new production order prototyping
We propose sntcc, a stochastic extension of the ntcc calculus, a model of temporal concurrent constraint programming with the capability of modeling asynchronous and non-deterministic timed behavior. We argue that suc...
详细信息
We propose sntcc, a stochastic extension of the ntcc calculus, a model of temporal concurrent constraint programming with the capability of modeling asynchronous and non-deterministic timed behavior. We argue that such an extension is needed to faithfully model concurrent systems in real-life situations. We provide a suitable temporal logic and proof system for sntcc and illustrate how to use them for proving properties of stochastic systems. We argue that this modeling strategy of using explicit stochastic constructs within the calculus provides a "runnable specification" for a wide variety of stochastic systems that eases the task of formally reasoning about them. We give examples of specifications in sntcc and use the extended linear temporal logic for proving properties about them.
Boolean equation systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several sequential algorithms for global and local...
详细信息
Boolean equation systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several sequential algorithms for global and local BES resolution have been proposed so far, mainly in the field of verification; however, these algorithms do not scale up satisfactorily as the size of BESs increases. In this paper, we propose a distributed algorithm, called DSOLVE, which performs the local resolution of a BES using a set of machines connected by a network. Our experiments for solving large BESs using clusters of PCs show linear speedups and a scalable behaviour of DSOLVE w.r.t. its sequential counterpart.
We present an algorithm that generates automatically (algebraic) invariant properties of a loop with conditionals. In the proposed algorithm program analysis is performed in order to transform the code into a form for...
详细信息
We present an algorithm that generates automatically (algebraic) invariant properties of a loop with conditionals. In the proposed algorithm program analysis is performed in order to transform the code into a form for which algebraic and combinatorial techniques can be applied to obtain invariant properties. These invariants are then used for verifying partial correctness of imperative programs in the Theorema system (***). The application of the method is demonstrated in few examples.
暂无评论