Peculiarity rules are a new type of interesting rules which can be discovered by searching the relevance among peculiar data. A main task of mining peculiarity rules is the identification of peculiarity. Traditional m...
详细信息
Peculiarity rules are a new type of interesting rules which can be discovered by searching the relevance among peculiar data. A main task of mining peculiarity rules is the identification of peculiarity. Traditional methods of finding peculiar data are attribute-based approaches. This paper extends peculiarity oriented mining to relational peculiarity oriented mining. Peculiar data are identified on record level, and peculiar rules are mined and explained in a relational mining framework. The results from preliminary experiments show that relational peculiarity oriented mining is very effective.
A system for parallel proofs is proposed. This system proves the inconsistency of formulas in the disjunctive-normal-forms. The system is a meta-system of Horn clauses (meta-rules) of a meta-predicate Prov which repre...
详细信息
A system for parallel proofs is proposed. This system proves the inconsistency of formulas in the disjunctive-normal-forms. The system is a meta-system of Horn clauses (meta-rules) of a meta-predicate Prov which represents a clause. A parallelism other than or-parallelism and the reduction of proving procedures with or-parallelism are shown. The efficiency is quantitatively shown for a simple case by estimating the complexity with or-parallelism defined by the number of matching steps needed for the proof. A feature of the system is that any set of clauses can be represented as one meta-rule by using the disjunctive-normal-form. This fact shows new approaches to the parallelism and the use of lemmas. The soundness and the completeness of the system are proved.
Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N- (or "new")-quantifier, originally presented as a Hilbert-style axiom system exten...
详细信息
Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N- (or "new")-quantifier, originally presented as a Hilbert-style axiom system extending first-order logic. We present a sequent calculus for nominal logic called fresh logic, or FL, admitting cut-elimination. We use FL to provide a proof-theoretic foundation for nominal logic programming and show how to interpret FO/spl lambda//spl nabla/, another logic with a self-dual quantifier, within FL.
System and circuit design can be considered as planning problems, where resources are deployed in time and space to meet a given goal. Recent and continuing developments in the size of SAT problems and other AR proble...
详细信息
System and circuit design can be considered as planning problems, where resources are deployed in time and space to meet a given goal. Recent and continuing developments in the size of SAT problems and other AR problems that can be solved with off-the-shelf tools leads us to consider their direct use in system design. In this paper, we start to tackle the design of small hardware subsystems and the generation of glue logic between systems by asking a SAT solver to generate the programming bit stream for a fictional gate array.
This work focuses on improving network management and monitoring by the adoption of artificial intelligence techniques. In order to allow automated reasoning on networking concepts, we defined an accurate ontological ...
详细信息
This work focuses on improving network management and monitoring by the adoption of artificial intelligence techniques. In order to allow automated reasoning on networking concepts, we defined an accurate ontological model capable of describing as better as possible the networking domain. The thorough representation of the domain knowledge is used by a logical reasoner, which is an expert system capable of performing high-level management tasks.
This paper brings together two recent contributions to the area of declarative agent-oriented programming, made feasible in practice by the recent introduction of an interpreter for a BDI programming language. The wor...
详细信息
This paper brings together two recent contributions to the area of declarative agent-oriented programming, made feasible in practice by the recent introduction of an interpreter for a BDI programming language. The work on Coo-BDI has proposed an approach to plan exchange which applies to BDI agents in general. The other contribution is the introduction of special illocutionary forces for plan exchange between AgentSpeak agents. This has been implemented in Jason, an interpreter for an extended version of that language. This paper shows how the elaborate plan exchange mechanism of Coo-BDI can be used by AgentSpeak agents implemented with Jason. It also discusses an application on PDA-based multi-media presentations in museum visits for which plan exchange is relevant.
In this paper, we present a novel graph-oriented approach to architecting and modeling CORBA-based distributed applications. It provides higher-level abstractions for the architecture description of CORBA-based distri...
详细信息
ISBN:
(纸本)0769522165
In this paper, we present a novel graph-oriented approach to architecting and modeling CORBA-based distributed applications. It provides higher-level abstractions for the architecture description of CORBA-based distributed applications. In the proposed model, the software architecture of a CORBA-based distributed application is described as a logical graph separated from the programming of the constituent components of the application. It also provides more powerful support for specifying dynamism in software architecture and simplification of CORBA programming.
Programmable logic controllers (PLCs) are widely used in industry. Thus PLCs usually use the IEC 1131-3 standard programming language. The ladder diagram is the most popular language which does not require a lot of th...
详细信息
Programmable logic controllers (PLCs) are widely used in industry. Thus PLCs usually use the IEC 1131-3 standard programming language. The ladder diagram is the most popular language which does not require a lot of the steps and sequences of the operation. Therefore it is difficult to understand the program structure and developing the system. The Petri net is a graphical model that can explain the system operation easily and clearly. This paper presents the transformation structures from Petri nets to ladder diagram and possible implementation to control the process through the PLC's input and output.
Summary form only given. Conforming to the underlying memory consistency rules is a fundamental requirement for implementing shared memory systems and developing multiprocessor programs. In order to promote understand...
详细信息
Summary form only given. Conforming to the underlying memory consistency rules is a fundamental requirement for implementing shared memory systems and developing multiprocessor programs. In order to promote understanding and enable automated verification, it is highly desirable that a memory model specification be both declarative and executable. We present a specification framework called Nemos (Nonoperational yet Executable Memory Ordering Specifications), which supports precise specification and automatic execution in the same framework. We employ a uniform notation based on predicate logic to define shared memory semantics in an axiomatic as well as compositional style. We also apply constraint logic programming and SAT solving to make the axiomatic specifications executable for memory model analysis. To illustrate our approach, we formalize a collection of classical memory models, including sequential consistency, coherence, PRAM, causal consistency, and processor consistency.
Multicontext field programmable gate arrays (FPGAs) are excellent devices to use in reconfigurable computing systems for boosting performance. In addition, multicontext devices can save space compared to the conventio...
详细信息
Multicontext field programmable gate arrays (FPGAs) are excellent devices to use in reconfigurable computing systems for boosting performance. In addition, multicontext devices can save space compared to the conventional FPGAs because they store more programming data per area. However, multicontext FPGAs suffer the same long configuration delays as conventional FPGAs, and this limits performance in some situations. To solve that problem, we introduce a new FPGA called PRMC. The PRMC FPGA is an enhanced multicontext design that has partially reconfigurable contexts and additional features to reduce the configuration overhead. As a result, PRMC configures faster than present multicontext FPGAs, while enjoying the same area benefit. This paper describes the architecture of our PRMC FPGA.
暂无评论