Search Results - "Mikołaj Bojańczyk"

Author manuscript, published in ' ' Wreath Products of Forest Algebras, with Applications to Tree Logics

Authors: Mikolaj Bojańczyk Howard Straubing Igor Walukiewicz et al.

Contributors: Mikolaj Bojańczyk Howard Straubing Igor Walukiewicz et al.

Source: http://hal.archives-ouvertes.fr/docs/00/40/47/83/PDF/lics.pdf.

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.2966

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.2966
http://hal.archives-ouvertes.fr/docs/00/40/47/83/PDF/lics.pdf

Coverability in VASS Revisited: Improving Rackoff's Bounds to Obtain Conditional Optimality.

Authors: Künnemann, Marvin Mazowiecki, Filip Schütze, Lia et al.

Source: Journal of the ACM; Oct2025, Vol. 72 Issue 5, p1-27, 27p

Subject Terms: MATHEMATICAL bounds, DETERMINISTIC algorithms, DECIDABILITY (Mathematical logic), HYPOTHESIS

Foundations of Software Science and Computation Structures

Authors: Mikołaj Bojańczyk Alex Simpson

Resource Type: eBook.

Subjects: Artificial intelligence, Software engineering--Congresses, Computer software--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Programming / Compilers, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / General, MATHEMATICS / Discrete Mathematics

Balancing Straight-line Programs.

Authors: GANARDI, MOSES JEŻ, ARTUR LOHREY, MARKUS

Source: Journal of the ACM; Jul2021, Vol. 68 Issue 4, p1-40, 40p

Subject Terms: PROBLEM solving, CIRCUIT complexity, GRAMMAR

The Reachability Problem for Petri Nets Is Not Elementary.

Authors: CZERWIŃSKI, WOJCIECH LASOTA, SŁAWOMIR LAZIĆ, RANKO et al.

Source: Journal of the ACM; Jan2021, Vol. 68 Issue 1, p1-28, 28p

Subject Terms: PETRI nets, COMPUTER logic, DATABASES, COMPUTER science, FORMAL languages

Going Higher in First-Order Quantifier Alternation Hierarchies on Words.

Authors: PLACE, THOMAS ZEITOUN, MARC

Source: Journal of the ACM; Apr2019, Vol. 66 Issue 2, p1-65, 65p

Subject Terms: FIRST-order logic, VOCABULARY

First-order Logic with Connectivity Operators.

Authors: SCHIRRMACHER, NICOLE SIEBERTZ, SEBASTIAN VIGNY, ALEXANDRE

Source: ACM Transactions on Computational Logic; Oct2023, Vol. 24 Issue 4, p1-23, 23p

Subject Terms: FIRST-order logic, DOMINATING set, INDEPENDENT sets, PLANAR graphs, GRAPH connectivity

Strong-separation Logic.

Authors: PAGEL, JENS ZULEGER, FLORIAN

Source: ACM Transactions on Programming Languages & Systems; Jul2022, Vol. 44 Issue 3, p1-40, 40p

Subject Terms: LOGIC, INDUCTION (Logic), FIRST-order logic, DATA structures

FrontMatter.

Authors: Skrzypczak, Michał

Source: Descriptive Set Theoretic Methods in Automata Theory; 2016, pI-XIII, 13p

Reiterman’s Theorem on Finite Algebras for a Monad.

Authors: ADÁMEK, JIŘÍ LIANG-TING CHEN MILIUS, STEFAN et al.

Source: ACM Transactions on Computational Logic; Oct2021, Vol. 22 Issue 4, p1-48, 48p

Subject Terms: ALGEBRA, MONADS (Mathematics), FORMAL languages

Alternating Tree Automata with Qualitative Semantics.

Authors: BERTHON, RAPHAËL FIJALKOW, NATHANAËL FILIOT, EMMANUEL et al.

Source: ACM Transactions on Computational Logic; Jan2021, Vol. 22 Issue 1, p7-7:24, 24p

Subject Terms: ROBOTS, PROBABILISTIC databases

Randomized Contractions Meet Lean Decompositions.

Authors: CYGAN, MAREK KOMOSA, PAWEŁ LOKSHTANOV, DANIEL et al.

Source: ACM Transactions on Algorithms; Dec2020, Vol. 17 Issue 1, p1-30, 30p

Subject Terms: TREE graphs, ADHESION, ALGORITHMS, SURETYSHIP & guaranty, CONSTRUCTION

TIGHT POLYNOMIAL WORST-CASE BOUNDS FOR LOOP PROGRAMS.

Authors: BEN-AMRAM, AMIR M. HAMILTON, GEOFF

Source: Logical Methods in Computer Science (LMCS); 2020, Vol. 16 Issue 2, p1-39, 39p

Subject Terms: STATISTICAL decision making, HOMOMORPHISMS, POLYNOMIALS, ARITHMETIC, FACTORIZATION

UNDECIDABILITY OF A WEAK VERSION OF MSO+U.

Authors: BOJAŃCZYK, MIKOŁAJ DAVIAUD, LAURE GUILLON, BRUNO et al.

Source: Logical Methods in Computer Science (LMCS); 2020, Vol. 16 Issue 1, p1-15, 15p, 4 Color Photographs

Preface.

Authors: Bojańczyk, Mikołaj Simpson, Alex

Source: Lecture Notes in Computer Science; 2019, p1-1, 1p

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.

Authors: CLEMENTE, LORENZO LASOTA, SŁAWOMIR LAZIĆ, RANKO et al.

Source: ACM Transactions on Computational Logic; May2019, Vol. 20 Issue 3, p1-31, 31p

Subject Terms: ADDITION (Mathematics), INTEGERS, MACHINE theory, ROBOTS

Cutwidth: Obstructions and Algorithmic Aspects.

Authors: Giannopoulou, Archontia C. Pilipczuk, Michał Raymond, Jean-Florent et al.

Source: Algorithmica; Feb2019, Vol. 81 Issue 2, p557-588, 32p

Subject Terms: IMMERSIONS (Mathematics), INFORMATION retrieval, DYNAMIC programming, VERY large scale circuit integration, QUADRATIC forms

Discovering XSD Keys from XML Data

Authors: Arenas, Marcelo DAENEN, Jonny NEVEN, Frank et al.

Subject Terms: information systems, database management, database applications, data mining, algorithms, languages, experimentation, theory, XML key

File Description: application/pdf

Relation: Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, and Pierre Senellart. 2012. Finding optimal probabilistic generators for XML collections. In Proceedings of the 15th International Conference on Database Theory (ICDT'12). ACM Press, New York, 127--139. Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. Marcelo Arenas, Jonny Daenen, Frank Neven, Martin Ugarte, Jan Van den Bussche, and Stijn Vansummeren. 2013. Discovering XSD keys from XML data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'13). 61--72. Marcelo Arenas, Wenfei Fan, and Leonid Libkin. 2002. What's hard about XML schema constraints? In Proceedings of the 13th International Conference on Database and Expert Systems Applications (DEXA'02). Lecture Notes in Computer Science, vol. 2453, Springer, 269--278. 5 Denilson Barbosa and Alberto O. Mendelzon. 2003. Finding id attributes in XML documents. In Proceedings of the 1st International XML Database Symposium (XSym'03). Lecture Notes in Computer Science, vol. 2824, Springer, 180--194. 6 Geert Jan Bex, Wouter Gelade, Wim Martens, and Frank Neven. 2009. Simplifying XML schema: Effortless handling of nondeterministic regular expressions. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'09). 731--744. Geert Jan Bex, Wouter Gelade, Frank Neven, and Stijn Vansummeren. 2010a. Learning deterministic regular expressions for the inference of schemas from XML data. ACM Trans. Web 4, 4. Geert Jan Bex, Frank Neven, Thomas Schwentick, and Stijn Vansummeren. 2010b. Inference of concise regular expressions and dtds. ACM Trans. Database Syst. 35, 2. Geert Jan Bex, Frank Neven, and Stijn Vansummeren. 2007. Inferring XML schema definitions from XML data. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07). 998--1009. Geert Jan Bex, Frank Neven, and Stijn Vansummeren. 2008. SchemaScope: A system for inferring and cleaning XML schemas. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'08). 1259--1262. Dina Bitton, Jeffrey Millman, and Solveig Torgersen. 1989. A feasibility and performance study of dependency inference. In Proceedings of the International Conference on Data Engineering (ICDE'89). 635--641. Henrik Björklund, Wim Martens, and Thomas Schwentick. 2013. Validity of tree pattern queries with respect to schema information. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13). Lecture Notes in Computer Science, vol. 8087, Springer, 171--182. Mikolaj Bojanczyk. 2008. Tree-walking automata. In Proceedings of the 2nd International Conference on Language and Automata Theory and Applications (LATA'08). Lecture Notes in Computer Science, vol. 5196, Springer, 1--2. Anne Bruggemann-Klein and Derick Wood. 1998. One-unambiguous regular languages. Inf. Comput. 140, 2, 229--253. Peter Buneman, Susan B. Davidson, Wenfei Fan, Carmem S. Hara, and Wang Chiew Tan. 2002. Keys for XML. Comput. Netw. 39, 5, 473--487. Peter Buneman, Susan B. Davidson, Wenfei Fan, Carmem S. Hara, and Wang Chiew Tan. 2003. Reasoning about keys for XML. Inf. Syst. 28, 8, 1037--1063. Stanislav Fajt, Irena Mlynkova, and Martin Necasky. 2011. On mining xml integrity constraints. In Proceedings of the 6th IEEE International Conference on Digital Information Management (ICDIM'11). 23--29. Wenfei Fan and Leonid Libkin. 2002. On XML integrity constraints in the presence of dtds. J. ACM 49, 3, 368--406. Minos N. Garofalakis, Aristides Gionis, Rajeev Rastogi, Sridhar Seshadri, and Kyuseok Shim. 2003. XTRACT: Learning document type descriptors from XML document collections. Data Min. Knowl. Discov. 7, 1, 23--56. Gösta Grahne and Jianfei Zhu. 2002. Discovering approximate keys in XML data. In Proceedings of the International Conference on Information and Knowledge Management (CIKM'02). 453--460. Steven Grijzenhout and Maarten Marx. 2010. University of amsterdam XML web collection. http://data.politicalmashup.nl/sgrijzen/xmlweb/. Sven Hartmann and Sebastian Link. 2009. Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst. 34, 2. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. 2003. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. Donald E. Knuth, James H. Morris Jr., and Vaughan R. PRATT. 1977. Fast pattern matching in strings. SIAM J. Comput. 6, 2, 323--350. Heiki Mannila and Kari-Jouko Räihä. 1989. Practical algorithms for finding prime attributes and testing normal forms. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'89). ACM Press, New York, 128--133. Heikki Mannila and Kari-Jouko Räihä. 1991. The Design of Relational Databases. Addison-Wesley. Heikki Mannila and Kari-Jouko Räihä. 1994. Algorithms for inferring functional dependencies from relations. Data Knowl. Engin. 12, 1, 83--99. Heikki Mannila and Hannu Toivonen. 1997. Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov. 1, 3, 241--258. Wim Martens, Frank Neven, and Thomas Schwentick. 2007. Simple off the shelf abstractions for XML schema. SIGMOD Rec. 36, 3, 15--22. Wim Martens, Frank Neven, Thomas Schwentick, and Geert Jan Bex. 2006. Expressiveness and complexity of XML schema. ACM Trans. Database Syst. 31, 3, 770--813. Makoto Murata, Dongwon Lee, Murali Mani, and Kohsuke Kawaguchi. 2005. Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Technol. 5, 4, 660--704. Martin Necaský and Irena Mlýnkova. 2009. Discovering XML keys and foreign keys in queries. In Proceedings of the ACM Symposium on Applied Computing (SAC'09). ACM Press, New York, 632--638. Raghu Ramakrishnan and Johannes Gehrke. 2003. Database Management Systems 3rd Ed. McGraw-Hill. Helmut Seidl. 1990. Deciding equivalence of finite tree automata. SIAM J. Comput. 19, 3, 424--437. Richard Edwin Stearns and Harry B. Hunt Iii. 1985. On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput. 14, 3, 598--611. Larry J. Stockmeyer and Albert R. Meyer. 1973. Word problems requiring exponential time: Preliminary report. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC'73). 1--9. Peter Van Emde Boas. 1997. The convenience of tilings. In Complexity, Logic, and Recursion Theory, Marcel Dekker, 331--363. W3C. 2004. XML Schema Part 1: Structures 2nd Ed. http://www.w3.org/TR/xmlschema-1/#cIdentity-constraint Cong Yu and H. V. Jagadish. 2008. XML schema refinement through redundancy detection and normalization. VLDB J. 17, 2, 203--223.; http://hdl.handle.net/1942/18330; 28; 39; 000347799000003

Availability: http://hdl.handle.net/1942/18330
https://doi.org/10.1145/2638547

FrontMatter.

Source: Reachability Problems 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings; 2015, p1-1, 1p

Foundations of Software Science and Computation Structures : 28th International Conference, FoSSaCS 2025, Held As Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3–8, 2025, Proceedings

Authors: Parosh Aziz Abdulla Delia Kesner

Resource Type: eBook.

Subjects: Computer software--Congresses, Software engineering--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Computer Architecture, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Applied, MATHEMATICS / Logic