Search results for "MSO"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
107	Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso, Mayank Saksena	Regular Model Checking for LTL(MSO).	CAV	2004	DBLP DOI BibTeX RDF
107	Petr Hlinený	On Matroid Properties Definable in the MSO Logic.	MFCS	2003	DBLP DOI BibTeX RDF	MSO logic, parametrized complexity, matroid, branch-width
101	Philipp Rohde	Expressive Power of Monadic Second-Order Logic and Modal µ-Calculus.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
93	Petr Hlinený, Detlef Seese	On Decidability of MSO Theories of Representable Matroids.	IWPEC	2004	DBLP DOI BibTeX RDF	MSO theory, decidability, matroid, branch-width
87	Georg Gottlob, Christoph Koch 0001	Monadic datalog and the expressive power of languages for Web information extraction.	J. ACM	2004	DBLP DOI BibTeX RDF	MSO, monadic datalog, web wrapping, Complexity, information extraction, HTML, expressiveness, regular tree languages
72	Georg Gottlob, Reinhard Pichler, Fang Wei 0001	Monadic datalog over finite structures with bounded treewidth.	PODS	2007	DBLP DOI BibTeX RDF	datalog, treewidth, fixed-parameter tractability, monadic second order logic, tree decomposition
72	Thomas Eiter, Yuri Gurevich, Georg Gottlob	Existential second-order logic over strings.	J. ACM	2000	DBLP DOI BibTeX RDF	S1S, existential fragment, finite satisfiability, finite words, prefix classes, model checking, strings, regular languages, descriptive complexity, finite model theory, decision problem, NP, second-order logic
64	Timos Antonopoulos, Anuj Dawar	Separating Graph Logic from MSO.	FoSSaCS	2009	DBLP DOI BibTeX RDF
64	Karin Quaas	Weighted Timed MSO Logics.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
64	Arnaud Carayol, Christof Löding	MSO on the Infinite Binary Tree: Choice and Order.	CSL	2007	DBLP DOI BibTeX RDF
64	Guillaume Bagan	MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.	CSL	2006	DBLP DOI BibTeX RDF
64	Amélie Gheerbrant, Balder ten Cate	Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees.	LFCS	2009	DBLP DOI BibTeX RDF	Fragments of MSO, Henkin semantics, Ehrenfeucht-Fraïssé games, Feferman-Vaught theorems, Trees, Axiomatizations
58	Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel	XML transformation by tree-walking transducers with invisible pebbles.	PODS	2007	DBLP DOI BibTeX RDF	tree transducer, XML, pebble
58	Pablo Barceló, Leonid Libkin	Temporal Logics over Unranked Trees.	LICS	2005	DBLP DOI BibTeX RDF
58	Iovka Boneva, Jean-Marc Talbot	Automata and Logics for Unranked and Unordered Trees.	RTA	2005	DBLP DOI BibTeX RDF
58	Georg Gottlob, Christoph Koch 0001	Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. (PDF / PS)	PODS	2002	DBLP DOI BibTeX RDF	Web View
58	Dietmar Berwanger, Achim Blumensath	The Monadic Theory of Tree-like Structures.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
58	Frank Neven, Thomas Schwentick	Expressive and Efficient Pattern Languages for Tree-Structured Data.	PODS	2000	DBLP DOI BibTeX RDF
58	Ludwig Staiger	Rich omega-Words and Monadic Second-Order Arithmetic.	CSL	1997	DBLP DOI BibTeX RDF
50	Wolfgang Thomas	Constructing Infinite Graphs with a Decidable MSO-Theory.	MFCS	2003	DBLP DOI BibTeX RDF
50	Joost Engelfriet, Sebastian Maneth	Characterizing and Deciding MSO-Definability of Macro Tree Transductions.	STACS	2000	DBLP DOI BibTeX RDF
43	Benedikt Bollig, Paul Gastin	Weighted versus Probabilistic Logics.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
43	Stephan Kreutzer	On the Parameterised Intractability of Monadic Second-Order Logic.	CSL	2009	DBLP DOI BibTeX RDF
43	Hans-Jörg Tiede	Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax.	J. Log. Lang. Inf.	2008	DBLP DOI BibTeX RDF	Model theoretic syntax, Modal logic, Tree automata
43	Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran	Fast Counting with Bounded Treewidth.	LPAR	2008	DBLP DOI BibTeX RDF
43	Julie A. Wall, Liam McDaid, Liam P. Maguire, T. Martin McGinnity	Spiking neuron models of the medial and lateral superior olive for sound localisation.	IJCNN	2008	DBLP DOI BibTeX RDF
43	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison	Satisfiability of a Spatial Logic with Tree Variables.	CSL	2007	DBLP DOI BibTeX RDF
43	Maurizio Martinelli, Irma Serrecchia, Michela Serrecchia	Analysis of the Internet diffusion in the non-profit sector: the social digital divide in Italy.	Scientometrics	2006	DBLP DOI BibTeX RDF
43	Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl	XML type checking with macro tree transducers.	PODS	2005	DBLP DOI BibTeX RDF
43	Martin Grohe, György Turán	Learnability and Definability in Trees and Similar Structures.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
43	Thomas Colcombet, Christof Löding	On the Expressiveness of Deterministic Transducers over Infinite Trees.	STACS	2004	DBLP DOI BibTeX RDF
43	Yinan Lu, Sheng-Sheng Wang 0001, Sheng-xian Sha	Multi-dimensional Observer-Centred Qualitative Spatial-Temporal Reasoning.	RSFDGrC	2003	DBLP DOI BibTeX RDF
43	Dietrich Kuske, Markus Lohrey	Decidable Theories of Cayley-Graphs.	STACS	2003	DBLP DOI BibTeX RDF
43	Martin Grohe, György Turán	Learnability and Definability in Trees and Similar Structures.	STACS	2002	DBLP DOI BibTeX RDF
43	Teodor Knapik, Damian Niwinski, Pawel Urzyczyn	Deciding Monadic Theories of Hyperalgebraic Trees.	TLCA	2001	DBLP DOI BibTeX RDF
43	Joost Engelfriet, Hendrik Jan Hoogeboom	Two-Way Finite State Transducers and Monadic Second-Order Logic.	ICALP	1999	DBLP DOI BibTeX RDF
43	Manfred Droste, George Rahonis	Weighted Automata and Weighted Logics with Discounting.	CIAA	2007	DBLP DOI BibTeX RDF	weighted Büchi and Muller automata, weighted MSO logic, discounting, formal power series, weighted automata
42	Colin Riba	Forcing MSO on Infinite Words in Weak MSO.	LICS	2013	DBLP DOI BibTeX RDF
42	Tobias Ganzow, Sasha Rubin	Order-Invariant MSO is Stronger than Counting MSO in the Finite.	STACS	2008	DBLP DOI BibTeX RDF
42	Tobias Ganzow, Sasha Rubin	Order-Invariant MSO is Stronger than Counting MSO in the Finite	CoRR	2007	DBLP BibTeX RDF
36	Joost Engelfriet, Sebastian Maneth	The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable.	FSTTCS	2005	DBLP DOI BibTeX RDF
36	P. Madhusudan, P. S. Thiagarajan, Shaofa Yang	The MSO Theory of Connectedly Communicating Processes.	FSTTCS	2005	DBLP DOI BibTeX RDF
29	Emmanuel Jeandel, Guillaume Theyssier	Subshifts, Languages and Logic.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
29	Jindong Liu, David Pérez-González, Adrian Rees, Harry R. Erwin, Stefan Wermter	Multiple Sound Source Localisation in Reverberant Environments Inspired by the Auditory Midbrain.	ICANN (1)	2009	DBLP DOI BibTeX RDF	sound localisation, inferior colliculus, Spiking neural network, reverberation
29	Balder ten Cate, Luc Segoufin	XPath, transitive closure logic, and nested tree walking automata.	PODS	2008	DBLP DOI BibTeX RDF	tree walking automata, xpath, xml, transitive closure
29	Krzysztof Trojanowski	Tuning Quantum Multi-Swarm Optimization for Dynamic Tasks.	ICAISC	2008	DBLP DOI BibTeX RDF
29	Marco Kuhlmann, Joachim Niehren	Logics and Automata for Totally Ordered Trees.	RTA	2008	DBLP DOI BibTeX RDF
29	Marcelo Arenas, Pablo Barceló, Leonid Libkin	Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization.	ICALP	2007	DBLP DOI BibTeX RDF
29	Anuj Dawar	Model-Checking First-Order Logic: Automata and Locality.	CSL	2007	DBLP DOI BibTeX RDF
29	Rajeev Alur, Swarat Chaudhuri, P. Madhusudan	Languages of Nested Trees.	CAV	2006	DBLP DOI BibTeX RDF
29	Jerzy Marcinkowski	On the Expressive Power of Graph Logic.	CSL	2006	DBLP DOI BibTeX RDF
29	Paul Gastin, Dietrich Kuske	Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.	CONCUR	2005	DBLP DOI BibTeX RDF
29	Nicole Schweikardt	On the Expressive Power of Monadic Least Fixed Point Logic.	ICALP	2004	DBLP DOI BibTeX RDF
29	Olivier Ly	Compositional Verification: Decidability Issues Using Graph Substitutions.	MFCS	2004	DBLP DOI BibTeX RDF	Tree Automata, Compositional Verification, Monadic Second-Order Logic
29	Rajeev Alur, P. Madhusudan	Visibly pushdown languages.	STOC	2004	DBLP DOI BibTeX RDF	?-languages, verification, logic, context-free languages, pushdown automata, regular tree languages
29	Gytis Svirskis, Ramana Dodla, John Rinzel	Subthreshold outward currents enhance temporal integration in auditory neurons.	Biol. Cybern.	2003	DBLP DOI BibTeX RDF
29	Arnaud Carayol, Stefan Wöhrle	The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.	FSTTCS	2003	DBLP DOI BibTeX RDF
29	Angelo Monti, Adriano Peron	A Logical Characterization of Systolic Languages.	STACS	1998	DBLP DOI BibTeX RDF	Automata and formal languages, Logic in computer science
21	Tatsuya Gima, Yota Otachi	Extended MSO Model Checking via Small Vertex Integrity.	Algorithmica	2024	DBLP DOI BibTeX RDF
21	Lucas Bueri, Radu Iosif, Florian Zuleger	Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations.	CoRR	2024	DBLP DOI BibTeX RDF
21	Markus Lohrey, Markus L. Schmid	Enumeration for MSO-Queries on Compressed Trees.	CoRR	2024	DBLP DOI BibTeX RDF
21	Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet	Ranked Enumeration for MSO on Trees via Knowledge Compilation.	ICDT	2024	DBLP DOI BibTeX RDF
21	Mikolaj Bojanczyk	The category of MSO transductions.	CoRR	2023	DBLP DOI BibTeX RDF
21	Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet	Ranked Enumeration for MSO on Trees via Knowledge Compilation.	CoRR	2023	DBLP DOI BibTeX RDF
21	R. Hemalatha, R. Umamaheswari, S. Jothi 0001	An efficient stable node selection based on Garson's pruned recurrent neural network and MSO model for multipath routing in MANET.	Concurr. Comput. Pract. Exp.	2022	DBLP DOI BibTeX RDF
21	Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth	MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.	CoRR	2022	DBLP DOI BibTeX RDF
21	Lauri Hella, Miikka Vilander	Defining long words succinctly in FO and MSO.	CoRR	2022	DBLP BibTeX RDF
21	Tatsuya Gima, Yota Otachi	Extended MSO Model Checking via Small Vertex Integrity.	CoRR	2022	DBLP BibTeX RDF
21	Mikolaj Bojanczyk, Michal Pilipczuk	Optimizing tree decompositions in MSO.	Log. Methods Comput. Sci.	2022	DBLP DOI BibTeX RDF
21	Pawel Parys	The Caucal hierarchy: Interpretations in the (W)MSO+U logic.	Inf. Comput.	2022	DBLP DOI BibTeX RDF
21	Tatsuya Gima, Yota Otachi	Extended MSO Model Checking via Small Vertex Integrity.	ISAAC	2022	DBLP DOI BibTeX RDF
21	Laurent Feuilloley, Nicolas Bousquet, Théo Pierron	What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs.	PODC	2022	DBLP DOI BibTeX RDF
21	Lauri Hella, Miikka Vilander	Defining Long Words Succinctly in FO and MSO.	CiE	2022	DBLP DOI BibTeX RDF
21	Anuj Dawar, Abhisekh Sankaran	MSO Undecidability for Hereditary Classes of Unbounded Clique Width.	CSL	2022	DBLP DOI BibTeX RDF
21	Menta Srinivasulu	Multi-lead ECG signal analysis using RBFNN-MSO algorithm.	Int. J. Speech Technol.	2021	DBLP DOI BibTeX RDF
21	Nicolas Bousquet, Laurent Feuilloley, Théo Pierron	Local certification of MSO properties for bounded treedepth graphs.	CoRR	2021	DBLP BibTeX RDF
21	Yajun Gao, Tengfei Liang, Yi Jin 0001, Xiaoyan Gu, Wu Liu, Yidong Li, Congyan Lang	MSO: Multi-Feature Space Joint Optimization Network for RGB-Infrared Person Re-Identification.	CoRR	2021	DBLP BibTeX RDF
21	Yajun Gao, Tengfei Liang, Yi Jin 0001, Xiaoyan Gu, Wu Liu, Yidong Li, Congyan Lang	MSO: Multi-Feature Space Joint Optimization Network for RGB-Infrared Person Re-Identification.	ACM Multimedia	2021	DBLP DOI BibTeX RDF
21	Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros	Ranked Enumeration of MSO Logic on Words.	ICDT	2021	DBLP DOI BibTeX RDF
21	Petr Kolman, Martin Koutecký, Hans Raj Tiwary	Extension Complexity, MSO Logic, and Treewidth.	Discret. Math. Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
21	Joost Engelfriet, Heiko Vogler	A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage.	Discret. Math. Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
21	Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros	Ranked enumeration of MSO logic on words.	CoRR	2020	DBLP BibTeX RDF
21	Pawel Parys	Compositionality of the MSO+U Logic.	CoRR	2020	DBLP BibTeX RDF
21	Anuj Dawar, Abhisekh Sankaran	MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width.	CoRR	2020	DBLP BibTeX RDF
21	Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith	Undecidability of a weak version of MSO+U.	Log. Methods Comput. Sci.	2020	DBLP DOI BibTeX RDF
21	Pawel Parys	Recursion Schemes, the MSO Logic, and the U quantifier.	Log. Methods Comput. Sci.	2020	DBLP DOI BibTeX RDF
21	Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider	On Existential MSO and Its Relation to ETH.	ACM Trans. Comput. Theory	2020	DBLP DOI BibTeX RDF
21	Manfred Droste, Temur Kutsia, George Rahonis, Wolfgang Schreiner	McCarthy-Kleene fuzzy automata and MSO logics.	Inf. Comput.	2020	DBLP DOI BibTeX RDF
21	Damian Niwinski, Marcin Przybylko, Michal Skrzypczak	Computing Measures of Weak-MSO Definable Sets of Trees.	ICALP	2020	DBLP DOI BibTeX RDF
21	Matthew Schmitt	Coherent Technologies and Requirements in Next-Generation MSO Networks.	OFC	2020	DBLP BibTeX RDF
21	Parvaneh Babari, Manfred Droste	A Nivat theorem for weighted picture automata and weighted MSO logics.	J. Comput. Syst. Sci.	2019	DBLP DOI BibTeX RDF
21	Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi 0001	MSO-Definable Regular Model Checking.	CoRR	2019	DBLP BibTeX RDF
21	Joost Engelfriet, Heiko Vogler	A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage.	CoRR	2019	DBLP BibTeX RDF
21	Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak	MSO+nabla is undecidable.	CoRR	2019	DBLP BibTeX RDF
21	Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.	Log. Methods Comput. Sci.	2019	DBLP DOI BibTeX RDF
21	Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak	MSO+∇ is undecidable.	LICS	2019	DBLP DOI BibTeX RDF
21	Cécilia Pradic, Colin Riba	A Dialectica-Like Interpretation of a Linear MSO on Infinite Words.	FoSSaCS	2019	DBLP DOI BibTeX RDF
21	Tim Fernando, David Woods, Carl Vogel	MSO with tests and reducts.	FSMNLP	2019	DBLP BibTeX RDF
21	Sebastian Maneth, Helmut Seidl	Balancedness of MSO transductions in polynomial time.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
21	Olivier Carton, Thomas Colcombet, Gabriele Puppis	An Algebraic Approach to MSO-Definability on Countable linear Orderings.	J. Symb. Log.	2018	DBLP DOI BibTeX RDF