Thematische Bibliographien / MSO logic

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „MSO logic“

Autor: Grafiati
Veröffentlicht am 25. Mai 2024
Zuletzt aktualisiert am 31. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "MSO logic" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "MSO logic"

1

Droste, Manfred, Werner Kuich, and George Rahonis. "Multi-Valued MSO Logics OverWords and Trees." Fundamenta Informaticae 84, no. 3-4 (2008): 305–27. https://doi.org/10.3233/fun-2008-843-402.

Der volle Inhalt der Quelle
Annotation:
We introduce multi-valued Büchi and Muller automata over distributive lattices and a multi-valued MSO logic for infinite words. For this logic, we prove the expressive equivalence of ω-recognizable and MSO-definable infinitary formal power series over distributive lattices with negation function. Then we consider multi-valued Muller tree automata and a multi-valued MSO logic for trees over distributive lattices. For this logic, we establish a version of Rabin's theorem for infinitary tree series.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
Annotation:
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 distingu
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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 (2020): 227. http://dx.doi.org/10.11591/ijeecs.v18.i1.pp227-234.

Der volle Inhalt der Quelle
Annotation:
<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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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 (2010): 279–84. http://dx.doi.org/10.1609/aaai.v24i1.7598.

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
Annotation:
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 existen
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
Annotation:
<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.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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 (2018): 4. http://dx.doi.org/10.3991/ijoe.v14i08.8758.

Der volle Inhalt der Quelle
Annotation:
<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 und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "MSO logic"

1

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

Der volle Inhalt der Quelle
Annotation:
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 s
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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 im
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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

Der volle Inhalt der Quelle
Annotation:
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 communiqu
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
Annotation:
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 ne
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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 de
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Lindberg, Jordan J. "Language, logic, knowledge, and reality : the logical atomisms of Russell and Wittgenstein /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9842548.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "MSO logic"

1

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

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Tshe-dbaṅ, Dge-bśes. Tshad ma sde bdun mdo dang bcas paʼi gzhung lugs rgya mtshor ʼjug paʼi gru gzings. Bod-ljongs mi dmangs dpe skrun khang, 2014.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Bkra-śis-lhun-po Monastery (Bylakuppe, India). Dpe-mdzod-khaṅ, ред. Mdo daṅ rnam ʼgrel sbyar baʼi ʼphros don mtshams sbyar tshad mar gyur paʼi legs bśad kyi rgyan ces bya ba bźugs so. Chos-grwā Chen-po Bkra-śis Lhun-poʼi Dpe-mdzod-khaṅ nas par skrun źus, 1997.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Thugs-rje-dpal-bzaṅ. Sde bdun mdo daṅ bcas paʼi dgoṅs ʼgrel Tshad ma rigs paʼi gter gyi ʼgrel pa rigs lam rab gsal: A commentary on the Tshad ma rigs gter of Sa-skya Paṇḍita Kun-dgaʼ-rgyal-mtshan. Sakya College, 1985.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "MSO logic"

1

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

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Pallen, Rémi, and Ilkka Törmä. "Multidimensional Tilings and MSO Logic." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-95908-0_26.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "MSO logic"

1

Choudhury, Debalina Roy, Ashish Dhakar, Rajneesh Chaurasiya, and Goutam Kumar Gupta. "MOS Transistor-Based Memristor Emulator for Realization of Universal Logic Gates." In 2024 IEEE Silchar Subsection Conference (SILCON). IEEE, 2024. https://doi.org/10.1109/silcon63976.2024.10910456.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Bhaskar, Ruchi, Bharat Choudhary, Rajesh Saha, and Dheeraj Singh Rajpiut. "Improved MOS Current Mode Logic based Tri-state Buffer using DTMOS and its Applications." In 2025 IEEE Open Conference of Electrical, Electronic and Information Sciences (eStream). IEEE, 2025. https://doi.org/10.1109/estream66938.2025.11016857.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603101.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603137.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
Annotation:
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 ot
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "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.

Der volle Inhalt der Quelle
Annotation:
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 precise
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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-theor
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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 th
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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 polynom
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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 b
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "MSO logic" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie