Modern digital circuits consist of logic gates implemented in the complementary metal oxide semiconductor (CMOS) technology. the time taken for a logic gate output to change after one or more inputs have changed is ca...
详细信息
Modern digital circuits consist of logic gates implemented in the complementary metal oxide semiconductor (CMOS) technology. the time taken for a logic gate output to change after one or more inputs have changed is called the delay of the gate. A conventional CMOS gate is designed to have the same input to output delay irrespective of which input caused the output to change. We propose a new gate design that has different delays along various inputs to output paths within the gate. this is accomplished by inserting selectively sized "permanently on" series transistors at the inputs of the logic gate. We demonstrate the use of the variable input delay CMOS gates for a totally glitch-free minimum dynamic power implementation of a digital circuit. Applying a previously described linear programming method to the c7552 benchmark circuit, we obtained a power saving of 58% over an un-optimized design. this power consumption was 18% lower than that for an alternative low power design using conventional CMOS gates. All circuits had the same overall delay. Since the overall delay was not allowed to increase, the glitch elimination with conventional gates required insertion of delay buffers on non-critical paths. the use of the variable input delay gates drastically reduced the required number of delay buffers.
ILP systems have been largely applied to datamining classification tasks with a considerable success. the use of ILP systems in regression tasks has been far less successful. Current systems have very limited numerica...
详细信息
ISBN:
(纸本)0769521428
ILP systems have been largely applied to datamining classification tasks with a considerable success. the use of ILP systems in regression tasks has been far less successful. Current systems have very limited numerical reasoning capabilities, which limits the application of ILP to discovery of functional relationships of numeric nature. this paper proposes improvements in numerical reasoning capabilities of ILP systems for dealing with regression tasks. It proposes the use of statistical-based techniques like Model Validation and Model Selection to improve noise handling and it introduces a new search stopping criterium based on the PAC method to evaluate learning performance. We have found these extensions essential to improve on results over machine learning and statistical-based algorithms used in the empirical evaluation study.
In their Unifying theories of programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key...
详细信息
ISBN:
(纸本)3540213775
In their Unifying theories of programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key concept in their programme is the design: the familiar precondition-postcondition pair that describes the contract between a programmer and a client. We give a tutorial introduction to the theory of alphabetised relations, and its sub-theory of designs. We illustrate the ideas by applying them to theories of imperative programming, including Hoare logic, weakest preconditions, and the refinement calculus.
We have developed an annotated logic program called an EVALPSN(Extended Vector Annotated logic Program with Strong Negation), which can deal with defeasible deontic reasoning and some kinds of contradiction, and appli...
详细信息
ISBN:
(纸本)3540221174
We have developed an annotated logic program called an EVALPSN(Extended Vector Annotated logic Program with Strong Negation), which can deal with defeasible deontic reasoning and some kinds of contradiction, and applied EVALPSN to automatic safety verification, traffic signal control, robot action control, etc.. Generally, discrete event control can be represented as deontic rules such as it is forbidden for boththe cat and mouse to occupy the same room simultaneously, and must deal with contradiction to avoid unexpected system states. We show that such discrete event control can be easily formalized in EVALPSN. In this paper, we introduce the application of EVALPSN to discrete event control with taking a famous example Cat and Mouse.
the proceedings contain 28 papers. the special focus in this conference is on Integrated Formal Methods. the topics include: Design verification for control engineering;integrating model checking and theorem proving i...
ISBN:
(纸本)9783540247562
the proceedings contain 28 papers. the special focus in this conference is on Integrated Formal Methods. the topics include: Design verification for control engineering;integrating model checking and theorem proving in a reflective functional language;a tutorial introduction to designs in unifying theories of programming;an integration of program analysis and automated theorem proving;verifying controlled components;efficient CSPz data abstraction;state/event-based software model checking;formalising behaviour trees with CSP;generating MSCs from an integrated formal specification language;formal verification of object-oriented models;software verification with integrated data type refinement for integer arithmetic;constituent elements of a correctness-preserving UML design approach;relating data independent trace checks in CSP with UNITY reachability under a normality assumption;object-oriented modelling with high-level modular petri nets;specification and verification of synchronizing concurrent objects;understanding object-z operations as generalised substitutions;embeddings of hybrid automata in process algebra;a many-valued logic with imperative semantics for incremental specification of timed models;integration of specification languages using viewpoints;integrating formal methods by unifying abstractions;using UML sequence diagrams as the basis for a formal test description language;viewpoint-based testing of concurrent components and a method for compiling and executing expressive assertions.
An algebraic variant of multi-context logic is considered as an alternative to existing logical accounts of fictional discourse. An associative and idempotent operator on reified fictions supercedes Woods' olim mo...
详细信息
ISBN:
(纸本)3540403809
An algebraic variant of multi-context logic is considered as an alternative to existing logical accounts of fictional discourse. An associative and idempotent operator on reified fictions supercedes Woods' olim modality. Soundness and completeness results are obtained for certain inter-fictional deductive rules relative to semantical conditions which respect the 'authorial say-so' criterion of fictional truth.
In this paper we present a logic formalization of a model which allows us to represent, create and maintain a Learner Model for CSCL environments in a clear and adequate manner, in order to use it as the set of belief...
详细信息
ISBN:
(纸本)0769519156
In this paper we present a logic formalization of a model which allows us to represent, create and maintain a Learner Model for CSCL environments in a clear and adequate manner, in order to use it as the set of beliefs an agent holds about its user, supporting the effective collaboration between the learners in the community. Our model includes a representation method for the knowledge domain and the agent's beliefs about the learner, as well as an inference system. this system allows the agent to propose the learner adequate learning tasks, considering his own interest and possibilities and those of the other members of the community through the establishment of group-based Zones of Proximal Development. the model is formalized in Answer Sets programming, which gives an appropriate framework for dealing with non-monotonicity in disjunctive logic programs with negation.
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts ar...
详细信息
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework for dealing with observability. then we develop in a completely analogous way the constructor-based logic institution which formalizes a novel treatment of reachability. Both institutions are tailored to capture the semantically correct realizations of a specification from either the observational or the reachability point of view. We show that there is a methodological and even formal duality between both frameworks. In particular, we establish a correspondence between observer operations and datatype constructors, observational and constructor-based algebras, fully abstract and reachable algebras, and observational and inductive consequences of specifications. the formal duality between the observability and reachability concepts is established in a category-theoretic setting. (C) 2002 Elsevier Science B.V. All rights reserved.
In this paper we will discuss the context management features of the new logicprogramming language DALI, aimed at defining agents and multi-agent systems. In particular, a DALI agent, which is capable of reactive and...
详细信息
ISBN:
(纸本)3540403809
In this paper we will discuss the context management features of the new logicprogramming language DALI, aimed at defining agents and multi-agent systems. In particular, a DALI agent, which is capable of reactive and proactive behaviour, builds step-by-step her context. Context update is modelled by the novel concept of "evolutionary semantics", where each context manipulation is interpreted as a program transformation step. We show that this kind of context-based agent language is well-suited for representing many significant commonsense reasoning examples.
We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We ...
详细信息
暂无评论