41.

{FO2(<,+1, ~)} on data trees, data tree automata and an branching vector addition systems.
- Jacquemard, Florent; Segoufin, Luc; Dimino, Jérémie
A data tree is a unranked ordered tree where each position carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic {FO2(<,+1,~)} over data trees. Here {+1} refers to the child and the next sibling relations while {<} refers to the descendant and following sibling relations. Moreover {~} is a binary predicate testing data equality. We exhibit an automata model, denoted {DA#}, that is more expressive than {FO2(<,+1,~)} but such that emptiness of {DA#} and satisfiability of {FO2(<,+1,~)} are inter-reducible. This is proved via a model of counter...

42.

Rhythm Tree Rewriting
- Jacquemard, Florent; Bresson, Jean; Donat-Bouillud, Pierre
International audience

43.

A System of Interaction and Structure V: The Exponentials and Splitting
- Guglielmi, Alessio; Straßburger, Lutz
International audience

44.

Proof-Nets and the Call-by-Value Lambda-Calculus
- Accattoli, Beniamino
International audience

45.

Refinements for Free!
- Cohen, Cyril; Dénès, Maxime; Mörtberg, Anders
International audience

46.

[en] SOUTH AMERICAN ENERGY INTEGRATION: UNFOLDING THE INSTITUTIONAL DEVELOPMENT
- THAUAN DOS SANTOS
[pt] O principal objetivo desse trabalho é avaliar os desdobramentos do desenvolvimento institucional sobre a integração energética da América do Sul. Sendo assim, e após o debate acerca das teorias neofuncionalistas, das teorias intergovernamentalistas e das teorias da governança multi-nível, bem como suas contribuições para o desenvolvimento institucional da integração energética, propõe-se uma ampliação do conceito de cooperação e segurança energéticas, avançando na lógica da infraestrutura física demandada para a criação de determinados empreendimentos, uma vez que a literatura atual foca demasiadamente na questão do petróleo e de seus derivados. Apresenta-se, ainda, dados acerca da atual infraestrutura física do subcontinente...

47.

[en] THE LIBERAL PEACE IN PEACEBUILDING OPERATIONS: THE LOCAL AND THE LIMITS OF CRITIQUE
- FRANCINE ROSSONE SILVA
[pt] A dissertação parte do desejo de investigar a proposta da crítica da paz liberal de transcendência da lógica liberal nas operações de peacebuilding. Iniciar essa discussão demanda uma especulação sobre as articulações discursivas que permitiram a construção de uma interpretação de paz em torno de normas e princípios reconhecidos no discurso liberal, bem como de noções particulares de institucionalização, democratização e liberalização. A partir desta análise, a pesquisa volta-se para um estudo das narrativas críticas que denunciam a disseminação pelas Nações Unidas de uma receita para a paz baseada em valores hegemônicos e universalizantes, que culmina na construção, por...

48.

Magnetostatic interaction in nanowires
- Siddiqui, Saima Afroz
Nonvolatile memory and logic devices rely on the manipulation of domain walls in magnetic nanowires, and scaling of these devices requires an understanding of domain wall behavior as a function of the wire width. Due to the increased importance of edge roughness and microstructure in narrow lines, domain wall pinning increases dramatically as the wire dimensions decrease and stochastic behavior is expected depending on the distribution of pinning sites. This work reports on the field driven domain wall statistics in sub-100 nm wide nanowires made from Co films of 8 nm thickness made by an electron beam lithography and etching...

49.

Three-dimensional nanofabrication by electron-beam lithography and directed self-assembly
- Do, Hyung Wan
In this thesis, we investigated three-dimensional (3D) nanofabrication using electron-beam lithography (EBL), block copolymer (BCP) self-assembly, and capillary force-induced self-assembly. We first developed new processes for fabricating 3D nanostructures using a hydrogen silsesquioxane (HSQ) and poly(methylmeth-acrylate) (PMMA) bilayer resist stack. We demonstrated self-aligned mushroom-shaped posts and freestanding supported structures. Next, we used the 3D nanostructures as topographical templates guiding the self-assembly of polystyrene-b-polydimethylsiloxane (PS-b-PDMS) block copolymer thin films. We observed parallel cylinders, mesh-shaped structures, and bar-shaped structures in PDMS. Finally, we studied capillary force-induced self-assembly of linear nanostructures using a spin drying process. We developed a computation schema based on...

50.

Towards low-power yet high-performance networks-on-chip
- Park, Sunghyun, Ph. D. Massachusetts Institute of Technology
A network-on-chip (NoC), the de-facto communication backbone in manycore processors, consumes a significant portion of total chip power, competing against the computation cores for the limited power and thermal budget. On the other hand, overall system performance of manycore chips increasingly relies on on-chip latency and bandwidth as core counts scale. This thesis aims to design low-power yet high-performance NoCs through circuit and microarchitecture co-design contrary to the traditional approaches where NoCs sacrifice latency and/or bandwidth for low-power operation; then demonstrate such design concepts through test chip prototyping, enabling detailed measurements for rigorous analysis of the pros and cons of...

51.

Efficient Induction Of Logic Programs
- Stephen Muggleton; Cao Feng
Recently there has been increasing interest in systems which induce first order logic programs from examples. However, many difficulties need to be overcome. Well-known algorithms fail to discover correct logical descriptions for large classes of interesting predicates, due either to the intractability of search or overly strong limitations applied to the hypothesis space. In contrast, search is avoided within Plotkin's framework of relative least general generalisation (rlgg). It is replaced by the process of constructing a unique clause which covers a set of examples relative to given background knowledge. However, such a clause can in the worst case contain infinitely...

52.

About the Expressive Power of CTL combinators
- Francois Laroussinie; The Ctl Logic
We present a new and quite surprising result about the expressive power of the 9 U and 8 U combinators in CTL. 1 The CTL logic CTL, the Computation Tree Logic proposed in [2] has been widely considered in literature for the specification of reactive systems [6, 5]. CTL is paradigmatic in the field of branching-time temporal logic because it admits efficient model checking algorithms (see [3]) while remaining very expressive. CTL formulas are built using four combinators: 9X, 8X, 9 U and 8 U, plus atomic propositions a; b; : : : and boolean combinators: (CTL 3) f; g...

53.

Automatic Analysis of Relay Ladder Logic Programs
- Zhendong Su
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL programs is extremely high, often measured in millions of dollars (for shutting down a factory) or human safety (for rides). In this paper, we describe our experience in applying constraint-based program analysis techniques to analyze production RLL programs. We demonstrate that our analyses are useful in detecting some common programming mistakes and can be easily extended to perform other kinds of analysis for RLL programs such as some of the analyses...

54.

The Database Approach to Knowledge Representation
- Jeffrey D. Ullman
The database theory community, centered around the PODS (Principles of Database Systems) conference has had a long-term interest in logic as a way to represent "data," "information," and "knowledge" (take your pick on the term --- it boils down to facts or atoms and rules, usually Horn clauses). The approach of this community has been "slow and steady," preferring to build up carefully from simple special cases to more general ideas, always paying attention to how efficiently we can process queries and perform other operations on the facts and rules. A powerful theory has developed, and it is beginning to...

55.

Return to Term Logic
- Pei Wang
Term logic is characterized by subject-- predicate statements and syllogistic inference rules. This kind of logic, when properly extended, provides a natural and consistent model for multiple types of inference, including deduction, abduction, induction and revision. This paper briefly describes how such a logic works in the NARS project. 1 Introduction There are two major traditions in formal logic: term logics and propositional/predicate logics, exemplified respectively by the Syllogism of Aristotle and the FirstOrder Predicate Logic of Frege, Russell, and Whitehead. Term logic is different from predicate logic in both its knowledge representation language and its inference rules. Term logic...

56.

Generating Explicit Orderings for Non-monotonic Logics
- James Cussens; Anthony Hunter; Ashwin Srinivasan
For non-monotonic reasoning, explicit orderings over formulae offer an important solution to problems such as `multiple extensions'. However, a criticism of such a solution is that it is not clear, in general, from where the orderings should be obtained. Here we show how orderings can be derived from statistical information about the domain which the formulae cover. For this we provide an overview of prioritized logics---a general class of logics that incorporate explicit orderings over formulae. This class of logics has been shown elsewhere to capture a wide variety of proof-theoretic approaches to non-monotonic reasoning, and in particular, to highlight...

57.

Belief Maintenance in Bayesian Networks
- Marco Ramoni; Alberto Riva
Bayesian Belief Networks (bbns) are a powerful formalism for reasoning under uncertainty but bear some severe limitations: they require a large amount of information before any reasoning process can start, they have limited contradiction handling capabilities, and their ability to provide explanations for their conclusion is still controversial. There exists a class of reasoning systems, called Truth Maintenance Systems (tmss), which are able to deal with partially specified knowledge, to provide well-founded explanation for their conclusions, and to detect and handle contradictions. tmss incorporating measure of uncertainty are called Belief Maintenance Systems (bmss). This paper describes how a bms based...

58.

A computational model of classical linear logic: Is classical linear logic inherently parallel?
- Magnus Carlsson; Philip Wadler
This paper provides a computational model that uses no parallelism, thus suggesting that there is no inherent link between classical linear logic and parallelism. The involutive negation of classical linear logic is usually given an intuitive explanation in terms of interchanging `questions' and `answers'. The model presented here makes this intuition precise. There are in fact two levels of duality: `values' are dual to `demands', and `yielders' are dual to `acceptors'. In the past, the connective

59.

A Real-Time Extension to Logic Programming Based on the Concurrent Constraint Logic Programming Paradigm
- Tony Savor; Paul Dasiewicz
Although concurrent logic programming languages provide a suitable implementation environment for real-time systems, they fail to give any notion of temporal correctness. We define a set of semantics whereby temporal constraints, consisting of delay, maximum execution time, and priority specifications can be implemented into existing concurrent logic programming languages. The notion of temporal inheritance is described which allows distribution of common temporal constraints to processes that are all part of the same task. We give some examples illustrating the utility of the language extension. 1 Introduction Real-time systems (RTS) can be defined as systems whose result not only depends on...

60.

Constrained Properties, Semilinear Systems, and Petri Nets
- Ahmed Bouajjani; Peter Habermehl
We investigate the verification problem of two classes of infinite state systems w.r.t. nonregular properties (i.e., nondefinable by finite-state !-automata). The systems we consider are Petri nets as well as semilinear systems including pushdown systems and PA processes. On the other hand, we consider properties expressible in the logic CLTL which is an extension of the linear-time temporal logic LTL allowing two kinds of constraints: pattern constraints using finite-state automata and counting constraints using Presburger arithmetics formulas. While the verification problem of CLTL is undecidable even for finite-state systems, we identify a fragment called CLTL2 for which the verification problem...