TU Wien Informatics

20 Years
Overview
Services
Office of the Dean Infrastructure Communications eduLAB
Institutes
Computer Engineering Information Systems Engineering Logic and Computation Visual Computing and Human-Centered Technology
Research Units
Algorithms and Complexity Artifact-based Computing and User Research Artificial Intelligence Techniques Automation Systems Business Informatics Compilers and Languages Computer Graphics Computer Vision Cyber-Physical Systems Data Science Databases and Artificial Intelligence Distributed Systems Embedded Computing Systems Formal Methods in Systems Engineering Human Computer Interaction Knowledge-Based Systems Machine Learning Parallel Computing Privacy Enhancing Technologies Security and Privacy Software Engineering Theory and Logic Virtual and Augmented Reality Visual Analytics

Theory and Logic E192-05

  • A Research Unit of The Institute of Logic and Computation

We at the Theory and Logic group are interested in various aspects of logic, its applications, and formal languages.

Research Unit Theory and Logic

Contact

On This Page

About People Activities

About

We at the Theory and Logic group are interested in various aspects of logic, its applications, and formal languages.

Our research focuses on topics in Theoretical Computer Science and Logic, the formal foundations of computer science. Our expertise includes non-classical logics, proof theory, automated deduction, game semantics, Curry-Howard correspondence, and higher-order logic. We apply our methods in areas ranging from medical expert systems and Artificial Intelligence to Indian philosophy and blockchains. In the area of formal languages, we investigate nature inspired computing models, especially membrane computing.

We offer courses at the undergraduate and masters level on logic and theoretical computer science as well as introductory programming courses for undergraduates and pre-undergraduates.

The research Unit Theory and Logic is part of the Institute of Logic and Computation.

Kees van Berkel
Kees van Berkel K. van Berkel

Assistant Professor
Asst.Prof. Dr. / MSc

Agata Ciabattoni
Agata Ciabattoni A. Ciabattoni

Head of Research Unit
Univ.Prof. Dr.

Christian Fermüller
Christian Fermüller C. Fermüller

Associate Professor
Ao.Univ.Prof. DI Dr.

Gernot Salzer
Gernot Salzer G. Salzer

Associate Professor
Ao.Univ.Prof. DI Dr.

Rudolf Freund
Rudolf Freund R. Freund

Retired Professor
Ao.Univ.-Prof.i.R. DI Mag. Dr.

Alexander Leitsch
Alexander Leitsch A. Leitsch

Retired Professor
Univ.Prof.i.R. Dr.

Giorgio Cignarale
Giorgio Cignarale G. Cignarale

PreDoc Researcher
Mag.

Josephine Femke Dik
Josephine Femke Dik J. Dik

PreDoc Researcher
MA

Huimin Dong
Huimin Dong H. Dong

PostDoc Researcher
Dr.

Thorsten Engesser
Thorsten Engesser T. Engesser

PostDoc Researcher
Dr. / MSc

Blaz Istenic Urh
Blaz Istenic Urh B. Istenic Urh

PreDoc Researcher
MA

Jürgen Kogler
Jürgen Kogler J. Kogler

Senior Lecturer
DI(FH) Dr. / MSc

Stella Lara Mahler
Stella Lara Mahler S. Mahler

PreDoc Researcher
DI / BSc

Emery Neufeld
Emery Neufeld E. Neufeld

PostDoc Researcher
Dr. / MSc

Xavier Parent
Xavier Parent X. Parent

PostDoc Researcher
Dr.

Dominik Pichler
Dominik Pichler D. Pichler

PreDoc Researcher
DI / BSc

Stefan Podlipnig
Stefan Podlipnig S. Podlipnig

Senior Lecturer
DI Dr.

Martin Riener
Martin Riener M. Riener

Senior Lecturer
DI Dr.

Dmitrii Rozplokhas
Dmitrii Rozplokhas D. Rozplokhas

PreDoc Researcher
Mag.

Matteo Tesi
Matteo Tesi M. Tesi

PostDoc Researcher
PhD

Tobias Salzer
Tobias Salzer T. Salzer

Visiting Scientist
DI / BSc

Franziska Gusel
Franziska Gusel F. Gusel

Office Services
Mag.

Glenn Palankovski
Glenn Palankovski G. Palankovski

IT Services

Ewa Vesely
Ewa Vesely E. Vesely

Office Services

Tobias Hercules Christoph
Tobias Hercules Christoph T. Christoph

Student Staff
BSc

Florian Freitag
Florian Freitag F. Freitag

Student Staff
BSc

Peter Hu
Peter Hu P. Hu

Student Staff

Nadja Jovancevic
Nadja Jovancevic N. Jovancevic

Student Staff

Martin Kargl
Martin Kargl M. Kargl

Student Staff

Michael Pritz
Michael Pritz M. Pritz

Student Staff
BSc

Markus Angermann
Markus Angermann M. Angermann

Lecturer
MSc MBA

Nathaniel Boisgard
Nathaniel Boisgard N. Boisgard

Lecturer
DI / BSc

Marion Oswald
Marion Oswald M. Oswald

Lecturer
DI Dr.

Bruno Schneeweiß
Bruno Schneeweiß B. Schneeweiß

Lecturer
Dr. Mag.

2024W

2025S

 

2024

2023

2022

2021

2020

2019

  • Expansion trees with cut / Aschieri, F., Hetzl, S., & Weller, D. (2019). Expansion trees with cut. Mathematical Structures in Computer Science, 29(8), 1009–1029. https://doi.org/10.1017/s0960129519000069
  • Connecting fuzzy logic and argumentation frames via logical attack principles / Corsi, E. A., & Fermüller, C. G. (2019). Connecting fuzzy logic and argumentation frames via logical attack principles. Soft Computing. https://doi.org/10.1007/s00500-018-3513-2
    Download: PDF (528 KB)
  • Preface / Pascucci, M., & Tuboly, A. T. (2019). Preface. ORGANON F, 26(3), 318–322. https://doi.org/10.31577/orgf.2019.26301
  • Performance and Scalability of Private Ethereum Blockchains / Schäffer, M., di Angelo, M., & Salzer, G. (2019). Performance and Scalability of Private Ethereum Blockchains. In Business Process Management: Blockchain and Central and Eastern Europe Forum (pp. 103–118). Springer. https://doi.org/10.1007/978-3-030-30429-4_8
  • Duty and Sacrifice: A Logical Analysis of the Mīmāṃsā Theory of Vedic Injunctions / Freschi, E., Ollett, A., & Pascucci, M. (2019). Duty and Sacrifice: A Logical Analysis of the Mīmāṃsā Theory of Vedic Injunctions. History and Philosophy of Logic, 40(4), 323–354. https://doi.org/10.1080/01445340.2019.1615366
  • Smart contracts in view of the civil code / di Angelo, M., Soare, A., & Salzer, G. (2019). Smart contracts in view of the civil code. In Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing. SAC ’19: The 34th ACM/SIGAPP Symposium on Applied Computing, Limassol, Cyprus. ACM. https://doi.org/10.1145/3297280.3297321
  • Sequentialising Nested Systems / Pimentel, E., Ramanayake, D. R. S., & Lellmann, B. (2019). Sequentialising Nested Systems. In S. Cerrito & A. Popescu (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings (pp. 147–165). Springer. https://doi.org/10.1007/978-3-030-29026-9_9
  • Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents / Goré, R., & Lellmann, B. (2019). Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents. In S. Cerrito & A. Popescu (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings (pp. 185–202). Springer. https://doi.org/10.1007/978-3-030-29026-9_11
  • Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels / Lellmann, B. (2019). Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels. In S. Cerrito & A. Popescu (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings (pp. 203–220). Springer. https://doi.org/10.1007/978-3-030-29026-9_12
  • Evaluating Networks of Arguments: A Case Study in Mīmāṃsā Dialectics. / van Berkel, K., & Ciabattoni, A. (2019). Evaluating Networks of Arguments: A Case Study in Mīmāṃsā Dialectics. In Logic, Rationality, and Interaction. LORI 2019. Lecture Notes in Computer Science (pp. 355–369). http://hdl.handle.net/20.500.12708/57935
  • A Neutral Temporal Deontic STIT Logic / van Berkel, K., & Lyon, T. (2019). A Neutral Temporal Deontic STIT Logic. In Logic, Rationality, and Interaction. LORI 2019. Lecture Notes in Computer Science, (pp. 340–354). http://hdl.handle.net/20.500.12708/57934
  • Mayflies, Breeders, and Busy Bees in Ethereum / di Angelo, M., & Salzer, G. (2019). Mayflies, Breeders, and Busy Bees in Ethereum. In Proceedings of the Third ACM Workshop on Blockchains, Cryptocurrencies and Contracts  - BCC ’19. BCC 2019 : The Third ACM Workshop on Blockchains, Cryptocurrencies and Contracts, Auckland, New Zealand. ACM. https://doi.org/10.1145/3327959.3329537
  • A Survey of Tools for Analyzing Ethereum Smart Contracts / di Angelo, M., & Salzer, G. (2019). A Survey of Tools for Analyzing Ethereum Smart Contracts. In 2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON). IEEE International Conference on Decentralized Applications and Infrastructures, San Francisco, United States of America (the). IEEE. https://doi.org/10.1109/dappcon.2019.00018
  • Automated reasoning in normative detachment structures with ideal conditions / Pascucci, M., & Libal, T. (2019). Automated reasoning in normative detachment structures with ideal conditions. In Proceedings of the International Conference on Artificial Intelligence and Law (ICAIL) (pp. 63–72). ACM. http://hdl.handle.net/20.500.12708/56278
  • Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors / Freund, R., Rogojin, V., & Verlan, S. (2019). Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors. International Journal of Foundations of Computer Science, 30(06n07), 1005–1027. https://doi.org/10.1142/s0129054119400264
  • Bounded sequent calculi for non-classical logics via hypersequents / Ciabattoni, A., Ramanayake, R., & Lang, T. (2019). Bounded sequent calculi for non-classical logics via hypersequents. In Automated Reasoning with Analytic Tableaux and Related Methods. 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings (pp. 94–110). Springer. http://hdl.handle.net/20.500.12708/57959
  • A Game Model for Proofs with Costs / Lang, T., Olarte, C., Pimentel, E., & Fermüller, C. (2019). A Game Model for Proofs with Costs. In Automated Reasoning with Analytic Tableaux and Related Methods (pp. 241–258). Springer. http://hdl.handle.net/20.500.12708/58036
  • Modalities as prices: a game model of intuitionistic linear logic with subexponentials / Fermüller, C. (2019). Modalities as prices: a game model of intuitionistic linear logic with subexponentials. GaLoP 2019 14th Workshop on Games for Logic and Programming Languages, Prag, Czechia. http://hdl.handle.net/20.500.12708/86977
  • Judgment Aggregation From a Many-valued Logic Perspective / Fermüller, C. (2019). Judgment Aggregation From a Many-valued Logic Perspective. Nonclassical Logics and Judgment Aggregation, Prag, Czechia. http://hdl.handle.net/20.500.12708/86973
  • Argumentation Based Semantics for Nonclassical Logics / Fermüller, C. (2019). Argumentation Based Semantics for Nonclassical Logics. A primer of formal argumentation, Milano, Italy. http://hdl.handle.net/20.500.12708/86972
  • Tissue P Systems with Anti-Cells / Freund, R. (2019). Tissue P Systems with Anti-Cells. 29. Theorietag Automaten und Formale Sprachen, Bremen, Germany. http://hdl.handle.net/20.500.12708/86971
  • Reversibility and Determinism in P Systems / Freund, R. (2019). Reversibility and Determinism in P Systems. Reversibility in Programming, Languages, and Automata (RPLA), Porto, Portugal. http://hdl.handle.net/20.500.12708/86966
  • Blind and partially blind reister machines over groups / Freund, R., & Alhazov, A. (2019). Blind and partially blind reister machines over groups. NCMA 2019, Valencia, Spain. http://hdl.handle.net/20.500.12708/86965
  • Structural proof theory: shedding structure / Ramanayake, D. R. S. (2019). Structural proof theory: shedding structure. 5th International Workshop on Structures and Deduction SD 2019, Dortmund, Germany. http://hdl.handle.net/20.500.12708/86945
  • "Defining Responsibility / Pascucci, M., & Glavanicova, D. (2019). "Defining Responsibility. Current Trends in Deontic Logic II, Bratislava, Slovakia. http://hdl.handle.net/20.500.12708/86937
  • Towards a concurrrent lambda calculus: via linear logic / Aschieri, F. (2019). Towards a concurrrent lambda calculus: via linear logic. Workshop, Proof, Computation, Complexity, Stockholm, Sweden. http://hdl.handle.net/20.500.12708/86933
  • Countermodels for Non-normal Modal Logics via Nested Sequents / Lellmann, B. (2019). Countermodels for Non-normal Modal Logics via Nested Sequents. Conference: Syntax meets Semantics (SYSMICS) 2019, Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/86866
  • Intermediate Logic Proofs as Concurrent Programs / Ciabattoni, A., Genco, F., & Aschieri, F. (2019). Intermediate Logic Proofs as Concurrent Programs. Conference: Syntax meets Semantics (SYSMICS) 2019, Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/86612
  • A Formal Framework for Spiking Neural P Systems / Freund, R., Verlan, S., & Alhazov, A. (2019). A Formal Framework for Spiking Neural P Systems. In G. Paun (Ed.), Proceedings of the 20th Intern. Conf. on Membrane Computing CMC20 (pp. 523–536). Editura Bibliostar. http://hdl.handle.net/20.500.12708/58052
  • Playing with Derivation Modes / Freund, R. (2019). Playing with Derivation Modes. In G. Paun (Ed.), Proceedings of the 20th Intern. Conf. on Membrane Computing CMC20 (pp. 109–123). http://hdl.handle.net/20.500.12708/58051
  • Turing machines with activations of transitions / Freund, R., & Staiger, L. (2019). Turing machines with activations of transitions. In Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA (pp. 79–91). Österreichische Computer Gesellschaft. http://hdl.handle.net/20.500.12708/58029
  • Register machines over groups / Freund, R., Alhazov, A., & Ivanov, S. (2019). Register machines over groups. In Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019 (pp. 31–46). Österreichische Computer Gesellschaft. http://hdl.handle.net/20.500.12708/58028
  • Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics / Lyon, T., & van Berkel, K. (2019). Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics. In PRIMA 2019: Principles and Practice of Multi-Agent Systems (pp. 202–218). https://doi.org/10.1007/978-3-030-33792-6_13
  • Cut-Free Calculi and Relational Semantics for Temporal STIT Logics / van Berkel, K., & Lyon, T. (2019). Cut-Free Calculi and Relational Semantics for Temporal STIT Logics. In Logics in Artificial Intelligence (pp. 803–819). Springer. https://doi.org/10.1007/978-3-030-19570-0_52
  • A General Framework for Sequential Grammars with Control Mechanisms / Freund, R. (2019). A General Framework for Sequential Grammars with Control Mechanisms. In M. Hospodar (Ed.), Descriptional Complexity of Formal Systems (pp. 1–34). https://doi.org/10.1007/978-3-030-23247-4_1
  • P Systems with Anti-Membranes / Freund, R., Alhazov, A., & Ivanov, S. (2019). P Systems with Anti-Membranes. In G. Paun (Ed.), Proceedings of the 20th Intern. Conf. on Membrane Computing CMC20 (pp. 249–256). http://hdl.handle.net/20.500.12708/57855
  • Collateral Use of Deployment Code for Smart Contracts in Ethereum / di Angelo, M., & Salzer, G. (2019). Collateral Use of Deployment Code for Smart Contracts in Ethereum. In 2019 10th IFIP International Conference on New Technologies, Mobility and Security (NTMS). 2019 10th IFIP International Conference on New Technologies, Mobility and Security (NTMS), Gran Canaria, Spain. IEEE. https://doi.org/10.1109/ntms.2019.8763828
  • Formal Analysis of Responsibility Attribution in a Multimodal Framework / Pascucci, M., & Glavanicova, D. (2019). Formal Analysis of Responsibility Attribution in a Multimodal Framework. In PRIMA 2019: Principles and Practice of Multi-Agent Systems (pp. 36–51). https://doi.org/10.1007/978-3-030-33792-6_3
  • Schematic Refutations of Formula Schemata / Cerna, D., Leitsch, A., & Lolic, A. (2019). Schematic Refutations of Formula Schemata. arXiv. https://doi.org/10.48550/arXiv.1902.08055
  • Extraction of Expansion Trees / Leitsch, A., & Lolic, A. (2019). Extraction of Expansion Trees. Journal of Automated Reasoning, 62(3), 393–430. https://doi.org/10.1007/s10817-018-9453-9
  • Propositional quantifiers in labelled natural deduction for normal modal logic / Pascucci, M. (2019). Propositional quantifiers in labelled natural deduction for normal modal logic. LOGIC JOURNAL OF THE IGPL, 27(6), 865–894. https://doi.org/10.1093/jigpal/jzz008
  • Minimal Distance of Propositional Models / Behrisch, M., Hermann, M., Mengel, S., & Salzer, G. (2019). Minimal Distance of Propositional Models. Theory of Computing Systems, 63(6), 1131–1184. https://doi.org/10.1007/s00224-018-9896-8
  • Evaluating Networks of Structured Arguments with Support and a Case Study in Mimamsa Dialectics. / van Berkel, K. (2019). Evaluating Networks of Structured Arguments with Support and a Case Study in Mimamsa Dialectics. Workshop on Logic & Argumentation, Wien, TU, Austria. http://hdl.handle.net/20.500.12708/86963
  • Bounded sequent calculi via hypersequents / Lang, T. (2019). Bounded sequent calculi via hypersequents. Fifth TICAMORE MEETING, Wien, Austria. http://hdl.handle.net/20.500.12708/86968
  • Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics / van Berkel, K. (2019). Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics. Fifth TICAMORE MEETING, Wien, Austria. http://hdl.handle.net/20.500.12708/86964
  • Methods to prove non-cohesiveness in canonical models / Pascucci, M. (2019). Methods to prove non-cohesiveness in canonical models. Goedel’s Legacy, Wien, Austria. http://hdl.handle.net/20.500.12708/86938
  • Playing with Derivation Modes and Halting Conditions / Freund, R. (2019). Playing with Derivation Modes and Halting Conditions. In Proceedings of Seventeenth Brainstorming Week on Membrane Computing (pp. 91–108). Artes Gr a cas Moreno, S.L. http://hdl.handle.net/20.500.12708/58039
  • (Tissue) P Systems with Anti-Membranes / Freund, R. (2019). (Tissue) P Systems with Anti-Membranes. In Proceedings of Seventeenth Brainstorming Week on Membrane Computing Sevilla, February 5-8, 2019 (pp. 29–40). Artes Gr a cas Moreno, S.L. http://hdl.handle.net/20.500.12708/58037
  • P Systems: from Anti-Matter to Anti-Rules / Freund, R. (2019). P Systems: from Anti-Matter to Anti-Rules. In Proceedings of Seventeenth Brainstorming Week on Membrane Computing (pp. 41–58). Artes Gr a cas Moreno, S.L. http://hdl.handle.net/20.500.12708/58038
  • Tissue P Systems with Point Mutation Rules / Freund, R., Alhazov, A., Ivanov, S., & Verlan, S. (2019). Tissue P Systems with Point Mutation Rules. In G. Rozenberg (Ed.), Membrane Computing. 19th International Conference, CMC 2018 (pp. 33–57). Springer International Publishing Switzerland. http://hdl.handle.net/20.500.12708/58027
  • Natural Deduction and Normalization Proofs for the Intersection Type Discipline / Aschieri, F. (2019). Natural Deduction and Normalization Proofs for the Intersection Type Discipline. In Electronic Proceedings in Theoretical Computer Science (pp. 29–37). Computing Research Repository (CoRR). https://doi.org/10.4204/eptcs.293.3
  • Beyond Generalized Multiplicities: Register Machines over Groups / Freund, R., Alhazov, A., & Ivanov, S. (2019). Beyond Generalized Multiplicities: Register Machines over Groups. In Seventeenth Brainstorming Week on Membrane Computing Sevilla, February 5 - 8, 2019 (pp. 1–28). Artes Gr a cas Moreno, S.L. http://hdl.handle.net/20.500.12708/57762
  • Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019 / Freund, R., & Holzer, M. (Eds.). (2019). Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019. OCG (Österreichische Computer Gesellschaft). http://hdl.handle.net/20.500.12708/24632

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

  • Dialogue Games as Foundation of Fuzzy Logics / Fermüller, C. (2009). Dialogue Games as Foundation of Fuzzy Logics. In R. Seising & J. Kacprzyk (Eds.), Views on Fuzzy Sets and Systems from Different Perspectives (Vol. 243, pp. 229–245). Springer. https://doi.org/10.1007/978-3-540-93802-6_11
  • A Comparison of Tools for Teaching Formal Software Verification / Feinerer, I., & Salzer, G. (2009). A Comparison of Tools for Teaching Formal Software Verification. Formal Aspects of Computing, 21(3), 293–301. https://doi.org/10.1007/s00165-008-0084-5
  • Giles's Game and the Proof Theory of Lukasiewicz Logic / Fermüller, C. (2009). Giles’s Game and the Proof Theory of Lukasiewicz Logic. Probability, Uncertainty and Rationality 2009, Pontignano, Italy. http://hdl.handle.net/20.500.12708/84912
  • Giles's Game and the Proof Theory of Lukasiewicz Logic / Fermüller, C. G., & Metcalfe, G. (2009). Giles’s Game and the Proof Theory of Lukasiewicz Logic. Studia Logica, 92(1), 27–61. https://doi.org/10.1007/s11225-009-9185-2
  • Fuzzy logic and vagueness: can philosophers learn from Petr Hajek? / Fermüller, C. (2009). Fuzzy logic and vagueness: can philosophers learn from Petr Hajek? In P. Cintula, Z. Hanikova, & V. Svejdar (Eds.), Witnessed Years. Esseays in Honour of Petr Hajek (pp. 373–386). College Publications. http://hdl.handle.net/20.500.12708/26809
  • Truth Value Intervals, Bets, and Dialogue Games / Fermüller, C. (2009). Truth Value Intervals, Bets, and Dialogue Games. In M. Pelis (Ed.), The Logica Yearbook 2008 (pp. 43–57). College Publications. http://hdl.handle.net/20.500.12708/26415
  • Revisiting Giles's Game - Reconciling Fuzzy Logic and Supervaluation / Fermüller, C. (2009). Revisiting Giles’s Game - Reconciling Fuzzy Logic and Supervaluation. In O. Majer, T. Tulenheimo, & A.-V. Pietarinen (Eds.), Games: Unifying Logic, Language, and Philosophy (pp. 209–227). Springer Science. http://hdl.handle.net/20.500.12708/26510
  • A Clausal Approach to Proof Analysis in Second-Order Logic / Hetzl, S., Leitsch, A., Weller, D., & Woltzenlogel-Paleo, B. (2009). A Clausal Approach to Proof Analysis in Second-Order Logic. In A. Nerode & S. Artemov (Eds.), LFCS 2009: Logical Foundations of Computer Science (pp. 214–229). Springer, LNCS. https://doi.org/10.1007/978-3-540-92687-0_15
  • Membrane computing and brain modelling. / Oswald, M. (2009). Membrane computing and brain modelling. Artificial Life and Robotics, 13(2), 390–393. https://doi.org/10.1007/s10015-008-0619-0
  • VMTL–A Modular Termination Laboratory / Schernhammer, F., & Gramlich, B. (2009). VMTL–A Modular Termination Laboratory. In R. Treinen (Ed.), Rewriting Techniques and Applications (pp. 285–294). Springer. https://doi.org/10.1007/978-3-642-02348-4_20
  • Conditional Rewriting (I) / Gramlich, B. (2009). Conditional Rewriting (I). 4th International School on Rewriting (ISR’09), Brasilia (Brazil), Non-EU. http://hdl.handle.net/20.500.12708/84954
  • Conditional Rewriting (IV) / Gramlich, B. (2009). Conditional Rewriting (IV). 4th International School on Rewriting (ISR’09), Brasilia (Brazil), Non-EU. http://hdl.handle.net/20.500.12708/84957
  • Conditional Rewriting (III) / Gramlich, B. (2009). Conditional Rewriting (III). 4th International School on Rewriting (ISR’09), Brasilia (Brazil), Non-EU. http://hdl.handle.net/20.500.12708/84956
  • Conditional Rewriting (II) / Gramlich, B. (2009). Conditional Rewriting (II). 4th International School on Rewriting (ISR’09), Brasilia (Brazil), Non-EU. http://hdl.handle.net/20.500.12708/84955
  • Consistency and minimality of UML class specifications / Sisel, T. (2009). Consistency and minimality of UML class specifications. LIX, Ecole Polytechnique, Palaiseau/Paris, EU. http://hdl.handle.net/20.500.12708/84953
  • Description Problems over Finite Totally-Ordered Domains / Salzer, G. (2009). Description Problems over Finite Totally-Ordered Domains. Moscow-Vienna Workshop on Logic and Computation 2009, Wien, Austria. http://hdl.handle.net/20.500.12708/84952
  • Constraint Satisfaction Problems & Many-Valued Logics / Salzer, G. (2009). Constraint Satisfaction Problems & Many-Valued Logics. Collegium Logicum 2009 (CL2009), Wien, Austria. http://hdl.handle.net/20.500.12708/84951
  • Fast Cut-Elimination by CERES / Leitsch, A. (2009). Fast Cut-Elimination by CERES. Moscow-Vienna Workshop on Logic and Computation 2009, Wien, Austria. http://hdl.handle.net/20.500.12708/84950
  • Linguistics, Logic, and Vagueness / Fermüller, C. (2009). Linguistics, Logic, and Vagueness. Moscow-Vienna Workshop on Logic and Computation, Moscow, Austria. http://hdl.handle.net/20.500.12708/84914
  • Some Critical Remarks on Incompatibility Semantics / Fermüller, C. (2009). Some Critical Remarks on Incompatibility Semantics. Logica 2009, Hejnice, Czech Republic, EU. http://hdl.handle.net/20.500.12708/84913
  • Vagueness at the interface between logic, philosophy, and linguistics / Fermüller, C. (2009). Vagueness at the interface between logic, philosophy, and linguistics. Logical Models of Reasoning with Vague Information, Cejkovice, Czech Republic, EU. http://hdl.handle.net/20.500.12708/84911
  • An Implementation of Nested Pattern Matching in Interaction Nets / Hassan, A., Jiresch, E., & Sato, S. (2009). An Implementation of Nested Pattern Matching in Interaction Nets. In Prelim. Proc. 10nth International Workshop on Rule-Based Programming (RULE’09) (pp. 14–25). http://hdl.handle.net/20.500.12708/53063
  • On Some Implementation Aspects of VMTL / Schernhammer, F., & Gramlich, B. (2009). On Some Implementation Aspects of VMTL. In A. Geser & J. Waldmann (Eds.), Proc. 10th International Workshop on Termination (WST 2009) (pp. 72–75). http://hdl.handle.net/20.500.12708/53062
  • Transformations of Conditional Rewrite Systems Revisited / Gmeiner, K., & Gramlich, B. (2009). Transformations of Conditional Rewrite Systems Revisited. In A. Corradini & U. Montanari (Eds.), Recent Trends in Algebraic Development Techniques (pp. 166–186). Springer. https://doi.org/10.1007/978-3-642-03429-9_12
  • Extending Context-Sensitivity in Term Rewriting / Gramlich, B., & Schernhammer, F. (2009). Extending Context-Sensitivity in Term Rewriting. In M. Fernandez (Ed.), Prelim. Proc. 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), Brasilia, Brazil, June 28, 2009 (pp. 25–29). http://hdl.handle.net/20.500.12708/53059
  • Algebraic foundation of a data model for an extensible space-based collaboration protocol / Craß, S., Kühn, E., & Salzer, G. (2009). Algebraic foundation of a data model for an extensible space-based collaboration protocol. In B. C. Desai, D. Saccà, & S. Greco (Eds.), Proceedings of the 2009 International Database Engineering & Applications Symposium on - IDEAS ’09. ACM. https://doi.org/10.1145/1620432.1620466
  • P Automata with controlled use of minimal Communication rules / Freund, R., Kogler, M., & Verlan, S. (2009). P Automata with controlled use of minimal Communication rules. In H. Bordihn, R. Freund, & M. Holzer (Eds.), Workshop on Non-Classical Models for Automata and Applications (pp. 107–121). Österreichische Computer Ges. http://hdl.handle.net/20.500.12708/53045
  • Bridges between Contextual Linguistic Models of Vagueness and T-Norm Based Fuzzy Logic / Fermüller, C., & Roschger, C. (2009). Bridges between Contextual Linguistic Models of Vagueness and T-Norm Based Fuzzy Logic. In T. Kroupa & J. Vejnarova (Eds.), Proceedings of the 8th Workshop on Uncertainty Processing (pp. 71–79). Universtiy of Economics. http://hdl.handle.net/20.500.12708/52813
  • Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems / Schernhammer, F., & Gramlich, B. (2009). Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems (No. E1852-2009–01). http://hdl.handle.net/20.500.12708/36081
  • Extending Context-Sensitivity in Term Rewriting / Gramlich, B., & Schernhammer, F. (2009). Extending Context-Sensitivity in Term Rewriting (No. E1852-2009–02). http://hdl.handle.net/20.500.12708/36080

2008

2007

2006

  • Towards a clausal analysis of cut-elimination / Baaz, M., & Leitsch, A. (2006). Towards a clausal analysis of cut-elimination. Journal of Symbolic Computation, 41, 381–410. http://hdl.handle.net/20.500.12708/172032
  • Tree Tuple Languages from the Logic Programming Point of View / Salzer, G., & Limet, S. (2006). Tree Tuple Languages from the Logic Programming Point of View. Journal of Automated Reasoning, 37(4), 323–349. http://hdl.handle.net/20.500.12708/173468
  • Routes and Products of Monoids / Mateescu, A., & Freund, R. (2006). Routes and Products of Monoids. Fundamenta Informaticae, 73(1–2), 205–211. http://hdl.handle.net/20.500.12708/173450
  • Cell/symbol complexity of tissue P systems with symport/antiport rules / Alhazov, A., Freund, R., & Oswald, M. (2006). Cell/symbol complexity of tissue P systems with symport/antiport rules. International Journal of Foundations of Computer Science, 17(1), 3–25. http://hdl.handle.net/20.500.12708/173451
  • (Tissue) P Systems with Unit Rules and Energy Assigned to Membranes / Alhazov, A., Freund, R., Leporati, A., Oswald, M., & Zandron, C. (2006). (Tissue) P Systems with Unit Rules and Energy Assigned to Membranes. Fundamenta Informaticae, 74(4), 391–408. http://hdl.handle.net/20.500.12708/173452
  • P colonies and prescribed teams / Freund, R., & Oswald, M. (2006). P colonies and prescribed teams. International Journal of Computer Mathematics, 83(7), 569–592. http://hdl.handle.net/20.500.12708/173454
  • Membrane division, restricted membrane creation and object complexity in P systems / Alhazov, A., Freund, R., & Riscos-Núñez, A. (2006). Membrane division, restricted membrane creation and object complexity in P systems. International Journal of Computer Mathematics, 83(7), 529–548. http://hdl.handle.net/20.500.12708/173453
  • Contextual Array Grammars / Freund, R., Paun, G., & Rozenberg, G. (2006). Contextual Array Grammars. In K. G. Subramanian (Ed.), Formal Models, Languages and Applications (pp. 112–136). World Scientific. http://hdl.handle.net/20.500.12708/25402
  • Tissue P systems with mate and drip operations / Freund, R., & Oswald, M. (2006). Tissue P systems with mate and drip operations. In N. Busi & C. Zandron (Eds.), MeCBIC2006 Workshop on Membrane Computing and Biologically Inspired Process Calculi (pp. 1–12). http://hdl.handle.net/20.500.12708/51733
  • A Similarity Criterion for Proofs (abstract) / Hetzl, S. (2006). A Similarity Criterion for Proofs (abstract). In A. Beckmann, U. Berger, B. Löwe, & J. V. Tucker (Eds.), Logical Approaches to Computational Barriers (p. 295). University of Wales Swansea Report Series. http://hdl.handle.net/20.500.12708/51677
  • System Description: The Cut-Elimination System CERES / Baaz, M., Hetzl, S., Leitsch, A., Richter, C., & Spohr, H. (2006). System Description: The Cut-Elimination System CERES. In G. Sutcliffe, R. Schmidt, & S. Schulz (Eds.), ESCoR 2006 Empirically Successful Computerized Reasoning (p. 9). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/176627
  • Basic Rewriting via Logic Programming, with an Application to the Reachability Problem / Salzer, G., & Limet, S. (2006). Basic Rewriting via Logic Programming, with an Application to the Reachability Problem. Journal of Automata, Languages and Combinatorics, 11(1), 107–142. http://hdl.handle.net/20.500.12708/173469
  • Proof transformation by CERES / Baaz, M., Hetzl, S., Leitsch, A., Richter, C., & Spohr, H. (2006). Proof transformation by CERES. Lecture Notes in Computer Science, 82–93. https://doi.org/10.1007/11812289_8
  • A small universal antiport P system with forbidden context / Freund, R., & Oswald, M. (2006). A small universal antiport P system with forbidden context. DCFS (Descriptional Complexity of Formal Systems), Las Cruces, New Mexico, USA, Non-EU. http://hdl.handle.net/20.500.12708/84575
  • Special variants of P systems with one catalyst in one membrane / Freund, R. (2006). Special variants of P systems with one catalyst in one membrane. DCFS (Descriptional Complexity of Formal Systems), Las Cruces, New Mexico, USA, Non-EU. http://hdl.handle.net/20.500.12708/84574
  • (Tissue) P Systems with Mate and Drip Operations and Cut and Paste Operations / Freund, R., & Oswald, M. (2006). (Tissue) P Systems with Mate and Drip Operations and Cut and Paste Operations. ESF Workshop on Automata and formal languages for DNA computation and bioinformatics, Como, Italien, EU. http://hdl.handle.net/20.500.12708/84573
  • Algebraic representation of regular array languages / Freund, R. (2006). Algebraic representation of regular array languages. ESF Exploratory Workshop: Advances on Two-dimensional Language Theory, Salerno, Italien, EU. http://hdl.handle.net/20.500.12708/84571
  • Special Variants of P Automata / Oswald, M. (2006). Special Variants of P Automata. ESF Workshop on Automata and formal languages for DNA computation and bioinformatics, Como, Italien, EU. http://hdl.handle.net/20.500.12708/84572
  • Syntactical pattern recognition with 2-dimensional array grammars and array automata / Freund, R. (2006). Syntactical pattern recognition with 2-dimensional array grammars and array automata. ESF Exploratory Workshop: Advances on Two-dimensional Language Theory, Salerno, Italien, EU. http://hdl.handle.net/20.500.12708/84570
  • 2-dimensional k-level Parallel Array Grammars / Oswald, M. (2006). 2-dimensional k-level Parallel Array Grammars. ESF Exploratory Workshop: Advances on Two-dimensional Language Theory, Salerno, Italien, EU. http://hdl.handle.net/20.500.12708/84569
  • Independant Agents in a Globalized World Modelled by Tissue P Systems / Oswald, M. (2006). Independant Agents in a Globalized World Modelled by Tissue P Systems. International Symposium on Artificial Life and Robotics (AROB 11th ’06), Beppu, Japan, Non-EU. http://hdl.handle.net/20.500.12708/84568
  • CERES: Cut-Elimination by Resolution / Leitsch, A. (2006). CERES: Cut-Elimination by Resolution. MANYVAL 06, Gargnano, EU. http://hdl.handle.net/20.500.12708/84555
  • Comparing Mathematical Proofs / Hetzl, S. (2006). Comparing Mathematical Proofs. Studia Logica International Conference; Towards Mathematical Philosophy; Trends in Logic IV, Torun, Poland, EU. http://hdl.handle.net/20.500.12708/84554
  • Lorenzen, Giles and beyond:from dialogue games to sequents and hypersequents / Fermüller, C. (2006). Lorenzen, Giles and beyond:from dialogue games to sequents and hypersequents. Universita degli Studi di Siena, Siena, Italy, EU. http://hdl.handle.net/20.500.12708/84524
  • Game based semantics for Lukasiewicz logic: acquainting Giles's gamblers with Mundici's Pinocchio / Fermüller, C. (2006). Game based semantics for Lukasiewicz logic: acquainting Giles’s gamblers with Mundici’s Pinocchio. Studia Logica International Conference `Towards Mathematical Philosophy -- Trends in Logic IV’, Turun, Poland, EU. http://hdl.handle.net/20.500.12708/84523
    Project: Dialogspielsemantik (2006–2008)
  • Measuring Uncertainty: On Probabilities, Possibilities, Likelihoods, Plausibilities and Degrees of Truth / Fermüller, C. (2006). Measuring Uncertainty: On Probabilities, Possibilities, Likelihoods, Plausibilities and Degrees of Truth. Uncertainty: Reasoning about probability and vagueness, Prague International Colloquium, Prague, Cech Republic, EU. http://hdl.handle.net/20.500.12708/84522
    Project: Dialogspielsemantik (2006–2008)
  • Theorien der Vagheit und Fuzzy Logic / Fermüller, C. (2006). Theorien der Vagheit und Fuzzy Logic. Kolloquium Institut Wiener Kreis (IVC), Wien, Austria. http://hdl.handle.net/20.500.12708/84521
    Project: Dialogspielsemantik (2006–2008)
  • Automatically Proving Confluence of Non-Terminating Rewrite Systems via a Generalized Newman-Style Approach / Gramlich, B. (2006). Automatically Proving Confluence of Non-Terminating Rewrite Systems via a Generalized Newman-Style Approach. Seminari del Dipartimento di Informatica, Università degli Studi di Verona, Verona, Italy, EU. http://hdl.handle.net/20.500.12708/84498
  • Timed Concurrent Constraint Programming with Instantaneous Computations / Alpuente, M., Gramlich, B., & Villanueva, A. (2006). Timed Concurrent Constraint Programming with Instantaneous Computations. In P. Lucio (Ed.), Proc. 6th Spanish Conference on Programming and Computer Languages (PROLE 2006) (pp. 221–230). The University of the Basque Country. http://hdl.handle.net/20.500.12708/51394
  • Generalizing Newman's Lemma for Left-Linear Rewrite Systems / Gramlich, B., & Lucas, S. (2006). Generalizing Newman’s Lemma for Left-Linear Rewrite Systems. In F. Pfenning (Ed.), Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, Washington, USA, August 12-14, 2006, Proceedings, LNCS 4098 (pp. 66–80). Springer. http://hdl.handle.net/20.500.12708/51393
  • Automated Tools for Teaching Formal Software Verification / Feinerer, I., & Salzer, G. (2006). Automated Tools for Teaching Formal Software Verification. In P. Boca (Ed.), Proceedings of Teaching Formal Methods 2006 (p. 5). BCS. http://hdl.handle.net/20.500.12708/51752
  • (Mem)Brane Systems and Tissue P Systems with Mate and Drip Operations / Freund, R., & Oswald, M. (2006). (Mem)Brane Systems and Tissue P Systems with Mate and Drip Operations. In R. Freund & M. Oswald (Eds.), Proceedings 16.Theorietag Automaten und Formale Sprachen (pp. 51–56). http://hdl.handle.net/20.500.12708/51738
  • P Systems for Modelling Biological Processes in Living Cells / Freund, R., & Gschwandtner, T. (2006). P Systems for Modelling Biological Processes in Living Cells. In R. Freund & M. Oswald (Eds.), Proceedings 16.Theorietag Automaten und Formale Sprachen (pp. 46–50). http://hdl.handle.net/20.500.12708/51737
  • Modelling Distributed Systems by P Systems / Binder, A., Freund, R., Lojka, G., & Oswald, M. (2006). Modelling Distributed Systems by P Systems. In R. Freund & M. Oswald (Eds.), Proceedings 16.Theorietag Automaten und Formale Sprachen (pp. 22–27). http://hdl.handle.net/20.500.12708/51736
  • Membrane Systems with Attributes for Modelling Business Transactions / Freund, R., Oswald, M., & Schirk, T. (2006). Membrane Systems with Attributes for Modelling Business Transactions. In R. Freund & M. Oswald (Eds.), Proceedings 16.Theorietag Automaten und Formale Sprachen (pp. 57–62). http://hdl.handle.net/20.500.12708/51735
  • Extended Spiking Neural P Systems as Generating Devices for Strings and Vectors of Non-Negative Integers / Alhazov, A., Freund, R., Oswald, M., & Slavkovik, M. (2006). Extended Spiking Neural P Systems as Generating Devices for Strings and Vectors of Non-Negative Integers. In R. Freund & M. Oswald (Eds.), Proceedings 16.Theorietag Automaten und Formale Sprachen (pp. 17–21). http://hdl.handle.net/20.500.12708/51734
  • Modeling the Dynamical Parallelism of Bio-Systems / Csuhaj-Varjú, E., Freund, R., & Sburlan, D. (2006). Modeling the Dynamical Parallelism of Bio-Systems. In H. J. Hoogeboom, G. Paun, & G. Rozenberg (Eds.), pre-proceedings of the 7th Workshop on Membrane Computing WMC7 (pp. 290–310). http://hdl.handle.net/20.500.12708/51732
  • Tissue P Systems with Communication Modes / Bernardini, F., & Freund, R. (2006). Tissue P Systems with Communication Modes. In H. J. Hoogeboom, G. Paun, & G. Rozenberg (Eds.), pre-proceedings of the 7th Workshop on Membrane Computing WMC7 (pp. 132–144). http://hdl.handle.net/20.500.12708/51731
  • Extended Spiking Neural P Systems Generating Strings and Vectors of Non-Negative Integers / Alhazov, A., Freund, R., Oswald, M., & Slavkovik, M. (2006). Extended Spiking Neural P Systems Generating Strings and Vectors of Non-Negative Integers. In H. J. Hoogeboom, G. Paun, & G. Rozenberg (Eds.), pre-proceedings of the 7th Workshop on Membrane Computing WMC7 (pp. 88–101). http://hdl.handle.net/20.500.12708/51730
  • Small Universal Antiport P Systems and Universal Multiset Grammars / Freund, R., & Oswald, M. (2006). Small Universal Antiport P Systems and Universal Multiset Grammars. In C. Graciani-Díaz, G. Paun, Á. Romero-Jiménez, & F. Sancho-Caparrini (Eds.), Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume II (pp. 51–64). Fénix Editora. http://hdl.handle.net/20.500.12708/51729
  • Particular Results for Variants of P Systems with One Catalyst in One Membrane / Freund, R. (2006). Particular Results for Variants of P Systems with One Catalyst in One Membrane. In C. Graciani-Díaz, G. Paun, Á. Romero-Jiménez, & F. Sancho-Caparrini (Eds.), Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume II (pp. 41–50). Fénix Editora. http://hdl.handle.net/20.500.12708/51728
  • On String Languages Generated by Spiking Neural P Systems / Chen, H., Freund, R., Ionescu, M., Paun, G., & Pérez-Jiménez, M. (2006). On String Languages Generated by Spiking Neural P Systems. In M. A. Gutiérrez-Naranjo, G. Paun, A. Riscos-Núñez, & F. J. Romero-Campero (Eds.), Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume I (pp. 169–194). Fénix Editora. http://hdl.handle.net/20.500.12708/51727
  • Multiset Random Context Grammars, Checkers, and Transducers / Cavaliere, M., Freund, R., Oswald, M., & Sburlan, D. (2006). Multiset Random Context Grammars, Checkers, and Transducers. In M. A. Gutiérrez-Naranjo, G. Paun, A. Riscos-Núñez, & F. J. Romero-Campero (Eds.), Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume I (pp. 113–132). Fénix Editora. http://hdl.handle.net/20.500.12708/51726
  • Two Universality Results for (Mem)Brane Systems / Besozzi, D., Busi, N., Franco, G., Freund, R., & Paun, G. (2006). Two Universality Results for (Mem)Brane Systems. In M. A. Gutiérrez-Naranjo, G. Paun, A. Riscos-Núñez, & F. J. Romero-Campero (Eds.), Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume I (pp. 49–62). Fénix Editora. http://hdl.handle.net/20.500.12708/51725
  • Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules / Alhazov, A., Freund, R., & Oswald, M. (2006). Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. In R. Freund, G. Paun, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing · 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers (pp. 97–114). Springer LNCS 3850. http://hdl.handle.net/20.500.12708/51724
  • Computational Power of Symport/Antiport: History, Advances, and Open Problems / Alhazov, A., Freund, R., & Rogozhin, Y. (2006). Computational Power of Symport/Antiport: History, Advances, and Open Problems. In R. Freund, G. Paun, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing · 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers (pp. 1–31). Springer LNCS 3850. http://hdl.handle.net/20.500.12708/51723
  • Applications of membrane systems in distributed systems / Binder, A., Freund, R., Lojka, G., & Oswald, M. (2006). Applications of membrane systems in distributed systems. In L. Pan & G. Paun (Eds.), Pre-proc. of Int. Conf. on Bio-Inspired Computing - Theory and Applications, BIC-TA 2006, Membrane Computing Section (pp. 37–50). http://hdl.handle.net/20.500.12708/51722
  • How a membrane agent buys goods in a membrane store / Freund, R., Oswald, M., & Schirk, T. (2006). How a membrane agent buys goods in a membrane store. In L. Pan & G. Paun (Eds.), Pre-proc. of Int. Conf. on Bio-Inspired Computing - Theory and Applications, BIC-TA 2006, Membrane Computing Section (pp. 93–102). http://hdl.handle.net/20.500.12708/51721
  • Proof Transformation by CERES / Baaz, M., Hetzl, S., Leitsch, A., Richter, C., & Spohr, H. (2006). Proof Transformation by CERES. In J. M. Borwein & W. Farmer (Eds.), MKM 2006 (pp. 82–93). Springer. http://hdl.handle.net/20.500.12708/51679
  • Combining Supervaluation and Degree Based Reasoning Under Vagueness / Fermüller, C., & Kosik, R. (2006). Combining Supervaluation and Degree Based Reasoning Under Vagueness. In Logic for Programming, Artificial Intelligence, and Reasoning (pp. 212–226). Springer. http://hdl.handle.net/20.500.12708/51487
    Project: Dialogspielsemantik (2006–2008)
  • Model Representation via Contexts and Implicit Generalizations / Fermüller, C., & Pichler, R. (2006). Model Representation via Contexts and Implicit Generalizations. In Logics in Artificial Intelligence (LNAI) (pp. 164–176). Springer-Verlag. http://hdl.handle.net/20.500.12708/51419
  • Timed Concurrent Constraint Programming with External Functions / Alpuente, M., Gramlich, B., & Villanueva, A. (2006). Timed Concurrent Constraint Programming with External Functions (DSIC-II//13/06). http://hdl.handle.net/20.500.12708/33068
  • Membrane Computing · 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers / Freund, R., Paun, G., Rozenberg, G., & Salomaa, A. (Eds.). (2006). Membrane Computing · 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers. Springer LNCS 3850. http://hdl.handle.net/20.500.12708/22337

2005

  • Reduction Strategies in Rewriting and Programming / Gramlich, B., & Lucas, S. (2005). Reduction Strategies in Rewriting and Programming. Journal of Symbolic Computation, 40(1), 745–747. https://doi.org/10.1016/j.jsc.2004.12.006
  • P Systems Working in the Sequential Mode on Arrays and Strings / Freund, R. (2005). P Systems Working in the Sequential Mode on Arrays and Strings. International Journal of Foundations of Computer Science, 16(4), 663–682. http://hdl.handle.net/20.500.12708/173348
  • P systems with active membranes and without polarizations / Freund, R., & Paun, A. (2005). P systems with active membranes and without polarizations. Soft Computing, 9(9), 657–663. http://hdl.handle.net/20.500.12708/173352
  • Optimal Results for the Computational Completeness of Gemmating (Tissue) P Systems / Freund, R., Oswald, M., & Paun, A. (2005). Optimal Results for the Computational Completeness of Gemmating (Tissue) P Systems. International Journal of Foundations of Computer Science, 16(5), 929–942. http://hdl.handle.net/20.500.12708/173344
  • Tissue P Systems with Channel States / Freund, R., Paun, G., & Pérez-Jiménez, M. (2005). Tissue P Systems with Channel States. Theoretical Computer Science, 330, 101–116. http://hdl.handle.net/20.500.12708/173350
  • Representations of Recursively Enumerable Array Languages by Contextual Array Grammars / Fernau, H., Freund, R., & Holzer, M. (2005). Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundamenta Informaticae, 64(1–4), 159–170. http://hdl.handle.net/20.500.12708/173351
  • Computationally Universal P Systems without Priorities: Two Catalysts are Sufficient / Freund, R., Kari, L., Oswald, M., & Sosik, P. (2005). Computationally Universal P Systems without Priorities: Two Catalysts are Sufficient. Theoretical Computer Science, 330, 251–266. http://hdl.handle.net/20.500.12708/173321
  • A Graph-Theoretic Approach to Steganography / Hetzl, S., & Mutzel, P. (2005). A Graph-Theoretic Approach to Steganography. In J. Dittmann, S. Katzenbeisser, & A. Uhl (Eds.), 9th IFIP Conference on Communications and Multimedia Security (CMS 2005) (pp. 119–128). Springer. http://hdl.handle.net/20.500.12708/51077
  • Uniform Rules and Dialogue Games for Fuzzy Logics / Ciabattoni, A., Fermüller, C., & Metcalfe, G. (2005). Uniform Rules and Dialogue Games for Fuzzy Logics. In F. Baader & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 496–510). Springer. http://hdl.handle.net/20.500.12708/50977
  • The Resolution Principle / Leitsch, A., & Fermüller, C. (2005). The Resolution Principle. In D. M. Gabbay & F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd ed., Volume 12 (pp. 87–173). Springer. http://hdl.handle.net/20.500.12708/25357
  • Strategic Issues, Problems and Challenges in Inductive Theorem Proving / Gramlich, B. (2005). Strategic Issues, Problems and Challenges in Inductive Theorem Proving. Electronic Notes in Theoretical Computer Science (ENTCS), 125(2), 5–43. http://hdl.handle.net/20.500.12708/173323
  • Reduction Strategies in Rewriting and Programming (Special Issue, Journal of Symbolic Computation): Editorial / Gramlich, B., & Lucas, S. (2005). Reduction Strategies in Rewriting and Programming (Special Issue, Journal of Symbolic Computation): Editorial. Journal of Symbolic Computation, 40(1), 745–747. http://hdl.handle.net/20.500.12708/173322
  • Modelling Artificial Life by Attributed Eco-array Grammars / Binder, A., Freund, R., & Oswald, M. (2005). Modelling Artificial Life by Attributed Eco-array Grammars. Artificial Life and Robotics, 9(1), 63–66. http://hdl.handle.net/20.500.12708/173349
  • Abstracting from the Propositional Structure of First-Order Proofs / Hetzl, S., & Leitsch, A. (2005). Abstracting from the Propositional Structure of First-Order Proofs. Paris-Vienna Workshop 2005, Paris, EU. http://hdl.handle.net/20.500.12708/84469
  • Cut-Elimination: Experiments with CERES / Baaz, M., Hetzl, S., Leitsch, A., Richter, C., & Spohr, H. (2005). Cut-Elimination: Experiments with CERES. Second Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/84468
  • CERES in many-valued logics / Leitsch, A. (2005). CERES in many-valued logics. Second Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/84460
  • Computational Analysis of Proofs / Leitsch, A. (2005). Computational Analysis of Proofs. European Summer School in Logic Language and Information 2005, Edinburgh, U.K., EU. http://hdl.handle.net/20.500.12708/84459
  • Membrane Computing / Freund, R. (2005). Membrane Computing. 4th WSEAS International Conference on ARTIFICIAL INTELLIGENCE, KNOWLEDGE ENGINEERING and DATABASES (AIKED `05), Salzburg, Austria. http://hdl.handle.net/20.500.12708/84457
  • The Enigma of Quantifying Vague Information / Fermüller, C. (2005). The Enigma of Quantifying Vague Information. The Logic of Soft Computing~IV and 4th ERCIM, Ostrava, Czech Republic, Austria. http://hdl.handle.net/20.500.12708/84452
  • Decision Procedure and Model Building Based on Hypersequent Calculi / Fermüller, C. (2005). Decision Procedure and Model Building Based on Hypersequent Calculi. LPAR Workshop on Analytic Proof Systems, Montevideo, Uruguay, Austria. http://hdl.handle.net/20.500.12708/84453
  • From classical to many-valued reasoning via dialogue games / Fermüller, C. (2005). From classical to many-valued reasoning via dialogue games. Second Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/84451
  • From classical to many-valued reasoning via dialogue games / Fermüller, C. (2005). From classical to many-valued reasoning via dialogue games. Dpt. of Computer Sciences, Czech Academy of Sciences, Prague, Cech Republic, Austria. http://hdl.handle.net/20.500.12708/84450
  • The τ model, fomalizing topic maps / Salzer, G., & Barta, R. (2005). The τ model, fomalizing topic maps. In Proceedings of the 2nd-Asia-Pacific conference on Conceptual modelling (pp. 37–42). Australian Computer Society. http://hdl.handle.net/20.500.12708/51781
  • Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules / Alhazov, A., Freund, R., & Oswald, M. (2005). Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. In F. Freund, G. Lojka, M. Oswald, & G. Paun (Eds.), Preproceedings of the 6th International Workshop on Membrane Computing WMC6 (pp. 123–146). http://hdl.handle.net/20.500.12708/51167
  • Computational Power of Symport/Antiport: History, Advances and Open Problems / Alhazov, A., Freund, R., & Rogozhin, Y. (2005). Computational Power of Symport/Antiport: History, Advances and Open Problems. In R. Freund, G. Lojka, M. Oswald, & G. Paun (Eds.), Preproceedings of the 6th International Workshop on Membrane Computing WMC6 (pp. 44–78). http://hdl.handle.net/20.500.12708/51166
  • Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells / Alhazov, A., Freund, R., & Oswald, M. (2005). Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. In C. De Felice & A. Restivo (Eds.), Developments in Language Theory. 9th International Conference, DLT 2005 (pp. 100–111). Springer. http://hdl.handle.net/20.500.12708/51165
  • P Systems Generating Trees / Freund, R., Oswald, M., & Paun, A. (2005). P Systems Generating Trees. In G. Mauri, G. Paun, M. Pérez-Jiménez, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing. International Workshop, WMC 2004 (pp. 309–319). Springer, LNCS. http://hdl.handle.net/20.500.12708/51164
  • On the Efficiency of P Systems with Active Membranes and Two Polarizations / Alhazov, A., & Freund, R. (2005). On the Efficiency of P Systems with Active Membranes and Two Polarizations. In G. Mauri, G. Paun, M. Pérez-Jiménez, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing. International Workshop, WMC 2004 (pp. 146–160). Springer, LNCS. http://hdl.handle.net/20.500.12708/51163
  • Asynchronous P Systems and P Systems Working in the Sequential Mode / Freund, R. (2005). Asynchronous P Systems and P Systems Working in the Sequential Mode. In G. Mauri, G. Paun, M. Pérez-Jiménez, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing. International Workshop, WMC 2004 (pp. 36–62). Springer, LNCS. http://hdl.handle.net/20.500.12708/51162
  • Sequential P Systems with Unit Rules and Energy Assigned to Membranes / Freund, R., Leporati, A., Oswald, M., & Zandron, C. (2005). Sequential P Systems with Unit Rules and Energy Assigned to Membranes. In M. Margenstern (Ed.), Machines, Computations, and Universality (pp. 200–210). Springer, LNCS. http://hdl.handle.net/20.500.12708/51161
  • Computational Completeness of P Systems with Active Membranes and Two Polarizations / Alhazov, A., Freund, R., & Paun, G. (2005). Computational Completeness of P Systems with Active Membranes and Two Polarizations. In M. Margenstern (Ed.), Machines, Computations, and Universality (pp. 82–92). Springer, LNCS. http://hdl.handle.net/20.500.12708/51160
  • Refining the Nonterminal Complexity of Graph-controlled Grammars / Fernau, H., Freund, R., Oswald, M., & Reinhardt, K. (2005). Refining the Nonterminal Complexity of Graph-controlled Grammars. In C. Mereghetti, B. Palano, G. Pighizzini, & D. Wotschke (Eds.), Seventh International Workshop on Descriptional Complexity of Formal Systems, Proceedings (pp. 110–121). http://hdl.handle.net/20.500.12708/51159
  • P Colonies Working in the Maximally Parallel and in the Sequential Mode / Freund, R., & Oswald, M. (2005). P Colonies Working in the Maximally Parallel and in the Sequential Mode. In G. Ciobanu & G. Paun (Eds.), Proceedings of the 1st International Workshop on Theory and Application of P Systems (pp. 49–56). http://hdl.handle.net/20.500.12708/51158
  • One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems / Alhazov, A., Freund, R., & Riscos-Núñez, A. (2005). One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems. In G. Ciobanu & G. Paun (Eds.), Proceedings of the 1st International Workshop on Theory and Application of P Systems (pp. 9–18). ??? http://hdl.handle.net/20.500.12708/51157
  • Tissue P Systems with Symport/Antiport Rules of One Symbol are Computationally Universal / Freund, R., & Oswald, M. (2005). Tissue P Systems with Symport/Antiport Rules of One Symbol are Computationally Universal. In M. A. Gutiérrez-Naranjo, G. Paun, & M. Pérez-Jiménez (Eds.), Cellular Computing (Complexity Aspects) (pp. 187–200). Fénix Editora. http://hdl.handle.net/20.500.12708/51153
  • Some Optimal Results on Symport/Antiport P Systems with Minimal Cooperation / Alhazov, A., Freund, R., & Rogozhin, Y. (2005). Some Optimal Results on Symport/Antiport P Systems with Minimal Cooperation. In M. A. Gutiérrez-Naranjo, G. Paun, & M. Pérez-Jiménez (Eds.), Cellular Computing (Complexity Aspects) (pp. 23–36). Fénix Editora. http://hdl.handle.net/20.500.12708/51152
  • Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells / Alhazov, A., Freund, R., & Oswald, M. (2005). Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. In M. A. Gutiérrez-Naranjo, G. Paun, & M. Pérez-Jiménez (Eds.), Cellular Computing (Complexity Aspects) (pp. 7–22). Fénix Editora. http://hdl.handle.net/20.500.12708/51151
  • Matrix Languages, Register Machines, Vector Addition Systems / Freund, R., Ibarra, O. H., Paun, G., & Yen, H.-C. (2005). Matrix Languages, Register Machines, Vector Addition Systems. In M. A. Gutiérrez-Naranjo, A. Riscos-Núñez, F. J. Romero-Campero, & D. Sburlan (Eds.), Third Brainstorming Week on Membrane Computing (pp. 155–168). Fénix Editora. http://hdl.handle.net/20.500.12708/51150
  • Event-related Outputs of Computations in P Systems / Cavaliere, M., Freund, R., Leitsch, A., & Paun, G. (2005). Event-related Outputs of Computations in P Systems. In M. A. Gutiérrez-Naranjo, A. Riscos-Núñez, F. J. Romero-Campero, & D. Sburlan (Eds.), Third Brainstorming Week on Membrane Computing (pp. 107–122). Fénix Editora. http://hdl.handle.net/20.500.12708/51149
  • P Systems with One Membrane and Symport/Antiport Rules of Five Symbols are Coputationally Complete / Alhazov, A., & Freund, R. (2005). P Systems with One Membrane and Symport/Antiport Rules of Five Symbols are Coputationally Complete. In M. A. Gutiérrez-Naranjo, A. Riscos-Núñez, F. J. Romero-Campero, & D. Sburlan (Eds.), Third Brainstorming Week on Membrane Computing (pp. 19–28). Fénix Editora. http://hdl.handle.net/20.500.12708/51148
  • Optimal Nonterminal Complexity of Graph-controlled Grammars / Fernau, H., Freund, R., Oswald, M., & Reinhardt, K. (2005). Optimal Nonterminal Complexity of Graph-controlled Grammars. In H. Fernau (Ed.), 15. Theorietag der GI Fachgruppe 0.1.5 Automaten und Formale Sprachen (pp. 13–17). http://hdl.handle.net/20.500.12708/51147
  • Membrane Systems as a Model for Distributed Computing / Binder, A., Freund, R., Lojka, G., & Oswald, M. (2005). Membrane Systems as a Model for Distributed Computing. In H. Fernau (Ed.), 15. Theorietag der GI Fachgruppe 0.1.5 Automaten und Formale Sprachen (pp. 1–5). http://hdl.handle.net/20.500.12708/51146
  • Analytic Systems and Dialogue Games / Fermüller, C. (2005). Analytic Systems and Dialogue Games. In B. Beckert (Ed.), TABLEAUX 2005, Position Papers and Tutorial Descriptions (pp. 43–52). Fachberichte Informatik. http://hdl.handle.net/20.500.12708/51135
  • Model Representation via Contexts and Implicit Generalizations / Fermüller, C., & Pichler, R. (2005). Model Representation via Contexts and Implicit Generalizations. In Automated Deduction - CADE-20 (pp. 409–423). Springer Science + Business Media. http://hdl.handle.net/20.500.12708/51026
  • Resolution Theorem Proving: a logical point of view / Leitsch, A. (2005). Resolution Theorem Proving: a logical point of view. In Logic Colloquium ’01 (pp. 3–42). Association of Symbolic Logic, A K Peters, Ltd. http://hdl.handle.net/20.500.12708/51012
  • Cut-Elimination: Experiments with CERES / Baaz, M., Hetzl, S., Leitsch, A., Richter, C., & Spohr, H. (2005). Cut-Elimination: Experiments with CERES. In LOgic for Programming, Artificial Intelligence, and Reasoning (pp. 481–495). Springer, LNAI. http://hdl.handle.net/20.500.12708/51011
  • CERES in Many-Valued Logics / Leitsch, A., & Baaz, M. (2005). CERES in Many-Valued Logics. In Logic for Programming, Artificial Intelligence, and Reasoning (pp. 1–20). Springer, LNAI. http://hdl.handle.net/20.500.12708/51010
  • CERES in many-valued logics / Baaz, M., & Leitsch, A. (2005). CERES in many-valued logics. In F. Baader & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LNAI 3452) (pp. 1–20). Springer. http://hdl.handle.net/20.500.12708/40591
  • Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, Septemebr 2005, Proceedings, LNAI 3717 / Gramlich, B. (Ed.). (2005). Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, Septemebr 2005, Proceedings, LNAI 3717. Springer-Verlag. http://hdl.handle.net/20.500.12708/22286

2004

2003

2002

 

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

 

  • Ewa Vesely: Vereinbarkeit vom Beruf/Forschung und Pflege von Angehörigen
    2016 / HR Inside Summit Award 2016, BRONZE / Austria / Website
  • Ewa Vesely: Unterstützungsmaßnahmen für pflegende Angehörige
    2016 / Austria / Website
  • Agata Ciabattoni: Nichtklassische Beweise: Theorie, Automatisierung, Anwendung
    2011 / START-Programm / Austria

Soon, this page will include additional information such as reference projects, conferences, events, and other research activities.

Until then, please visit Theory and Logic’s research profile in TISS .