Despite decades of efforts and successes in logic synthesis, algorithm runtime has rarely been taken as a first class objective in research. As design complexity soars and million gate designs become common, as deep s...
详细信息
ISBN:
(纸本)0780392108
Despite decades of efforts and successes in logic synthesis, algorithm runtime has rarely been taken as a first class objective in research. As design complexity soars and million gate designs become common, as deep submicron effects dominate and frequently invoking logic synthesis within a low-level physical design environment, or a high-level architectural exploration environment become mandatory, it becomes necessary to revisit the fundamental logic synthesis infrastructure and algorithms. In this paper, we demonstrate FBDD, an open sourced, Binary Decision Diagram (BDD) based logic synthesis package, which employs several new techniques, including folded logic transformations and two-variable sharing extraction. Towards the goal of scaling logic synthesis algorithms, we show that for standard benchmarks, and for field programmable gate array (FPGA) technology, FBDD can produce circuits with comparable area with commercial tools, while running one order of magnitude faster.
We present a new model-checking technique for CSP-OZ-DC, a combination of CSP, Object-Z and Duration Calculus, that allows reasoning about systems exhibiting communication, data and real-time aspects. As intermediate ...
详细信息
ISBN:
(纸本)3540278826
We present a new model-checking technique for CSP-OZ-DC, a combination of CSP, Object-Z and Duration Calculus, that allows reasoning about systems exhibiting communication, data and real-time aspects. As intermediate layer we will use a new kind of timed automata that preserve events and data variables of the specification. These automata have a simple operational semantics that is amenable to verification by a constraint-based abstraction-refinement model checker. By means of a case study, a simple elevator parameterised by the number of floors, we show that this approach admits model-checking parameterised and infinite state real-time systems.
In [22], a new Hybrid Probabilistic logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hyb...
详细信息
ISBN:
(纸本)354029208X
In [22], a new Hybrid Probabilistic logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic logic Programs framework of [22] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and probabilistic well-founded semantics. Stable probabilistic model semantics and probabilistic well-founded semantics generalize stable model semantics and well-founded semantics of traditional normal logic programs, and they reduce to the semantics of original Hybrid Probabilistic logic programs framework of [22] for programs without negation, It is the first time that two different semantics for Hybrid Probabilistic Programs with non-monotonic negation as well as their relationships are described. This development provides a foundational ground for developing computational methods for computing the proposed semantics. Furthermore, it makes it clearer how to characterize non-monotonic negation in probabilistic logic programming frameworks for commonsense reasoning.
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms can automatically be constructed. Pr...
详细信息
ISBN:
(纸本)3540285849
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms can automatically be constructed. Previous work on type-based termination analysis used either types declared by the user, or automatically generated monomorphic types describing the success set of predicates. The latter types are less precise and result in weaker termination conditions than those obtained from declared types. Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation. Experiments so far show that our automatically inferred well-typings axe close to the declared types and result in termination conditions that are as strong as those obtained with declared types. We describe the method, its implementation and experiments with termination analysis based on the inferred types.
Model checking is a promising formal verification technique successfully applied in several industrial environments, such as in chip design and in the telecommunication industry. In this paper, preliminary results of ...
详细信息
ISBN:
(纸本)3540278826
Model checking is a promising formal verification technique successfully applied in several industrial environments, such as in chip design and in the telecommunication industry. In this paper, preliminary results of an automotive case study are presented as performed in the context of the European project EASIS(1).
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in an agent-based platform called CARREL...
详细信息
ISBN:
(纸本)0769524540
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in an agent-based platform called CARREL. It is an agent-agency which mediates organ transplants. We present two possible ways to infer the stable and preferred extensions of an argumentation framework, one in a declarative way using Answer Set programming(ASP) and the other one in a procedure way.
First-order coherent logic (CL) extends resolution logic in that coherent formulas allow certain existential quantifications. A substantial number of reasoning problems (e.g., in confluence theory, lattice theory and ...
详细信息
ISBN:
(纸本)354030553X
First-order coherent logic (CL) extends resolution logic in that coherent formulas allow certain existential quantifications. A substantial number of reasoning problems (e.g., in confluence theory, lattice theory and projective geometry) can be formulated directly in CL without any clausification or Skolemization. CL has a natural proof theory, reasoning is constructive and proof objects can easily be obtained. We prove completeness of the proof theory and give a linear translation from FOL to CL that preserves logical equivalence. These properties make CL well-suited for providing automated reasoning support to logical frameworks. The proof theory has been implemented in Prolog, generating proof objects that can be verified directly in the proof assistant Coq. The prototype has been tested on the proof of Hessenberg's Theorem, which could be automated to a considerable extent. Finally, we compare the prototype to some automated theorem provers on selected problems.
We present a precise correspondence between separation logic and a new simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI [14]. Moreover, we...
详细信息
ISBN:
(纸本)3540254358
We present a precise correspondence between separation logic and a new simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI [14]. Moreover, we introduce the notion of a BI hyperdoctrine and show that it soundly models classical and intuitionistic first- and higher-order predicate BI, and use it to show that we may easily extend separation logic to higher-order. We argue that the given correspondence may be of import for formalizations of separation logic.
In this article we have presented an example that allows showing the design and implementation details of the module gFipaOS that permit incorporate to the simulator of multiagents systems on GALATEA some platforms of...
详细信息
ISBN:
(纸本)0769524621
In this article we have presented an example that allows showing the design and implementation details of the module gFipaOS that permit incorporate to the simulator of multiagents systems on GALATEA some platforms of distributed agents. In this module GALATEA's agents management is based on the multiagent communication standard called FIRA (Foundation for Intelligent Physical Agents). The model represents a Patio-like world which changes because agents change it and also due to natural events (food appears). The model is implemented on a platform that distributed agents across several computing hosts.
In constraint programming, a priori choices statically determine strategies that are crucial for resolution performances. However, the effect of strategies is generally unpredictable. We propose to dynamically change ...
详细信息
ISBN:
(纸本)3540298967
In constraint programming, a priori choices statically determine strategies that are crucial for resolution performances. However, the effect of strategies is generally unpredictable. We propose to dynamically change strategies showing bad performances. When this is not enough to improve resolution, we introduce some meta-backtracks. Our goal is to get good performances without the know-how of experts. Some first experimental results show the effectiveness of our approach.
暂无评论