Relevant bibliographies by topics / MSO logic

Academic literature on the topic 'MSO logic'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'MSO logic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "MSO logic"

1

D'agostino, Giovanna, and Marco Hollenberg. "Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski." Journal of Symbolic Logic 65, no. 1 (March 2000): 310–32. http://dx.doi.org/10.2307/2586539.

Full text
Abstract:
The (modal) μ-calculus ([14]) is a very powerful extension of modal logic with least and greatest fixed point operators. It is of great interest to computer science for expressing properties of processes such as termination (every run is finite) and fairness (on every infinite run, no action is repeated infinitely often to the exclusion of all others).The power of the μ-calculus is also evident from a more theoretical perspective. The μ-calculus is a fragment of monadic second-order logic (MSO) containing only formulae that are invariant for bisimulation, in the sense that they cannot distinguish between bisimilar states. Janin and Walukiewicz prove the converse: any property which is invariant for bisimulation and MSO-expressible is already expressible in the μ-calculus ([13]). Yet the μ-calculus enjoys many desirable properties which MSO lacks, like a complete sequent-calculus ([29]), an exponential-time decision procedure, and the finite model property ([25]). Switching from MSO to its bisimulation-invariant fragment gives us these desirable properties.In this paper we take a classical logician's view of the μ-calculus. As far as we are concerned a new logic should not be allowed into the community of logics without at least considering the standard questions that any logic is bothered with. In this paper we perform this rite of passage for the μ-calculus. The questions we will be concerned with are the following.
APA, Harvard, Vancouver, ISO, and other styles
2

Abdul-Adheem, Wameedh Riyadh. "Design and simulation of a normalized fuzzy logic controller for the quadruple-tank process." Indonesian Journal of Electrical Engineering and Computer Science 18, no. 1 (April 1, 2020): 227. http://dx.doi.org/10.11591/ijeecs.v18.i1.pp227-234.

Full text
Abstract:
<p class="MsoNormal" style="margin-top: 6.0pt; text-align: justify;">Industrial processes include multivariable systems and nonlinearities. These conditions must be effectively controlled to ensure a stable operation. A proportional–integral–derivative controller and other classical control techniques provide simple design tools to designers, but cannot accommodate nonlinearities in industrial processes. In this study, the quadruple-tank process, which is one of the most widely used processes in the chemical industry, was selected as the research object. To examine this process, a fuzzy logic controller, instead of an exact mathematical model, was proposed to ensure the reliability of the experience. A modification was proposed to facilitate the design process. To check the validity of the proposed controller, it was compared with the conventional proportional–integral controller. The former exhibited acceptable performance.</p><table class="MsoTableGrid" style="width: 444.85pt; border-collapse: collapse; border: none; mso-border-alt: solid windowtext .5pt; mso-yfti-tbllook: 1184; mso-padding-alt: 0cm 5.4pt 0cm 5.4pt;" width="0" border="1" cellspacing="0" cellpadding="0"><tbody><tr style="mso-yfti-irow: 0; mso-yfti-firstrow: yes; mso-yfti-lastrow: yes; height: 63.4pt;"><td style="width: 290.6pt; border: none; border-top: solid windowtext 1.0pt; mso-border-top-alt: solid windowtext .5pt; padding: 0cm 5.4pt 0cm 5.4pt; height: 63.4pt;" valign="top" width="593"><p class="MsoNormal" style="margin-top: 6.0pt; text-align: justify;"><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi;">Industrial processes include multivariable systems and nonlinearities. These conditions <span style="mso-no-proof: yes;">must be effectively</span> controlled to ensure a stable operation. A proportional–integral–derivative controller and other classical control techniques provide <span style="mso-no-proof: yes;">simple</span> design tools to designers, <span style="mso-no-proof: yes;">but</span> cannot accommodate nonlinearities in industrial processes. In this study, the quadruple</span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi; mso-bidi-language: AR-IQ;">-tank process</span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi;">, which is one of the most widely used processes in the chemical industry, was selected as the research object.<span style="mso-spacerun: yes;"> </span>To examine this process, a</span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi; mso-bidi-language: AR-IQ;"> fuzzy logic controller, instead of an </span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi;">exact mathematical model,</span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi;">was<span style="mso-no-proof: yes;"> proposed</span> to ensure the reliability of the experience. </span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi; mso-bidi-language: AR-IQ;">A modification was proposed to facilitate the design process. To check the <span style="mso-no-proof: yes;">validity</span> of the proposed controller, it was compared with the conventional proportional</span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi;">–</span><span style="mso-ascii-font-family: 'Times New Roman'; mso-ascii-theme-font: major-bidi; mso-hansi-font-family: 'Times New Roman'; mso-hansi-theme-font: major-bidi; mso-bidi-font-family: 'Times New Roman'; mso-bidi-theme-font: major-bidi; mso-bidi-language: AR-IQ;">integral <span style="mso-no-proof: yes;">controller. The former exhibited</span> <span style="mso-no-proof: yes;">acceptable</span> performance.</span></p><p class="MsoNormal" style="margin-top: 6.0pt; text-align: justify;"> </p></td></tr></tbody></table>
APA, Harvard, Vancouver, ISO, and other styles
3

CARTON, OLIVIER, THOMAS COLCOMBET, and GABRIELE PUPPIS. "AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS." Journal of Symbolic Logic 83, no. 3 (September 2018): 1147–89. http://dx.doi.org/10.1017/jsl.2018.7.

Full text
Abstract:
AbstractWe develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three logical applications. First, we establish the first known collapse result for the quantifier alternation of MSO logic over countable linear orderings. Second, we solve an open problem posed by Gurevich and Rabinovich, concerning the MSO-definability of sets of rational numbers using the reals in the background. Third, we establish the MSO-definability of the set of yields induced by an MSO-definable set of trees, confirming a conjecture posed by Bruyère, Carton, and Sénizergues.
APA, Harvard, Vancouver, ISO, and other styles
4

Jeandel, Emmanuel, and Guillaume Theyssier. "Subshifts as models for MSO logic." Information and Computation 225 (April 2013): 1–15. http://dx.doi.org/10.1016/j.ic.2013.01.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Droste, Manfred, and Vitaly Perevoshchikov. "Multi-weighted Automata and MSO Logic." Theory of Computing Systems 59, no. 2 (October 27, 2015): 231–61. http://dx.doi.org/10.1007/s00224-015-9658-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Calvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Vardi. "Node Selection Query Languages for Trees." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 3, 2010): 279–84. http://dx.doi.org/10.1609/aaai.v24i1.7598.

Full text
Abstract:
The study of node-selection query languages for (finite) trees has been a major topic in the recent research on query lan- guages for Web documents. On one hand, there has been an extensive study of XPath and its various extensions. On the other hand, query languages based on classical logics, such as first-order logic (FO) or monadic second-order logic (MSO), have been considered. Results in this area typically relate an Xpath-based language to a classical logic. What has yet to emerge is an XPath-related language that is expressive as MSO, and at the same time enjoys the computational proper- ties of XPath, which are linear query evaluation and exponen- tial query-containment test. In this paper we propose μXPath, which is the alternation-free fragment of XPath extended with fixpoint operators. Using two-way alternating automata, we show that this language does combine desired expressiveness and computational properties, placing it as an attractive can- didate as the definite query language for trees.
APA, Harvard, Vancouver, ISO, and other styles
7

Gastin, Paul, Amaldev Manuel, and R. Govind. "Reversible Regular Languages: Logical and Algebraic Characterisations." Fundamenta Informaticae 180, no. 4 (June 30, 2021): 333–50. http://dx.doi.org/10.3233/fi-2021-2045.

Full text
Abstract:
We present first-order (FO) and monadic second-order (MSO) logics with predicates ‘between’ and ‘neighbour’ that characterise the class of regular languages that are closed under the reverse operation and its subclasses. The ternary between predicate bet(x, y, z) is true if the position y is strictly between the positions x and z. The binary neighbour predicate N(x, y) is true when the the positions x and y are adjacent. It is shown that the class of reversible regular languages is precisely the class definable in the logics MSO(bet) and MSO(N). Moreover the class is definable by their existential fragments EMSO(bet) and EMSO(N), yielding a normal form for MSO formulas. In the first-order case, the logic FO(bet) corresponds precisely to the class of reversible languages definable in FO(<). Every formula in FO(bet) is equivalent to one that uses at most 3 variables. However the logic FO(N) defines only a strict subset of reversible languages definable in FO(+1). A language-theoretic characterisation of the class of languages definable in FO(N), called locally-reversible threshold-testable (LRTT), is given. In the second part of the paper we show that the standard connections that exist between MSO and FO logics with order and successor predicates and varieties of finite semigroups extend to the new setting with the semigroups extended with an involution operation on its elements. The case is different for FO(N) where we show that one needs an additional equation that uses the involution operator to characterise the class. While the general problem of characterising FO(N) is open, an equational characterisation is shown for the case of neutral letter languages.
APA, Harvard, Vancouver, ISO, and other styles
8

Echeverría, Martin. "Experiencing Political Advertising Through Social Media Logic: A Qualitative Inquiry." Media and Communication 11, no. 2 (May 16, 2023): 127–36. http://dx.doi.org/10.17645/mac.v11i2.6412.

Full text
Abstract:
<span style="font-size: 10.0pt; mso-bidi-font-size: 11.0pt; line-height: 107%; font-family: 'Calibri',sans-serif; mso-fareast-font-family: Calibri; mso-bidi-font-family: 'Times New Roman'; mso-ansi-language: EN-US; mso-fareast-language: EN-US; mso-bidi-language: AR-SA;" lang="EN-US">The allocation of political advertising in social media is rising in Western campaigns. Yet audiences, unlike those of television advertising, are no longer isolated and passive consumers of linear discourses from politicians; users can now interact, share, and merge political advertising with other messages. Literature has dealt with the effects of such affordances separately, yet not in an integrative, holistic way that makes it possible to observe how they interact with each other. Hence, this article explores qualitatively how users experience, engage with, and make sense of political advertising in social media, and how its affordances mediate the attitudes, responses, and meanings users bring to political advertising and its sponsors. Under the lenses of the theory of social media logic, which points out the properties of social media—popularity, programmability, datafication, and connectivity—that structure users’ experiences, we conducted six focus group sessions with Mexican users (<em>n</em> = 34) during the 2021 federal campaigns. Findings show the fuzziness of digital advertising for users, which blurs with other formats like infographics or memes, the crucial role of individual linkages for advertising attention and attitude formation, a mismatch between the platform’s political feed and citizens’ information needs, and the tactics users perform to tame or avoid political content, disengaging them from campaigns.</span>
APA, Harvard, Vancouver, ISO, and other styles
9

Vazquez Gonzalez, Jose Luis, Juan Barrios Aviles, Alfredo Rosado Muñoz, and Ruben Alejos Palomares. "An Industrial Automation Course: Common Infrastructure for Physical, Virtual and Remote Laboratories for PLC Programming." International Journal of Online Engineering (iJOE) 14, no. 08 (August 30, 2018): 4. http://dx.doi.org/10.3991/ijoe.v14i08.8758.

Full text
Abstract:
<span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-fareast-font-family: 'Times New Roman'; mso-ansi-language: EN-US; mso-fareast-language: DE; mso-bidi-language: AR-SA;">This work describes the development of a teaching strategy to leverage current simulation tools and promote learning of industrial automation systems. Specifically, Programmable Logic Controller (PLC) programming in an industrial automation course. We propose an infrastructure where it is possible to work with physical, virtual and mixed laboratories</span>
APA, Harvard, Vancouver, ISO, and other styles
10

Attia, Hussain. "Fuzzy Logic Controller Effectiveness Evaluation through Comparative Memberships for Photovoltaic Maximum Power Point Tracking Function." International Journal of Power Electronics and Drive Systems (IJPEDS) 9, no. 3 (September 1, 2018): 1147. http://dx.doi.org/10.11591/ijpeds.v9.i3.pp1147-1156.

Full text
Abstract:
<span style="color: black; font-family: 'Times New Roman',serif; font-size: 9pt; mso-fareast-font-family: 'Times New Roman'; mso-ansi-language: EN-US; mso-fareast-language: EN-US; mso-bidi-language: AR-SA; mso-bidi-font-style: italic;">Maximum Power Point Tracking (MPPT) is an important objective needed to gain maximum power from solar photovoltaic panel during the weather condition variation. Many studies and solutions are proposed in literature, most of them focus on the type of algorithm which adopted for MPP tracking through using same driver i.e. DC-DC Boost converter. Among these algorithms, Fuzzy Logic Controller (FLC) demonstrates high quality performance by fast tracking response and robust effectiveness. This paper proposes a FLC by a new harmony of the input and the output variables through comparative study to the controller tracking behavior. To track the MPP, the proposed solution controls the change of duty cycle for PWM gate drive pulses width variation to drive the designed Buck-Boost DC-DC converter. MATLAB/Simulink software is selected to simulate the introduced controller. The simulation results are reflecting the promising indications to adopt the presented proposal as an effective MPPT system for practical applications.</span>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "MSO logic"

1

Baschenis, Félix. "Minimizing resources for regular word transductions." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0810/document.

Full text
Abstract:
Cette thèse a eu pour objectif d'étudier des questions naturelles de définissabilité autour des transducteurs bidirectionnels.Il est bien connu que les transducteurs bidirectionnels définissent une plus grande classe de transductions que celles des transducteurs unidirectionnels. La première question que nous avons étudiée est donc de décider si un transducteur bidirectionnel est définissable par un transducteur unidirectionnel. Il a été montré en 2013 que cette question est décidable pour des transducteurs fonctionnels (nous montrons aussi en paralèlle que cette question devient indécidable si les transducteurs ne sont plus fonctionnels) mais la complexité de la procédure de décision était non-élémentaire.Nous proposons une caractérisation de la "définissabilité par transducteur unidirectionnel" décidable en espace doublement exponentiel. Cette caractérisation est effective en ce sens qu'elle produit en temps triplement exponentiel le transducteur équivalent. De plus, nous avons étudié ce problème aussi pour les transducteurs "sweeping", pour lesquels la procédure de décision et la construction du transducteur équivalent requièrent une exponentielle de moins. Comme nous avons par ailleurs montré qu'il existe des familles de fonctions réalisables de façon unidirectionnelle avec au minimum deux sauts exponentiels, notre procédure est optimale dans le cas "sweeping".Le fait d'avoir particulièrement étudié les transducteurs"sweeping" nous a poussé à étudier d'autres questions dedéfinissabilité~: est-ce qu'un transducteur donné estréalisable par un transducteur sweeping ? Et par un transducteursweeping réalisant au maximum k passages ? Nous montrons que cesquestions sont décidables avec les mêmes complexitésobtenues précédemment. Comme nous avons montré qu'ilexiste une borne sur le nombre de passages nécéssaires pourréaliser avec un transducteur sweeping une transductiondonnée, cela nous permet aussi de minimiser le nombre de passages d'untransducteur sweeping.Enfin nous avons cherché à caractériser la classe destransductions sweeping dans d'autres modèles de transductions,les Streaming String Transducers (SST) et lestransductions MSO. Cela a en autres permis, en établissant unecorrespondance entre le nombre de passages des transducteurssweeping et le nombre de registres d'une sous-classe de SST, deminimiser le nombre de registres pour une classe intéressantede SST. Dans l'ensemble, notre travail a permis de couvrir l'ensembledes relations entre ces modèles, et les questions dedéfinissabilité qui se posent naturellement
The goal of this thesis was to study definability questionsabout finite-state transducers and in particular two-waytransducers. It is known that two-way transducers cover a larger classof transductions than one-way transducers. Then the first question wetackled is the one-way definability problem: is it possible torealize a given two-way transduction by a one-way transducer? Thisproblem was shown to be decidable for functionaltransducers (we also show as a side result that one-way definability becomes undecidable for non-functional transducers) but the decision procedure had non-elementary complexity.We proposed a characterization of one-way definability thatallows us to decide it in double-exponential space, and provide anequivalent one-way transducer of triple-exponential size. We firststudied this question for a restricted class, namely sweepingtransducers, for which the decision procedure and the construction ofthe one-way transducer take one less exponential. For suchtransducers, our procedure is optimal in the sense that we have shownthat there exists a family of functions that are one-way definable andfor which an equivalent one-way transducer requires doubly exponentialsize.The study of sweeping transducers raised other definability questions: Is a given transducer equivalent to some sweeping transducer? And to some sweeping transducer that performs at most k passes? We showed that those questions are decidable and the decision procedure, as well as the equivalent transducer, have the same complexity as in the one-way case. Moreover, as we have shown that there exists a bound on the number of passes required to realize a transduction by a sweeping transducer, we managed to obtain a procedure to minimize the number of passes of a sweeping transducer.Finally we tried to characterize sweeping transducers in other models for regular transductions such as Streaming String transducers (SST) and MSO transductions. As we obtained an equivalence between the number of passes of a sweeping transducer and the number of registers of the equivalent SST we provided a minimization procedure for the number of registers of a large class of SST's. To conclude, our work allowed us to provide a good overall understanding of the definability questions between the models for regular transductions and in particular regarding the resources, whether it is the number of passes (and of course one-way definability is crucial in that aspect) or the number of registers
APA, Harvard, Vancouver, ISO, and other styles
2

Götze, Doreen. "Weighted Unranked Tree Automata over Tree Valuation Monoids." Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-221154.

Full text
Abstract:
Quantitative aspects of systems, like the maximal consumption of resources, can be modeled by weighted automata. The usual approach is to weight transitions with elements of a semiring and to define the behavior of the weighted automaton by mul- tiplying the transition weights along a run. In this thesis, we define and investigate a new class of weighted automata over unranked trees which are defined over valuation monoids. By turning to valuation monoids we use a more general cost model: the weight of a run is now determined by a global valuation function. Besides the binary cost functions implementable via semirings, valuation functions enable us to cope with average and discounting. We first investigate the supports of weighted unranked tree automata over valuation monoids, i.e., the languages of all words which are evalu- ated to a non-zero value. We will furthermore consider the support of several other weighted automata models over different structures, like words and ranked trees. Next we prove a Nivat-like theorem for the new weighted unranked tree automata. More- over, we give a logical characterization for them. We show that weighted unranked tree automata are expressively equivalent to a weighted MSO logic for unranked trees. This solves an open problem posed by Droste and Vogler. Finally, we present a Kleene- type result for weighted ranked tree automata over valuation monoids.
APA, Harvard, Vancouver, ISO, and other styles
3

Suresh, Amrita. "Formal Verification of Communicating Automata." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG092.

Full text
Abstract:
Les systèmes distribués concernent des processus qui s’exécutent indépendamment et communiquent de manière asynchrone. Bien qu’ils couvrent un large éventail de cas d’utilisation et soient donc omniprésents dans notre monde, il est particulièrement difficile de garantir leur exactitude. Dans cette thèse, nous modélisons de tels systèmes en utilisant une formulation mathématique et logique, et nousles vérifions algorithmiquement. En particulier, nous nous concentrons sur les automates FIFO (First In First Out), et plus précisément sur des systèmes à un ou plusieurs automates finis qui communiquent via des canaux FIFO fiables pouvant contenir des mots de longueur arbitrairement grande. Comme la plupart des problèmes de vérification sont connus pour être indécidables pour les automates FIFO, nous nous concentrons sur diverses sous-classes et approximations du modèle. Le premier modèle que nous considérons est celui des systèmes de transition bien structurés sur les branches d’états accessibles (branch-WSTS), une classe qui inclut strictement la classe des WSTS. Nous étudions les problèmes de finitude des canaux et de terminaison pour de tels systèmes, et nous en montrons quelques exemples. Nous définissons également une autre classe de systèmes où la condition de monotonie est relâchée et nous montrons qu’une variante du problème de couerture est décidable sous des conditions naturelles d’effectivité. Nous étudions ensuite la restriction de la limitation de l’entrée (input-boundedness) sur les canaux FIFO et nous montrons que l’accessibilité rationnelle et diverses autres propriétés sont décidables pour les automates FIFO. Ce faisant, nous répondons à une question ouverte concernant l’accessibilité des automates FIFO limités en entrée. Nous dérivons également certaines bornes de complexité en considérant le cas le plus simple, un automate FIFO avec un seul canal. Une autre restriction que nous étudions est la synchronisabilité dans les systèmes communicants. En particulier, nous étudions cette notion pour les MSCs (Message Sequence Charts), qui est un modèle pour représenter les exécutions d’un système communicant. Nous montrons que si un ensemble quelconque de MSC satisfait les deux propriétés suivantes, à savoir la définissabilité MSO (Monadic Second-order Logic) et la (spécial) largeur d’arbre (tree-width) bornée, alors la synchronisabilité est décidable. De plus, l’accessibilité et le model checking sont également décidables dans ce cadre. Nous unifions alors certaines classes de la littérature à l’aide de ce cadre, et pour certaines autres classes, nous montrons leur indécidabilité
Distributed systems involve processes that run independently and communicate asynchronously. While they capture a wide range of use cases and are hence, ubiquitous in our world, it is also particularly difficult to ensure their correctness. In this thesis, we model such systems using mathematical and logical formulation, and try to algorithmically verify them. In particular, we focus on FIFO (First In First Out) machines, with one or more finite-state machines communicating via unbounded reliable FIFO buffers.As most verification problems are known to be undecidable for FIFO machines, we focus on various subclasses and approximations of the model. The first model we consider are branch-well structured transition systems (branch-WSTS), a class which strictly includes the well-known class of WSTS. We study the problems of boundedness and termination for such systems, and demonstrate some examples of them. We also define another class of systems where the monotony condition is relaxed and show that a variant of the coverability problem is decidable under effectivity conditions.We then study the restriction of input-boundedness on FIFO machines, and show that rational reachability and various other properties are decidable for FIFO machines under the input-bounded restriction. In doing so, we answer a long standing open question regarding the reachability for input-bounded FIFO machines. We also derive some complexity bounds by considering the simplest case, a FIFO machine with a single channel.Another restriction that we study is synchronizability in communicating systems. In particular, we study this notion for MSCs (Message Sequence Charts), which is a model to represent executions of a communicating system. We show that if any set of MSCs can satisfy two properties, namely MSO (Monadic Second-order Logic) definability and bounded (special-)tree width, then synchronizability is decidable. Moreover, reachability and model-checking are also decidable within this framework. We also unify some classes from the literature using this framework, and for some other classes, show their undecidability
APA, Harvard, Vancouver, ISO, and other styles
4

Mohan, Ashwin. "A fuzzy controller developed in RSLogix 5000 using ladder logic and function blocks implemented on a Control Logix PLC /." free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p1420941.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Srinivasan, Venkataramanujam. "Gigahertz-Range Multiplier Architectures Using MOS Current Mode Logic (MCML)." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9643.

Full text
Abstract:
The tremendous advancement in VLSI technologies in the past decade has fueled the need for intricate tradeoffs among speed, power dissipation and area. With gigahertz range microprocessors becoming commonplace, it is a typical design requirement to push the speed to its extreme while minimizing power dissipation and die area. Multipliers are critical components of many computational intensive circuits such as real time signal processing and arithmetic systems. The increasing demand in speed for floating-point co-processors, graphic processing units, CDMA systems and DSP chips has shaped the need for high-speed multipliers. The focus of our research for modern digital systems is two fold. The first one is to analyze a relatively unexplored logic style called MOS Current Mode Logic (MCML), which is a promising logic technique for the design of high performance arithmetic circuits with minimal power dissipation. The second one is to design high-speed arithmetic circuits, in particular, gigahertz-range multipliers that exploit the many attractive features of the MCML logic style. A small library of MCML gates that form the core components of the multiplier were designed and optimized for high-speed operation. The three 8-bit MCML multiplier architectures designed and simulated in TSMC 0.18 mm CMOS technology are: 3-2-tree architecture with ripple carry adder (Architecture I), 4-2-tree design with ripple carry adder (Architecture II) and 4-2-tree architecture with carry look-ahead adders (Architecture III). Architecture I operates with a maximum throughput of 4.76 GHz (4.76 Billion multiplications per second) and a latency of 3.78 ns. Architecture II has a maximum throughput of 3.3 GHz and a latency of 3 ns and Architecture III has a maximum throughput of 2 GHz and a latency of 3 ns. Architecture I achieves the highest throughput among the three multipliers, but it incurs the largest area and latency, in terms of clock cycle count as well as absolute delay. Although it is difficult to compare the speed of our multipliers with existing ones, due to the use of different technologies and different optimization goals, we believe our multipliers are among the fastest found in contemporary literature.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
6

Maestro, Izquierdo Marcos. "Analysis of the Resistive Switching phenomenon in MOS devices for memory and logic applications." Doctoral thesis, Universitat Autònoma de Barcelona, 2017. http://hdl.handle.net/10803/405453.

Full text
Abstract:
En general, la continua evolución de la tecnología ha llevado a afrontar nuevos retos emergentes. En cuanto al campo de la electrónica, uno de los más relevantes ha sido la ley de Moore que postula que "el número de transistores en un circuito integrado se duplica aproximadamente cada dos años". Para cumplir esta ley, la solución ha sido reducir las dimensiones de los dispositivos. Sin embargo, en las últimas décadas se han alcanzado limitaciones físicas debido a que la disminución de las dimensiones está alcanzando el rango atómico. Se han observado además problemas debidos al escalamiento del dispositivo tales como efectos de canal corto en MOSFET. Por ello, la comunidad científica se ha centrado en la exploración de nuevos materiales, alternativas estructuras de dispositivo o diferentes fenómenos que superen los diferentes problemas debidos l escalado. En cuanto a los fenómenos alternativos, uno de los más relevantes ha sido el fenómeno de Resistive Switching (RS) que ha mostrado características prometedoras para ser implementado en muchas aplicaciones. Este fenómeno se basa en la capacidad de una capa dieléctrica para cambiar su resistencia (o conductividad) entre dos o más valores, que muestran un comportamiento no volátil, bajo la acción de un campo eléctrico. Estas características hacen que este fenómeno sea muy prometedor para su aplicación en: lógica digital, donde surge un nuevo paradigma de computación basado en este fenómeno; en el desarrollo de redes neuronales artificiales, que emulan el comportamiento de la parte neuronal conocida como sinapsis o memoria como la próxima generación de memorias no volátiles. Sin embargo, a pesar de los grandes esfuerzos de la comunidad científica en la última mitad de siglo, hay varios temas candentes, tales como la comprensión profunda de RS, el análisis de los problemas de fiabilidad que afectan el comportamiento de RS o la investigación sobre nuevas aplicaciones de dispositivos basados ​​en RS, en los que queda mucho trabajo por hacer. Por lo tanto, en esta tesis, se ha estudiado el fenómeno RS tanto a nivel de dispositivo, para analizar el fenómeno en sí mismo, como a nivel de circuito, para analizar su aplicación como memorias y en operaciones digitales. Inicialmente, el fenómeno se ha estudiado experimentalmente en transistores MOSFET analizando el efecto de la polaridad de tensión aplicada para provocar RS sobre el cambio de resistencia dieléctrica. Además, debido al carácter localizado del fenómeno, se han analizado las diferentes contribuciones involucradas en la conducción a través del dieléctrico y la posibilidad de controlar la localización de dichas contribuciones. A continuación, se ha estudiado RS en memristores con una capa dieléctrica basada en HfO2. Concretamente, se ha estudiado el fenómeno aplicando rampas de tensión rápidas para provocar los cambios de resistencia con el fin de analizar la influencia de la velocidad de rampa de tensión en los parámetros RS. Además, se han propuesto sistemas experimentales y métodos de caracterización mejorados para analizar el random telegraph noise (RTN) asociado a RS. Después, se han investigado los memristores con una capa dieléctrica basada en SiO como dispositivos de memoria y selección realizando diferentes análisis DC y AC para corroborar la viabilidad de tales dispositivos para esas aplicaciones. Finalmente, se han estudiado los memristores como el elemento principal para diseñar puertas lógicas, específicamente, para implementar las puertas lógicas IMPLY y NAND. Se ha llevado a cabo la demostración experimental del funcionamiento de ambas puertas lógicas así como el estudio experimental del comportamiento transitorio de los memristores implicados en la puerta IMPLY con el fin de analizar que sucede durante la operación lógica.
In general, the continuous evolution, and improvement, of the technology has led to face new emerging challenges. Regarding the electronic field, one of the most relevant has been the Moore’s law which postulates “the number of transistors in a dense integrated circuit doubles approximately every two years”. To accomplish this postulate, the solution has been reducing the device dimensions. However, in last decades, physical limitations have been reached since device dimensions are in the atomic range. Moreover, problems originated from the device scaling such as short channel effects in MOSFETs have been observed. Consequently, the focus of the scientific community has turned into the exploration of alternative device materials and structures or different phenomena that would overcome the different issues owing to the scaling. Concerning alternative phenomena, one of the most relevant has been the Resistive Switching (RS) phenomenon which has shown promising features to be implemented in many applications. This phenomenon is based on the capability of a dielectric layer to change its resistance (or conductivity) between two or more values, which show a non-volatile behavior, under the action of an electric field. Overall, these characteristics makes this phenomenon very suitable and promising for its application in digital logic where a new paradigm of computation based on this phenomenon is emerging, in the development of artificial neural networks emulating the behavior of the neuron part known as synapse, and in memory like the next generation of non-volatile memories. However, despite the great efforts of the scientific community in last half a century, there are several hot topics such as the deeper RS understanding, the analysis of reliability issues affecting RS behavior or the investigation on new applications of RS based devices in which much more work must be done. In this way, the goal of this thesis has been focused on increasing the RS phenomenon knowledge and studying its feasibility for different applications. Hence, RS phenomenon has been study both at device level, to analyze the phenomenon itself, and at circuit level, to analyze its application in memory and digital fields. Initially, the phenomenon has been experimentally studied on MOSFET transistors analyzing the effect on the dielectric resistance change of the voltage polarity applied to provoke RS. Furthermore, due to the localized character of the phenomenon, the different current contributions involved in the conduction through the dielectric and the control of those current contributions have been analyzed. Then, RS has been studied on memristors with a dielectric layer based on HfO2. Here, the phenomenon has been studied applying fast voltage ramps to provoke the resistance changes to analyze the influence of the voltage ramp speed on the RS parameters. In addition, enhanced experimental setups and characterization methods have been proposed to analyze the RTN associated to RS. In addition, memristors with a SiO-based dielectric layer have been investigated as memory and selector devices by performing different DC and pulsed analysis to corroborate the feasibility of such devices for these applications. Finally, the application of memristors in digital field have been performed. Memristors have been used as the main element to design logic gates, specifically, to implement material implication-based (IMPLY) and NAND gates. Then, the experimental demonstration of both memristor-based logic gates (IMPLY and NAND) performance has been carried out. In addition, the transient behavior of memristors involved in the IMPLY gate have been experimentally studied in order to analyze what happens to memristors during the operation.
APA, Harvard, Vancouver, ISO, and other styles
7

Khordoc, Karim. "A MOS switch-level simulator with delay calculation /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kirawanich, Phumin. "Fuzzy logic control for an active power line conditioner /." free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3060114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Hoon-Kyeu. "An automatic test pattern generation in the logic gate level circuits and MOS transistor circuits at Ohio University." Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183139647.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ramirez, Carlos. "Meso-machining of miniature space system components." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2007. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "MSO logic"

1

Warskel, Glynn. Models and logic of MOS circuits. Cambridge: University of Cambridge, Computer Laboratory, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Corporation, Toshiba. L-MOS (logic MOS) TC4S/TC7S/TC3W/TC4W/TC7W series: Data book. Tokyo: Toshiba Corporation, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Graham, A. C. Later Mohist logic, ethics, and science. Hong Kong: Chinese University Press, Chinese University of Hong Kong, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Badel, Stéphane, Can Baltaci, Alessandro Cevrero, and Yusuf Leblebici. Design Automation for Differential MOS Current-Mode Logic Circuits. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-91307-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cheng, Stephen Shao-chung. MOS digital electronics. Singapore: World Scientific, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Alioto, Massimo, and Gaetano Palumbo. Model and Design of Bipolar and MOS Current-Mode Logic. Boston, MA: Springer US, 2005. http://dx.doi.org/10.1007/1-4020-2888-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Instruments, Texas. High-speed CMOS logic data book: Silicon-gate Complementary MOS. (s.l.): Texas Instruments, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

The worlds of possibility: Modal realism and the semantics of modal logic. Oxford: Clarendon Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tshad ma sde bdun mdo daṅ bcas paʼi gzuṅ lugs rgya mtshor ʼjug paʼi gru gziṅs. [Lhasa]: Bod-ljoṅs mi dmaṅs dpe skrun khaṅ, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tenzin, Wangyal, ed. Unbounded wholeness: Dzogchen, Bon, and the logic of the nonconceptual. New York, N.Y: Oxford University Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "MSO logic"

1

Antonopoulos, Timos, and Anuj Dawar. "Separating Graph Logic from MSO." In Foundations of Software Science and Computational Structures, 63–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00596-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Faella, Marco, and Gennaro Parlato. "Reasoning About Data Trees Using CHCs." In Computer Aided Verification, 249–71. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13188-2_13.

Full text
Abstract:
AbstractReasoning about data structures requires powerful logics supporting the combination of structural and data properties. We define a new logic called Mso-D(Monadic Second-Order logic with Data) as an extension of standard Mso on trees with predicates of the desired data logic. We also define a new class of symbolic data tree automata (Sdtas) to deal with data trees using a simple machine. Mso-D and Sdtas are both Turing-powerful, and their high expressiveness is necessary to deal with interesting data structures. We cope with undecidability by encoding Sdta executions as a system of CHCs (Constrained Horn Clauses), and solving the resulting system using off-the-shelf solvers. We also identify a fragment of Mso-D whose satisfiability can be effectively reduced to the emptiness problem for Sdtas. This fragment is very expressive since it allows us to characterize a variety of data trees from the literature, solving certain infinite-state games, etc. We implement this reduction in a prototype tool that combines an Mso decision procedure over trees (Mona) with a CHC engine (Z3), and use this tool to conduct several experiments, demonstrating the effectiveness of our approach across different problem domains.
APA, Harvard, Vancouver, ISO, and other styles
3

Dawar, Anuj, and Luc Segoufin. "Capturing MSO with One Quantifier." In Fields of Logic and Computation II, 142–52. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23534-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Droste, Manfred, and Vitaly Perevoshchikov. "Multi-weighted Automata and MSO Logic." In Computer Science – Theory and Applications, 418–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38536-0_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Törmä, Ilkka. "Subshifts, MSO Logic, and Collapsing Hierarchies." In Advanced Information Systems Engineering, 111–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44602-7_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kaiser, Łukasz. "Cardinality Quantifiers in MSO on Trees." In Logic and Games on Automatic Structures, 95–107. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22807-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Skrzypczak, Michał. "Connecting Decidability and Complexity for MSO Logic." In Developments in Language Theory, 75–79. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62809-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morawietz, Frank, and Tom Cornell. "The MSO Logic-Automaton Connection in Linguistics." In Logical Aspects of Computational Linguistics, 112–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48975-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kaiser, Łukasz. "Cardinality Quantifiers in MSO on Linear Orders." In Logic and Games on Automatic Structures, 79–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22807-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

de Oliveira Oliveira, Mateus. "Causality in Bounded Petri Nets is MSO Definable." In Logic, Language, Information, and Computation, 200–214. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-52921-8_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "MSO logic"

1

Riba, Colin. "Forcing MSO on Infinite Words in Weak MSO." In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Carreiro, Facundo, Alessandro Facchini, Yde Venema, and Fabio Zanasi. "Weak MSO." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2603088.2603101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bojanczyk, Mikolaj, Edon Kelmendi, and Michal Skrzypczak. "MSO+∇ is undecidable." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Niewerth, Matthias. "MSO Queries on Trees." In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3209108.3209144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Losemann, Katja, and Wim Martens. "MSO queries on trees." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2603088.2603137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Das, Anupam, and Colin Riba. "A Complete Axiomatization of MSO on Infinite Trees." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Montanari, Angelo, and Gabriele Puppis. "A Contraction Method to Decide MSO Theories of Deterministic Trees." In 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). IEEE, 2007. http://dx.doi.org/10.1109/lics.2007.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Y., D. H. Kim, A. Kostrzewski, and George Eichmann. "Optoelectronic content addressable memory-based modified signed digit arithmetic." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/oam.1989.tumm3.

Full text
Abstract:
The modified signed digit (MSD) number system offers inherent low interdigit dependence for arithmetic processing. Recently, using both optical logic and memory based approaches, various optical MSD arithmetic schemes were proposed. For the logic based optical MSD arithmetic, an existing approach implements a three-stage processing algorithm with either a symbolic substitution processor or some binary logic elements, such as bistable etalons. Because of the use of multiple processing stages, the required computing energy and its speed is sacrificed. The optical memory based approach, on the other hand, utilizes a single-stage content addressable memory (CAM) for a fast MSD arithmetic. However, the existing holographic CAM is difficult to implement. In this talk, a new nonholographic CAM scheme for a single-stage MSD addition processing is proposed and demonstrated. A position encoded 18 × 56 pixel CAM mask is used in an angularly multiplexed geometry for a parallel CAM matching operation. Electronic logic inverters are used as the output devices.
APA, Harvard, Vancouver, ISO, and other styles
9

Limqueco, Johnson Chan, and Saburo Muroga. "Logic optimization of MOS networks." In the 28th conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/127601.127713.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Flannery, David L., L. Maugh Vail, and Steven C. Gustafson. "Circulating Packet Threshold Logic To Implement Msd Logic Modules." In 30th Annual Technical Symposium, edited by William J. Miceli. SPIE, 1986. http://dx.doi.org/10.1117/12.976271.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "MSO logic"

1

Küsters, Ralf, and Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.

Full text
Abstract:
Computing the most specific concept (msc) is an inference task that can be used to support the 'bottom-up' construction of knowledge bases for KR systems based on description logics. For description logics that allow for number restrictions or existential restrictions, the msc need not exist, though. Previous work on this problem has concentrated on description logics that allow for universal value restrictions and number restrictions, but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential restrictions. More precisely, we show that, for the description logic ALE (which allows for conjunction, universal value restrictions, existential restrictions, negation of atomic concepts) the msc of an ABox-individual only exists in case of acyclic ABoxes. For cyclic ABoxes, we show how to compute an approximation of the msc. Our approach for computing the (approximation of the) msc is based on representing concept descriptions by certain trees and ABoxes by certain graphs, and then characterizing instance relationships by homomorphisms from trees into graphs. The msc/approximation operation then mainly corresponds to unraveling the graphs into trees and translating them back into concept descriptions.
APA, Harvard, Vancouver, ISO, and other styles
2

Baader, Franz. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.139.

Full text
Abstract:
In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, but it was not clear whether this characterization yields decidability of the existence problem. In the present paper, we develop a common graph-theoretic generalization of these characterizations, and show that the resulting property is indeed decidable, thus yielding decidability of the existence of the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
3

Peñaloza, Rafael, and Anni-Yasmin Turhan. Completion-based computation of most specific concepts with limited role-depth for EL and Prob-EL⁰¹. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.176.

Full text
Abstract:
In Description Logics the reasoning service most specific concept (msc) constructs a concept description that generalizes an ABox individual into a concept description. For the Description Logic EL the msc may not exist, if computed with respect to general EL-TBoxes or cyclic ABoxes. However, it is still possible to find a concept description that is the msc up to a fixed role-depth, i.e. with respect to a maximal nesting of quantifiers. In this report we present a practical approach for computing the roledepth bounded msc, based on the polynomial-time completion algorithm for EL. We extend these methods to Prob-EL⁰¹c , which is a probabilistic variant of EL. Together with the companion report [9] this report devises computation methods for the bottom-up construction of knowledge bases for EL and Prob-EL⁰¹c .
APA, Harvard, Vancouver, ISO, and other styles
4

Zarrieß, Benjamin, and Anni-Yasmin Turhan. Most Specific Generalizations w.r.t. General EL-TBoxes. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.196.

Full text
Abstract:
In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general EL-TBox neither the lcs nor the msc need to exist. So far in this setting no exact conditions for the existence of lcs- or msc-concepts are known. This report provides necessary and suffcient conditions for the existence of these two kinds of concepts. For the lcs of a fixed number of concepts and the msc we show decidability of the existence in PTime and polynomial bounds on the maximal roledepth of the lcs- and msc-concepts. The latter allows to compute the lcs and the msc, respectively.
APA, Harvard, Vancouver, ISO, and other styles
5

Distel, Felix. Model-based Most Specific Concepts in Description Logics with Value Restrictions. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.167.

Full text
Abstract:
Non-standard inferences are particularly useful in the bottom-up construction of ontologies in description logics. One of the more common non-standard reasoning tasks is the most specific concept (msc) for an ABox-individual. In this paper we present similar non-standard reasoning task: most specific concepts for models (model-mscs). We show that, although they look similar to ABox-mscs their computational behaviour can be different. We present constructions for model-mscs in FL₀ and FLE with cyclic TBoxes and for ALC∪∗ with acyclic TBoxes. Since subsumption in FLE with cyclic TBoxes has not been examined previously, we present a characterization of subsumption and give a construction for the least common subsumer in this setting.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'MSO logic' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography