IQN Related Publications

This page comprises publications of people involved in the IQN.

• Publications by local staff:

  M. Droste, D. Kuske, R. McKenzie, R. Pöschel:
  Complementary closed rational clones are not always Krasner clones.
  Algebra Universalis 45 (2001), 155 - 160.

  M. Droste and J.K. Truss:
  Rigid chains admitting many embeddings.
  Proc. Amer. Math. Soc. 129 (2001), 1601 - 1608.

  M. Droste and R. Göbel:
  On the homeomorphism groups of Cantor's discontinuum and the spaces of rational and of irrational numbers.
  Bull. London Math. Soc. 34 (2002), 474 - 478.

  M. Droste, M. Giraudet and R. Göbel:
  All groups are outer automorphism groups of simple groups.
  Journal London Math. Soc. 64 (2001), 565 - 575.

  M. Droste and S. Shelah:
  Outer automorphism groups of ordered permutation groups.
  Forum Mathematicum 14 (2002), 605 - 621.

  M. Droste:
  Uncountable homogeneous partial orders.
  Mathematical Logic Quarterly 48 (2002), 525 - 532.

  M. Droste and D. Kuske:
  Recognizable languages in divisibility monoids.
  Mathem. Structures in Comp. Science 11 (2001), 743 - 770.

  M. Droste, P. Boldi and F. Cardone:
  Universal homogeneous graph-like structures and domains.
  Mathem. Structures in Comp. Science, 12 (2002), 91 - 109.

  M. Droste and D. Kuske:
  Automata with concurrency relations - a survey.
  In: Advances in Logic, Artificial Intelligence und Robotics (eds. J. Abe, J. da Silva Filho), IOS Press, 2002, pp. 152 - 172; invited survey.

  M. Droste, F. Bracho and I. Meinecke:
  From domains to event and concrete data structures.
  In: "Domains, Logic and Computation" (eds. J. Lawson, G.-Q. Zhang), Semantic Structures in Computation, vol. 3, Kluwer Academic Publ., to appear.

  M. Droste and G.-Q. Zhang:
  On transformations of formal power series.
  Information and Computation, 184 (2003), 369 - 383.

  M. Droste and H. Vogler (eds.):
  Selected Papers of the Workshop Weighted Automata: Theory and Applications
  (Dresden University of Technology, Germany, March 4-8, 2002). Journal of Automata, Languages and Combinatorics 8, 2003

  A. Maletti and H. Vogler:
  Incomparability Results for Classes of Polynomial Tree Series Transformations.
  Dresden, Germany, Technical Report TUD-FI03-14 - December 2003, Dresden University of Technology.

  J. Voigtländer:
  Using Circular Programs to Deforest in Accumulating Parameters.
  Accepted for publication in Higher-Order and Symbolic Computation.

  J. Voigtländer and A. Kühnemann:
  Composition of functions with accumulating parameters.
  Accepted for publication in Journal of Functional Programming.

  P. Johann and J. Voigtländer:
  Free Theorems in the Presence of seq.
  Accepted for publication at 31st Symposium on Principles of Programming Languages - POPL'04, Venice, Italy, January 2004.

  J. Giesl, A. Kühnemann, and J. Voigtländer:
  Deaccumulation - Improving Provability.
  Accepted for publication at Eighth Asian Computing Science Conference - ASIAN'03, Mumbai, India, December 2003.

  B. Borchardt and H. Vogler:
  Determinization of Finite State Weighted Tree Automata.
  Journal of Automata, Languages and Combinatorics 8 (2003) 3, 417 - 463.

  B. Borchardt:
  The Myhill-Nerode Theorem for Recognizable Tree Series.
  Proc. of 7th Int. Conf. Development in Language Theory, Springer Lect. Notes in Computer Science 2710, 146-158, 2003.

  C. Jürgensen and H. Vogler:
  Syntactic composition of top-down tree transducers is short cut fusion.
  Mathematical Structures in Computer Science, accepted, 2003.

  P. Buchholz, P. Kemper:
  Quantifying the dynamic behavior of process algebras.
  In: L. de Alfaro, S. Gilmore (Hrsg.), Process Algebra and Probabilistic Methods, Springer LNCS 2165 (2001) S. 184-199.

  P. Buchholz:
  Equivalence and aggregation of GSPNs with labeled transitions.
  In: R. German, B. Haverkort (Hrsg.), Petri Nets and Performance Models (PNPM'01), IEEE CS-Press (2001) S. 81-90.

  P. Buchholz, P. Kemper:
  Hierarchical reachability graph generation for Petri nets.
  Formal Aspects in Systems Design Vol. 21(3), 2002, S. 281-315.

  P. Buchholz, P. Kemper:
  Efficient Computation and Representation of Large Reachability Sets for Composed Automata.
  Discrete Event Dynamic Systems Theory and Application Vol. 12 (3), 2002, S. 265-286.

  P. Buchholz, J. P. Katoen, P. Kemper, C. Tepper:
  Model-checking large structured Markov chains.
  Journal of Logic and Algebraic Programming Vol. 56 (1/2) 2003, S. 69-97.

  P. Buchholz, P. Kemper:
  Weak bisimulation for max/+ automata and related models.
  Journal of Automata, Languages and Combinatorics Vol. 8 (2), S. 187-218.

  P. Buchholz, T. Dayar:
  Block SOR for Kronecker Structured Representations.
  To appear in: Linear Algebra and Its Applications.

  E. Aichinger, D. Masulovic, R. Pöschel, and J. Wilson:
  Completeness for concrete near-rings.
  Tech. Rep. MATH-AL-14-2002, TU Dresden, September 2002, (25 pages).

  F. Börner, R. Pöschel, and V. Sushchansky:
  Boolean systems of relations and {G}alois connections.
  Acta Sci.Math. (Szeged) 68, (2002), 535--560.

  D. Masulovic and R. Pöschel:
  On the structure of some Tarski clones.
  Tech. Rep. MATH-AL-19-2002, TU Dresden, December 2002.

  R. Pöschel:
  Galois connections for operations and relations.
  In: K. Denecke, M. Erné, and S. Wismath (eds.),
  Galois connections and applications, Kluwer, Dordrecht, (to appear).

  R. Pöschel, A. Semigrodskikh, and H. Vogler:
  Relationally defined clones of tree functions closed under selection or primitive recursion.
  Acta Cybernetica 16(3), (to appear)

  J. Hereth Correia and R. Pöschel:
  The power of Peircean Algebraic Logic (PAL).
  LNCS, Springer, 2004, (to appear)

  M. Droste, G.-Q. Zhang:
  Rational transformations of formal power series.
  in: 28th ICALP, LNCS vol. 2076, Springer, 2001, pp. 555-566.

  M. Droste, R. M. Shortt:
  Continuous Petri nets and transition systems
  in: "Unifying Petri Nets" (eds. H. Ehrig, G. Juhas, J. Padberg, G. Rozenberg),
  LNCS vol. 2118, Springer, 2001, pp. 457 - 484, eingeladener Buchbeitrag.

  M. Droste, R.M. Shortt:
  From Petri nets to automata with concurrency
  Applied Categorical Structures 10 (2002), 173 - 191.

  M. Droste, H. Vogler:
  A Kleene theorem for weighted tree automata
  Accepted for publication in Theory of Computing Systems.

  D. Kuske.
  Regular sets of infinite message sequence charts.
  Information and Computation (2003). Accepted.

  D. Kuske and M. Lohrey.
  Decidable first-order theories of one-step rewriting in trace monoids.
  Theory of Computing Systems (2003). Accepted.

  M. Droste and D. Kuske.
  On random relational structures.
  Journal of Combinatorial Theory - Series A 102/2 (2003), 241-254.

  D. Kuske.
  Is Cantor's theorem automatic?
  LPAR 2003, 330-343, Springer Lecture Notes in Computer Science vol. 2850 (2003).

  D. Kuske and I. Meinecke.
  Branching automata with costs - a way of reflecting parallelism in costs.
  CIAA 2003 150-162. Springer Lecture Notes in Computer Science vol. 2759 (2003).

  M. Droste and D. Kuske.
  Skew and infinitary formal power series.
  ICALP 2003 426-438. Springer Lecture Notes in Computer Science vol. 2719 (2003).

  D. Kuske and M. Lohrey.
  Decidable Theories of Cayley-graphs.
  STACS 2003, 463-474. Springer Lecture Notes in Computer Science vol. 2607 (2003).

  I. Kovtun.
  Partial optimal labelling serch for a NP-hard subclass of (max,+) problems.
  Pattern Recognition (402-409) (Bernd Michaelis, Gerald Krell, eds.), LNCS 2781, Springer 2003.

  Ivan Kovtun.
  Texture Segmentation of images on the basis of Markov Random Fields.
  Technical Report TUD-FI03, TU--Dresden, May 2003

  Sebastian Bader and Pascal Hitzler.
  Logic programs, iterated function systems, and recurrent radial basis function networks.
  Technical Report WV-03-11, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, Dresden, Germany, 2003. To appear in Journal of Applied Logic.

  Kai Brünnler.
  Atomic cut elimination for classical logic.
  In M. Baaz and J.A. Makowsky, editors, CSL 2003, volume 2803 of Lecture Notes in Computer Science, pages 86-97. Springer-Verlag, 2003.

  Kai Brünnler.
  Two restrictions on contraction.
  Logic Journal of the IGPL, 11(5):525-529, 2003.

  Paola Bruscoli and Alessio Guglielmi.
  On structuring proof search for first order linear logic.
  In Moshe Y. Vardi and Andrei Voronkov, editors, LPAR 2003, volume 2850 of Lecture Notes in Artificial Intelligence, pages 389-406. Springer-Verlag, 2003.

  Paola Bruscoli and Alessio Guglielmi.
  On structuring proof search for first order linear logic.
  Technical Report WV-03-10, Knowledge Representation and Reasoning Group, Department of Computer Science, Dresden University of Technology, 2003.

  To appear in Proceedings LPAR'03. Paola Bruscoli and Alessio Guglielmi.
  A tutorial on proof theoretic foundations of logic programming.
  In Catuscia Palamidessi, editor, Logic Programming, 19th International Conference, volume 2916 of Lecture Notes in Computer Science, pages 109-127. Springer-Verlag, 2003.

  Invited tutorial. Bertram Fronhöfer and Steffen Hölldobler.
  17. WLP: Workshop Logische Programmierung
  TU Dresden, December 11-13, 2002. Technical Report TUD-FI03-03, TU Dresden, 01062 Dresden, April 2003. ISSN 1430-211X.

  Miguel A. Gutiérrez-Naranjo and Pascal Hitzler.
  ILP operators for propositional connectionist networks.
  In Bertram Fronhöfer and Steffen Hölldobler, editors, 17. WLP: Workshop Logische Programmierung, TU Dresden, December 11-13, 2002, number TUD-FI03-03 in Technische Berichte der Fakultät Informatik, pages 103-108. TU Dresden, 01062 Dresden, April 2003.

  Pascal Hitzler.
  A resolution theorem for algebraic domains.
  In Georg Gottlob and Toby Walsh, editors, Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 2003, pages 1339-1340. Morgan Kaufmann Publishers, 2003.

  Pascal Hitzler.
  Towards a systematic account of different logic programming semantics.
  In Rudolf Kruse Andreas Günter and Bernd Neumann, editors, KI2003: Advances in Artificial Intelligence. Proceedings of the 26th Annual German Conference on Artificial Intelligence, KI2003, Hamburg, Germany, September 2003, volume 2821 of Lecture Notes in Artificial Intelligence, pages 355-369. Springer, Berlin, 2003.

  Pascal Hitzler.
  Towards nonmonotonic reasoning on hierarchical knowledge.
  In Bertram Fronhöfer and Steffen Hölldobler, editors, 17. WLP: Workshop Logische Programmierung, TU Dresden, December 11-13, 2002, number TUD-FI03-03 in Technische Berichte der Fakultät Informatik, pages 68-80. TU Dresden, 01062 Dresden, April 2003.

  Pascal Hitzler, Steffen Hölldobler, and Anthony K. Seda.
  Logic programs and connectionist networks.
  Technical Report WV-03-12, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, Dresden, Germany, 2003. To appear in Journal of Applied Logic.

  Pascal Hitzler and Anthony K. Seda.
  Continuity of semantic operators in logic programming and their approximation by artificial neural networks.
  In Rudolf Kruse Andreas Günter and Bernd Neumann, editors, KI2003: Advances in Artificial Intelligence. Proceedings of the 26th Annual German Conference on Artificial Intelligence, KI2003, Hamburg, Germany, September 2003, volume 2821 of Lecture Notes in Artificial Intelligence, pages 105-119. Springer, Berlin, 2003.

  Pascal Hitzler and Anthony K. Seda.
  Generalized metrics and uniquely determined logic programs.
  Theoretical Computer Science, 305(1-3):187-219, 2003.

  Pascal Hitzler and Matthias Wendt.
  Characterizing logic programming semantics with level mappings.
  In Bertram Fronhöfer and Steffen Hölldobler, editors, 17. WLP: Workshop Logische Programmierung, TU Dresden, December 11-13, 2002, number TUD-FI03-03 in Technische Berichte der Fakultät Informatik, pages 60-67. TU Dresden, 01062 Dresden, April 2003.

  Pascal Hitzler and Matthias Wendt.
  Formal concept analysis and resolution in algebraic domains.
  In Aldo de Moor and Bernhard Ganter, editors, Using Conceptual Structures -- Contributions to ICCS 2003, pages 157-170. Shaker Verlag, Aachen, 2003.

  Ozan Kahramanogullari and Michael Thielscher.
  A formal assessment result for fluent calculus using the action description language.
  In Rudolf Kruse Andreas Günter and Bernd Neumann, editors, KI2003: Advances in Artificial Intelligence. Proceedings of the 26th Annual German Conference on Artificial Intelligence, KI2003, Hamburg, Germany, September 2003, volume 2821 of Lecture Notes in Artificial Intelligence, pages 209-223. Springer, Berlin, 2003.

  Manfred Schramm and Bertram Fronhöfer.
  Probabilistic aspects of score systems.
  International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (IJUFKS), 11(Suppl.):51-74, November 2003.

  Lutz Straßburger.
  MELL in the Calculus of Structures.
  Theoretical Computer Science, 309(1-3):213-285, 2003.

  Lutz Straßburger.
  System NEL is undecidable.
  In Ruy De Queiroz, Elaine Pimentel, and Lucília Figueiredo, editors, 10th Workshop on Logic, Language, Information and Computation (WoLLIC), volume 84 of Electronic Notes in Theoretical Computer Science, 2003.

  H. Beilner, H. Fiedler, O. Günther, S. Hölldobler, G. Hotz, P. Liggesmeyer, K.-P. Löhr, R. Reischuk, and D. Wagner, editors.
  Ausgezeichnete Informatikdisserationen 2001
  volume D-2 of Lecture Notes in Informatics. German Informatics Society, 2002.

  Paola Bruscoli.
  A purely logical account of sequentiality in proof search.
  In Peter J. Stuckey, editor, Logic Programming, 18th International Conference, volume 2401 of Lecture Notes in Artificial Intelligence, pages 302-316. Springer-Verlag, 2002.

  Bertram Fronhöfer and Akihiro Yamamoto.
  Minimised residue hypotheses in relevant logic.
  In Nicolò Cesa-Bianchi, Masayuki Numao, and Rüdiger Reischuk, editors, Proceedings of the 13th International Conference on Algorithmic Learning Theory, volume 2533 of Lecture Notes in Artificial Intelligence, pages 278-292. Springer, Berlin, 2002.

  Axel Großmann, Steffen Hölldobler, and Olga Skvortsova.
  Symbolic dynamic programming within the fluent calculus.
  In Naohiro Ishii, editor, Proceedings of the IASTED International Conference on Artificial and Computational Intelligence, pages 378-383, Tokyo, Japan, September 25-27 2002. ACTA Press. ISBN: 0-88986-358-X.

  Marina Guetova, Steffen Hölldobler, and Hans-Peter Störr.
  Incremental fuzzy decision trees.
  In Matthias Jarke, Jana Koehler, and Gerhard Lakemeyer, editors, Proceedings of the 25th German Conference on Artificial Intelligence (KI2002), volume 2479 of Lecture Notes in Artificial Intelligence, pages 67-81, Aachen, Germany, 2002. Springer Verlag.

  Alessio Guglielmi and Lutz Straßburger.
  A non-commutative extension of MELL.
  In Matthias Baaz and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002, volume 2514 of Lecture Notes in Artificial Intelligence, pages 231-246. Springer-Verlag, 2002.

  Roland Heinze, Pascal Hitzler, and Anthony Karel Seda.
  Convergence classes and spaces of partial functions.
  Technical Report WV-02-02, Knowledge Representation and Reasoning Group, Department of Computer Science, Dresden University of Technology, Dresden, Germany, 2002. To appear in Proceedings ISDT'2001.

  Pascal Hitzler and Anthony Karel Seda.
  The fixed-point theorems of Priess-Crampe and Ribenboim in logic programming.
  Fields Institute Communications, (32):219-235, 2002. Pascal Hitzler and Anthony Karel Seda.
  On the coincidence of semantics for uniquely determined programs.
  In Ted Hurley, Mícheál Mac an Airchinnigh, Michel Schellekens, and Anthony Seda, editors, Electronic Notes in Theoretical Computer Science, volume 40. Elsevier Science Publishers, 2002.

  Pascal Hitzler and Matthias Wendt.
  A uniform approach to logic programming semantics.
  To appear in Theory and Practice of Logic Programming. Pascal Hitzler and Matthias Wendt.
  The well-founded semantics is a stratified Fitting semantics.
  In Matthias Jarke, Jana Koehler, and Gerhard Lakemeyer, editors, Proceedings of the 25th Annual German Conference on Artificial Intelligence, KI2002, Aachen, Germany, September 2002, volume 2479 of Lecture Notes in Artificial Intelligence, pages 205-221. Springer, Berlin, 2002.

  Steffen Hölldobler, Tran Dinh Khang, and Hans-Peter Störr.
  A fuzzy description logic with hedges as concept modifiers.
  In Nguyen Hoang Phuong, Hung T. Nguyen, Nguyen Cat Ho, and Pratit Santiprabhob, editors, Proceedings InTech/VJFuzzy'2002, pages 25-34, Hanoi, Vietnam, 2002. Institute of Information Technology, Vietnam Center for Natural Science and Technology, Science and Technics Publishing House, Hanoi, Vietnam.

  Manfred Schramm and Bertram Fronhöfer.
  Completing incomplete Bayesian networks.
  In Gabriele Kern-Isberner and Wilhelm Roedder, editors, Conditionals, Information, and Inference, pages 231-243, Fachbereich Informatik, Postfach 940, D-58084 Hagen, May 2002. Fernuniversität, Gesamthochschule in Hagen.

  Hans-Peter Störr.
  A compact fuzzy extension of the naive bayesian classification algorithm.
  In Nguyen Hoang Phuong, Hung T. Nguyen, Nguyen Cat Ho, and Pratit Santiprabhob, editors, Proceedings InTech/VJFuzzy'2002, pages 172-177, Hanoi, Vietnam, 2002. Institute of Information Technology, Vietnam Center for Natural Science and Technology, Science and Technics Publishing House, Hanoi, Vietnam.

  Lutz Straßburger.
  A local system for linear logic.
  In Matthias Baaz and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002, volume 2514 of Lecture Notes in Artificial Intelligence, pages 388-402. Springer, Berlin, 2002.

  Matthias Wendt.
  Unfolding the well-founded semantics.
  Journal of Electrical Engineering, 53(12/s):56-59, 2002. Proceedings of the 4th Slovakian Student Conference on Applied Mathematics, Bratislava, April 2002, Slovak Academy of Sciences.

  Akihiro Yamamoto and Bertram Fronhöfer.
  A theory of hypothesis finding in clausal logic.
  In Setsuo Arikawa and Ayumi Shinohara, editors, Progress in Discovery Science, volume 2281 of Lecture Notes in Artificial Intelligence, pages 246-257. Springer, 2002.

• A Publication with our French Partner in Paris:

  Special issue on Logic and Algebra for Concurrency.
  of the Journal of Automata, Languages and Combinatorics
  edited by M. Droste and P. Gastin, 2002, in print.

  P. Gastin and D. Kuske.
  Satisfiability and model checking for MSO-definable temporal logics are in PSPACE.
  CONCUR 2003, 222-236. Springer Lecture Notes in Computer Science vol. 2761 (2003).

• Publications with our Ukrainian Partner in Kiew:

  Boris Flach, Eeri Kask, Dmitrij Schlesinger, Andriy Skulish}.
  Unifying Registration and Segmentation for Multi-Sensor Images.
  Pattern Recognition (190-197) (Luc Van Gool, ed.) Lecture Notes in Computer Science 2449, 2002.

  Michail I. Schlesinger and Boris Flach.
  Analysis of Optimal Labelling Problems and Application to Image Segmentation and Binocular Stereovision.
  Proceedings of the International EAST-WEST-VISION Workshop (55-60) (Franz Leberl, Andrej Ferko, eds), Graz 2002.

• Publications with our Hungarian Partner in Szeged:

  Z. Fülöp and H. Vogler:
  Tree Series Transformations that Respect Copying.
  Theory of Comput. Systems 36(3): 247-293, 2003.

  Z. Fülöp and H. Vogler:
  Weighted tree transducers.
  Acceped for publication in Journal of Automata, Languages and Combinatorics.

  J. Engelfriet, Z. Fülöp, and H. Vogler.
  Bottom-up and Top-down Tree Series Transformations.
  J. Automata, Languages, and Combinatorics 7 (2001), 11-70.

  Z. Fülöp and H. Vogler.
  Tree Series Transformations that Respect Copying.
  accepted for publication in Theory of Computing Systems, 2002

  Z. Fülöp, Zs. Gazdag, H. Vogler.
  Hierarchies of Tree Series Transformations.
  submitted for publication.

• Publications with our Italian Partner in Rome:

  The Description Logic Handbook,
  edited by F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, P.F. Patel-Schneider,
  Cambridge University Press, 2002. To appear.

  U. Sattler, D. Calvanese, R. Molitor.
  Relationships with other formalisms.
  In "The Description Logic Handbook",
  edited by F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, P.F. Patel-Schneider,
  Cambridge University Press, 2002, pages 142-183. To appear.

• Publications with our British Partner in Manchester:

  I. Horrocks and U. Sattler.
  Optimised Reasoning for SHIQ".
  In Proc. of the 15th European Conference on Artificial Intelligence, 2002. To appear.

• A Publication with our Dutch Partner:

  Bart Jacobs and Hendrik Tews.
  Assertional and Behavioural Refinement in Coalgebraic Specification ps-version

---

Maintained by Bertram Fronhöfer <> Last modified: Thu Jan 29 13:01:51 CET 2004

Back to IQN home page