41.

Self-fuzzification method according to typicality correlation for classification on tiny data sets
- Emmanuel Schmitt; Vincent Bombardier; Patrick Charpentier
Abstract — This article presents a self-fuzzification method to enhance the settings of a Fuzzy Reasoning Classification adapted to the automated inspection of wooden boards. The supervised classification is made thanks to fuzzy linguistic rules generated from small training data sets. This study especially answers to a double industrial need about the pattern recognition in wooden boards. Firstly, few samples are available to generate the recognition model. This aspect makes lesser efficient compilation methods like neural networks in terms of recognition rates. Secondly, the settings of the classification method must be simplified, because the users are not experts in fuzzy...

42.

Constraint-based Temporal Reasoning for E-learning with LODE
- Rosella Gennari; Ornella Mich
Abstract. LODE is a logic-based web tool for Italian deaf children. It aims at stimulating global reasoning on e-stories written in a verbal lan-guage. Presently, we are focusing on temporal reasoning, that is, LODE stimulates children to reason with global temporal relations between events possibly distant in a story. This is done through apt exercises and with the support of a constraint programming system. Children can also reinvent the e-story by rearranging its events along a new temporal order; it is the task of the constraint system to determine the consistency of the temporally reorganised story and provide children with...

43.

Stability and Stabilization of Boolean Networks ∗
- Daizhan Cheng; Hongsheng Qi; Zhiqiang Li; Jiang B. Liu
Abstract. The stability of Boolean networks and the stabilization of Boolean control networks are investigated. Using semi-tensor product of matrices and the matrix expression of logic, the dynamics of a Boolean (control) network can be converted to a discrete time linear (bilinear) dynamics, called the algebraic form of the Boolean (control) network. Then the stability can be revealed by analyzing the transition matrix of the corresponding discrete time system. Main results consist of two parts: (i) Using logic coordinate transformation, the known sufficient condition based on incidence matrix has been improved. It can also be used in stabilizer design. (ii)...

44.

2
- Nicolas Beldiceanu; Julien Martin
ISRN: SICS-T2008/04-SE Abstract: This report presents a global constraint that enforces rules written in a language based on arithmetic and rst-order logic to hold among a set of objects. In a rst step, the rules are rewritten to Quantier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generaliza-tion of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for ltering. The business rules allow to express a great variety of packing and placement constraints, while admitting efcient and...

45.

ORIGINAL RESEARCH Hypomyelination and Congenital Cataract: Neuroimaging Features of a Novel Inherited
- White Matter Disorder; A. Rossi; R. Biancheri; F. Zara; C. Bruno; G. Uziel; C. Minetti; P. Tortori-donati
BACKGROUND AND PURPOSE: Hypomyelination and congenital cataract (HCC) is an autosomal reces-sive white matter disease caused by deficiency of hyccin, a membrane protein implicated in both central and peripheral myelination. We aimed to describe the neuroimaging features of this novel entity. MATERIALS AND METHODS: A systematic analysis of patients with unclassified leukoencephalopathies admitted to our institutions revealed 10 children with congenital cataract, slowly progressive neuro-logic impairment, and diffuse white matter abnormalities on neuroimaging. Psychomotor developmen-tal delay was evident after the first year of life. Peripheral neuropathy was demonstrated by neuro-physiologic studies in 9 children. The available neuroimaging studies were retrospectively...

46.

Derivation rules as anti-axioms in modal logic
- Yde Venema; Faculteit Der Wijsbegeerte
Abstract. We discuss a ‘negative ’ way of defining frame classes in (multi-)modal logic, and address the question whether these classes can be axiomatized by derivation rules, the ‘non-ξ rules’, styled after Gabbay’s Irreflexivity Rule. The main result of this paper is a meta-theorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas, and Λ+ is the extension of Λ with a set of non-ξ rules, then Λ+ is strongly sound and complete with respect to the class of frames determined by the axioms and the rules.

47.

Genes and Ants for Default Logic
- Pascal Nicolas; Frédéric Saubion; Igor Stéphan
Default Logic and Logic Programming with stable model se-mantics are recognized as powerful frameworks for incom-plete information representation. Their expressive power are suitable for non monotonic reasoning, but the counterpart is their very high level of theoretical complexity. The purpose of this paper is to show how heuristics issued from combina-torial optimization and operation research can be used to built non monotonic reasonning systems.

48.

A basic logic for textual inference
- D. Bobrow; C. Condoravdi; R. Crouch; R. Kaplan; L. Karttunen; T. King; V. De Paiva; A. Zaenen
This note describes a logical system based on concepts and contexts, the system TIL for textual inference logic. The system TIL is the beginnings of a logic that is a kind of “con-texted ” description logic, designed to support local linguistic inferences. This logic pays attention to the intensionality of linguistic constructs and to the need for tractability of infer-ence in knowledge representation formalisms.

49.

A Compact Delay Model for Series-Connected MOSFETs
- Kaveh Shakeri; James D. Meindl
A compact delay model for series connected MOSFETs has been derived. This model enables accurate prediction of worst-case delay of different logic families such as dynamic logic. It also provides insight into delay change as the device parameters change. Key results show that the relative delay of series connected MOSFETs is almost invariant for different generations of technology. 1.

50.

HA2TSD: Hierarchical Time Slack Distribution for Ultra-Low Power CMOS VLSI
- Kyu-won Choi; Abhijit Chatterjee
This paper describes an efficient hierarchical design and optimization approach for ultra-low power CMOS logic circuits. We introduce the Hierarchical Activity-Aware Time Slack Distribution (HA2TSD) algorithm, which distributes the surplus time slack into the most power-hungry modules hierarchically. HA2TSD ensures that the total slack budget is maximal and the total power is near-minimal. Based on these time slacks, we have optimized technology parameters (supply voltage, threshold voltage, and device width) through a gate-level power optimizer and have tested the algorithm on a set of benchmark example circuits and building blocks of a synthesizable ARM core. The experimental results show that...

51.

The rewriting logic semantics project
- Jose ́ Meseguer
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial ” to find the right balance between abstraction and computational observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities. Key words: Semantics...

52.

Project Based Learning Using Tablet PCs: A Practice to Enhance Design Components in Engineering Instruction
This paper presents a Collaborative Project Based Learning model using Tablet PCs to enhance the design components in engineering classroom instruction. The core of our proposed model is to incorporate small in-class Tablet PC-based collaborative design projects to reinforce theory with design examples and to guide students through the design process. This PBL model has been implementation in three core computer engineering courses (Microcontroller Programming, Computer Logic Design, and Multimedia Networking) since Fall 2005 and the students’ feedback has been very positive. In all pilot classes that incorporated the model, a significant improvement of students ’ hands-on skills was observed....

53.

Functional modeling based on interactions of mass, energy and information
- Yang Bo
The authors are working towards a universal product model theory that captures essential aspects of designed product rep-resentation. In a previous paper, Salustri established the basis of a theory of function modeling that could be integrated into the universal product model theory. The current paper ex-pands on that work by establishing a small set of primitive function types in terms of basic interactions between mass, en-ergy, and information. It is found that function is intimately coupled to many other aspects of product modeling, including ontology, mereology, and context logic. The authors believe it can represent most (perhaps all) product functions....

54.

RANDOMIZATIONS OF MODELS AS METRIC STRUCTURES
- Itai Ben; Yaacov; H. Jerome Keisler
Abstract. The notion of a randomization of a first order structure was introduced by Keisler in the paper Randomizations of Models, Advances in Math. 1999. The idea was to form a new structure whose elements are random elements of the original first order structure. In this paper we treat randomizations as continuous structures in the sense of Ben Yaacov and Usvyatsov. In this setting, the earlier results show that the randomization of a complete first order theory is a complete theory in continuous logic that admits elimination of quantifiers and has a natural set of axioms. We show that the...

55.

Automated Deduction for
- Categorial Grammar Logics; Richard Moot
In this paper we will look at automated theorem proving for categorial grammar logics. Taking linear logic as a starting point, we will show how proof nets, as an optimal proof theory for the multiplicative fragment of linear logic, can be used to generate proofs for logical statements. We will sketch how adding structural labeling to the proof nets gives us a mech-anism to account for linguistically relevant distinctions like linear order and con-stituency structure. Complexity analysis will show that the derivability problem is not computation-ally feasible in the general case. We will alleviate this by early application of the...

56.

Coauthors: E. Vinceková IDEALS IN MV PAIRS
- S. Pulmannova
The concept of an MV-algebra was introduced by Chang [4] as an algebraic basis for many-valued logic. It turned out that MV-algebras are a subclass of a more general class of effect algebras [7, 6]. Namely, MV-algebras are in one-to-one cor-respondence with lattice ordered effect algebras satisfying the Riesz decomposition property [2], the latter are called MV-effect algebras. In the study of congruences and quotients of effect algebras, a crucial role is played by so-called Riesz ideals [13, 8]. Namely, every Riesz ideal gives rise to a congruence, and if a congruence is generated by an ideal, then this ideal...

57.

The theory of calculi with explicit substitutions revisited
- Delia Kesner
Calculi with explicit substitutions are widely used in different areas of com-puter science such as functional and logic programming, proof-theory, theorem proving, concurrency, object-oriented languages, etc. Complex systems with ex-plicit substitutions were developed these last 15 years in order to capture the good computational behaviour of the original system (with meta-level substitutions) they were implementing. In this paper we first survey previous work in the domain by pointing out the motivations and challenges that guided the developement of such calculi. Then we use very simple technology to establish a general theory of explicit substitutions for the lambda-calculus which enjoys all...

58.

An in-between "implicit" and "explicit" complexity: Automata
- Aubert, Clément
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machine-dependant with implicit bounds model.

59.

Pensamiento científico-creativo y rendimiento académico
- Ruiz, María José; Ferrándiz García, Carmen; Soto Martínez, Gloria; Bermejo García, María Rosario; Sainz Gómez, Marta
http://revistas.udc.es/index.php/reipe/article/view/24El objetivo del trabajo es estudiar la relación del constructo de pensamiento científico-creativo con el rendimiento académico en una muestra de alumnos adolescentes. Además de ello, se analizará la fiabilidad de la prueba de pensamiento científico-creativo que se va a utilizar en el presente trabajo. En el estudio participaron 98 estudiantes (12-16 años) de un instituto de Educación Secundaria de la Región de Murcia (España). Los instrumentos utilizados fueron: a) el test de Pensamiento Científico-Creativo (Hu y Adey, 2002); adaptado en nuestro país por el Equipo de Altas Habilidades de la Universidad de Murcia. El test consta de 7 tareas...

60.

Optimal Latch Mapping and Retiming within a Tree
- Joel Grodstein; Eric Lehman; Heather Harkness; Herve Touati; Bill Grundmann
Abstract. We propose a technology mapping algorithm that takes existing structural tech-nology-mapping algorithms based on dynam-ic programming [1,3,4] and extends them to retime pipelined circuits. If the circuit to be mapped has a tree structure, our algorithm generates an optimal solution compatible with that structure. The algorithm takes into account gate delays and capacitive loads as latches are moved across the logic. It also supports latches with embedded logic: i.e., cells that combine a D latch with a combin-ational gate at little extra cost in latch delay. simple transparent latch and a gate (denoted f(x1,x2,...,xn)) for only little more delay...