Search results for "Logic in computer science"
showing 10 items of 129 documents
Protoalgebraicity and the Deduction Theorem
2001
This chapter is intended as an introduction to the Deduction Theorem and to applications of this theorem in metalogic.
Quantum Finite State Transducers
2000
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their `little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.
Left-star order structure of Rickart *-rings
2015
Janowitz proved in 1983 that the initial segments of a Rickart *-ring with the star order are orthomodular posets. In this paper, the same result is proved for the left-star order , which was introduced by Marovtet al., by finding an orthogonality which corresponds to in a certain way and then applying a result proved by Cīrulis which states that the initial segments of any quasi-orthomodular set are orthomodular.
Investigating Potential Alignments between Modelica Standard Library and SAREF Ontologies
2021
International audience; Simulation tools based on the Modelica language provide comprehensive modelling and simulation approaches for building energy systems. However, the simulation and optimisation of such systems are data-driven processes, lacking a common understanding of information structure within the process. This paper investigates the possible semantic alignments of the Smart Appliances REFerence (SAREF) ontology and its extension for building domain, SAREF4BLDG, with the Modelica Standard Library (MSL). Using the MSL, a residential heating system has been modelled in OpenModelica, an open-source modelling and simulation environment. Then, SAREF and its extension SAREF4BLDG semant…
The expansion $\star$ mod $\bar{o}(\hbar^4)$ and computer-assisted proof schemes in the Kontsevich deformation quantization
2019
The Kontsevich deformation quantization combines Poisson dynamics, noncommutative geometry, number theory, and calculus of oriented graphs. To manage the algebra and differential calculus of series of weighted graphs, we present software modules: these allow generating the Kontsevich graphs, expanding the noncommutative & x22c6;-product by using a priori undetermined coefficients, and deriving linear relations between the weights of graphs. Throughout this text we illustrate the assembly of the Kontsevich & x22c6;-product up to order 4 in the deformation parameter Already at this stage, the & x22c6;-product involves hundreds of graphs; expressing all their coefficients via 149 w…
On modal mu-calculus over finite graphs with bounded strongly connected components.
2010
For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k. We show that for every k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level Delta2, but not to Comp(Sigma1,Pi1) (compositions of formulas of level Sigma1 and Pi1). This contrasts with the class of all graphs, where Delta2=Comp(Sigma1,Pi1).
Materials Communicating with the BIM: Aims and First Results of the McBIM Project
2019
This paper introduces McBIM, a French national research project working on on-line monitoring on concrete structure. This project gathers 3 french laboratories (the CRAN, LAAS and LIB) associated with one company (360SmartConnect/FINAO SAS) that are working together from 2018 to 2021. It proposes 1) to design a “communicating concrete”, made of concrete equipped with embedded low-energy wireless microsensor network, able to manage and exchange data using BIM standards, and 2) to demonstrate the usefulness of this approach across several building lifecycle phases, namely the manufacturing, construction and exploitation phases for structural health monitoring. The paper will first start by in…
Tally languages accepted by Monte Carlo pushdown automata
1997
Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.
La ontología de la proposición en el Russell de "The Principles of Mathematics" y los artículos de Meinong
2005
Bertrand Russell, in The Principles of Mathematics and ¿Meinong¿s Theory of Complexes and Assumptions¿, maintains a unitary conception of the ontology of propositions. He makes a difference between judgment and proposition. Propositions are independent entities and they have different presentations. False propositions subsist; this is related to the relation in the proposition called ¿affirmation¿ and the double condition of predicates (meaning and term). But that conception has bad consequences for the unity and identity of proposition.
Query automata
1999
A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. We want to understand how the natural and well-studied computation model of tree automata can be used to compute such queries. We define a query automaton (QA) as a deterministic two-way finite automaton over trees that has the ability to select nodes depending on the state and the label at those nodes. We study QAs over ranked as well as over unranked trees. Unranked trees differ from ranked ones in that there is no bound on the num…