61.

SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format
- Miquel Bofill; Josep Suy; Mateu Villaret; Departament D’informàtica I
Abstract. In this paper we introduce Simply, a compiler from a declar-ative language for CSP modeling to the standard SMT-LIB format. The current version of Simply is able to generate problem instances falling into the quantifier free linear integer arithmetic logic. The compiler has been developed with the aim of building a system for easy CSP model-ing and solving. By taking advantage of the year-over-year increase in performance of SMT solvers, we hope that such a system can serve as an alternative to other decision procedures in many applications. The compiler can also be used for easy SMT benchmark generation....

62.

A fuzzy classification technique for predicting species’ distributions: applications using invasive alien plants and indigenous insects. Diversity and Distributions 10: 461–474
- Mark P. Robertson; Martin H. Villet; Anthony R. Palmer
A new predictive modelling technique called the fuzzy envelope model (FEM) is introduced. The technique can be used to predict potential distributions of organisms using presence-only locality records and a set of environmental predictor variables. FEM uses fuzzy logic to classify a set of predictor variable maps based on the values associated with presence records and combines the results to produce a potential distribution map for a target species. This technique represents several refinements of the envelope approach used in the BIOCLIM modelling package. These refinements are related to the way in which FEMs deal with uncertainty, the way in...

63.

Complexity of answering queries using materialized views
- Serge Abiteboul; Oliver M. Duschkat
WC study the complexity of the problem of answering queries using materinlized views, This problem has attracted a lot of attention re-cently because of its relevance in data integration. Previous work considered only conjunctive view definitions. We examine the con-sequences of allowing more expressive view definition languages. Tl~olanguagcsweconsiderforviewdefinitionsanduserqueriesare: conjunctive qucrics with inequality, positive queries, datalog, and first-order logic. We show that the complexity of the problem de-pcnds on whether views are assumed to store all the tuples that sat-isfy the view definition, or only a subset of it. Finally, we apply the results to the view consistency and view self-maintainability...

64.

Water Level Control by Fuzzy Logic and Neural Networks
- Daniel Wu; Fakhreddine Karray; Insop Song
Abstract — The objective of this paper is to investigate and find a solution by designing the intelligent controllers for controlling water level system, such as fuzzy logic and neural network. The controllers also can be specifically run under the circumstance of system disturbances. To achieve these objectives, a prototype of water level control system has been built and implementations of both fuzzy logic and neural network control algorithms are performed. In fuzzy logic control, Sugeno model is used to control the system. In neural network control, the approach of Model Reference Adaptive Neural Network Control based on the backpropagation...

65.

Built-In Self-Test of Configurable Cores in SOCs Using Embedded
- John Sunwoo; Charles Stroud
Abstract –Built-In Self-Test (BIST) provides an effective way to test configurable cores in System-on-Chip (SoC) implementations. We present a case study of the use of dynamic reconfiguration from an embedded processor core to implement BIST for the programmable logic and routing resources in configurable cores in commercially available SoCs. Experimental results from actual imple-mentations include speed-up and memory savings ob-tained and compared to traditional BIST approaches for configurable cores. 1

66.

Model Transformations for Integrating and Validating Web Application Models
- Gefei Zhang
Abstract: While most current Web Engineering methodologies model the separate aspects, content, navigation, business logic, and presentation, of Web systems in sep-arate models, integration of the different models and in particular the validation of their interaction is not yet sufficiently supported. We propose a systematic approach of building a UML state machine that integrates the separate concerns content, naviga-tion, and business logic of a Web system into a big picture, which can then be validated formally for consistency and behavioural properties. 1

67.

2006b, The summary abox: Cutting ontologies down to size
- Achille Fokoue; Aaron Kershenbaum; Li Ma; Edith Schonberg; Kavitha Srinivas
Reasoning in descriptive logic (DL) ontologies is known to be intractable in the worst-case. This poses a serious problem for the use of DL-based ontologies such as OWL, because in practice, most ontologies have numerous assertions about individuals in the Abox. We propose a technique to make reasoning scalable for very large Aboxes in secondary storage. The technique operates by producing a dramatically reduced summary Abox for the original Abox. Reasoning on the original Abox is reduced in most cases to reason-ing on this reduced summary Abox. We show that our techniques scale to consistency detection on ontologies with 6.5...

68.

Categorization vs. logic in category conjunction: towards a model of overextension
- Fintan J. Costello
Traditional approaches to semantics give a logical, set-theoretic account of category conjunction, where an item is a member of a conjunction A&B only if it is a member of both single categories A and B. However, people do not always follow this logical approach when classifying items in conjunctions. For example, Hampton (1988) found that people typically classify blackboards as non-members of the single category “furniture”, but as members of the conjunction “school furniture”. This paper describes a computational model intended to explain this “overextension ” of conjunctive categories, and an experiment testing this model using conjunctions of controlled, laboratory-learned...

69.

Yield-driven near-threshold sram design
- Gregory Chen; Student Member; Dennis Sylvester; Senior Member; David Blaauw; Senior Member; Trevor Mudge
Abstract—Voltage scaling is desirable in static RAM (SRAM) to reduce energy consumption. However, commercial SRAM is sus-ceptible to functional failures when is scaled down. Although several published SRAM designs scale to 200–300 mV, these designs do not sufficiently consider SRAM robustness, limiting them to small arrays because of yield constraints, and may not correctly target the minimum energy operation point. We examine the effects on area and energy for the differential 6T and 8T bit cells as is scaled down, and the bit cells are either sized and doped, or assisted appropriately to maintain the same yield as with full....

70.

Semantics for a useful fragment of the situation calculus
- Gerhard Lakemeyer; Hector J. Levesque
In a recent paper, we presented a new logic called ES for reasoning about the knowledge, action, and perception of an agent. Although formulated using modal operators, we argued that the language was in fact a dialect of the situation calculus but with the situation terms suppressed. This, we claim, allows us to develop a clean and workable semantics for the language without piggybacking on the generic Tarski semantics for rst-order logic. In this paper, we reconsider the relation between ES and the sit-uation calculus and show how to map sentences of ES into the situation calculus. We argue that...

71.

Explanation Support for OWL Authoring
- Thorsten Liebig; Friedrich Von Henke
Recent analyses of ontology engineering efforts showed that it is not only novices which are commonly faced with com-prehension problems or misconceptions of modeling conse-quences. A better understanding can be fundamentally sup-ported by on-demand explanations of subsumption, the core inference service of ontology reasoning systems. In this pa-per we describe ongoing work towards a systems for explain-ing subsumption for a significant fraction of the Description Logic underlying OWL Lite. Our explainer uses a tableau-based approach to generate step by step quasi-natural lan-guage explanations. We also comment on related work and discuss future explaining features.

72.

An Algebraic Semantics for Gnome via a Translation to étoile Specifications∗
- Marc Aiguier; Gilles Bernot; Jaime Ramos
Gnome is a simplified and revised version of the object oriented specification language Oblog. A formal semantics based on temporal logic has already been defined, and alternative semantics are also being studied. The goal of this article is to propose an algebraic semantics for Gnome, using étoile. étoile is an algebraic theory for the specification of systems, with an object oriented specification style. It allows to specify objects with local states, systems and their in-variants. There is also in étoile a logical system which is sound w.r.t. the algebraic semantics. Given a Gnome specification, we obtain an algebraic semantics for...

73.

$rec.titulo
Abstract — In this paper the analysis of wall static pressure variation has been done with fuzzy logic approach to have smooth flow in the duct. Here there are three area ratio chosen for the enlarged duct, 2.89, 6.00 and 10.00. The primary pressure ratio is taken as 2.65 and cavity aspect ratio is taken as 1 and 2. The study is analyzed for length to diameter ratio of 1,2,4 and 6. The nozzles used are De Laval type and with a Mach number of 1.74 and 2.23 and conical nozzles having Mach numbers of 1.58 and 2.06. The analysis...

74.

On Robustness of EDA Tools
- Jan Schmidt; Petr Fišer; Jiří Balcárek
Abstract — It is known that EDA tools produce results of different quality dependent on seemingly neutral details in the input. We bring further results in this direction, which show that the differences can impair any quantitative comparisons of the tools. To gain qualitative insight, we present a stochastic model of result quality based on Gaussian Mixtures. We show on three case studies how these models help to evaluate and improve EDA algorithms. Keywords- logic synthesis, randomness, robustness, stochastic models I.

75.

A general theory of sharing graphs
- Stefano Guerrini
Sharing graphs are the structures introduced by Lamping for the implementation of optimal reductions of lambda-calculus. Gonthier’s reformulation of Lamping’s technique inside Geometry of Interaction and Asperti and Laneve’s work on Interaction Sys-tems have shown that sharing graphs implement a wide class of calculi. We give a semantical characterization of sharing graphs indepen-dent from the calculus to be implemented. By means of an algebraic interpretation of sharing graphs, we define a subclass of them, the so-called proper sharing graphs, on which the usual notion of graph unfolding gives a lower semi-lattice. The least-shared-instance of a proper sharing graph is its...

76.

Cautious hierarchical switching control of stochastic linear systems”, in Int
- M. C. Campi; João P. Hespanha; Maria Pr
Standard switching control methods are based on the certainty equivalence philos-ophy in that, at each switching time, the supervisor selects the candidate controller that is better tuned to the currently estimated process model. If the estimated model does not appropriately describe the process, this procedure may result in the selection of a controller that is not appropriate for the actual process. In this paper, we propose a supervisory switching logic that takes into account the uncertainty on the process description when performing the controller selection. Specif-ically, a probability measure describing the likelihood of the different models is com-puted on-line based...

77.

THE KUZNETSOV-GERČIU AND RIEGER-NISHIMURA LOGICS: THE BOUNDARIES OF THE FINITE MODEL PROPERTY
- Guram Bezhanishvili; Nick Bezhanishvili; Dick De Jongh
Abstract. We give a systematic method of constructing extensions of the Kuznetsov-Gerčiu logic KG without the finite model property (fmp for short), and show that there are continuum many such. We also introduce a new technique of gluing of cyclic intuitionistic descriptive frames and give a new simple proof of Gerčiu’s result [9, 8] that all extensions of the Rieger-Nishimura logic RN have the fmp. Moreover, we show that each extension of RN has the poly-size model property, thus improving on [9]. Furthermore, for each function f: ω → ω, we construct an extension Lf of KG such that Lf...

78.

A Logic KIe characterizing knowing an individual*
- Li Xiaowu
Abstract: In Section 8 of [2] of References in the end of this paper, we give out two logical systems KI1 and KI2 characterizing knowing an individual and the universal type of two semantics using Quasi-valuation method, and then prove that the systems are sound and complete with respect to the semantics. In [3] of References, we give out a logical system KI characterizing knowing an individual and the universal type of a semantics using Half-infinitary method, and then prove that KI is strongly sound and strongly complete with respect to the semantics. In this paper, using to Half-infinitary method,...

79.

Embedding Defeasible Argumentation in Answer Set Programming
- Peter Novák; Martin Baláž; Jürgen Dix
We investigate the relationship between the framework of De-feasible Logic Programming (DeLP) and Answer Set Pro-gramming (ASP). Firstly, we give a characterization of in-admissible sets of an argumentation framework in terms of relations between its preferred extensions, resp. admissible sets. Secondly, we use this result to embed Defeasible Logic Programming in Answer Set Programming. We provide two translations of DeLP programs into extended logic programs. Thirdly, we provide generic algorithms for extracting the set of warranted literals of the original defeasible logic program from answer sets of the translated program.

80.

Permission to Speak: A Logic for Access Control and ConformanceI
- Nikhil Dinesha; Aravind Joshia; Insup Leea; Oleg Sokolskya
Formal languages for policy have been developed for access control and confor-mance checking. In this paper, we describe a formalism that combines features that have been developed for each application. From access control, we adopt the use of a saying operator. From conformance checking, we adopt the use of operators for obligation and permission. The operators are combined using an axiom that permits a principal to speak on behalf of another. The combination yields benefits to both applications. For access control, we overcome the prob-lematic interaction with classical reasoning. For conformance, our formalism accommodates nested obligations and permissions. The axioms...