2022W

• Anatomy and Histology / 185.330 / VO
• Bachelor Thesis for Informatics and Business Informatics / 185.A26 / PR
• Formal Language Theory / 185.A42 / VU
• Fundamentals of Digital Systems / 183.580 / VU
• Fundamentals of Digital Systems / 192.134 / VU
• Introducrtion to Clinics / 185.329 / VO
• Introduction to Logical Methods in Computer Science / 184.766 / VO
• Introduction to Programming 1 / 185.A91 / VU
• Logic and Computability / 185.A45 / VU
• Membrane Computing / 185.A70 / VU
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Presentation and Moderation / 185.A62 / VU
• Project in Computer Science 1 / 185.A36 / PR
• Project in Computer Science 2 / 185.A37 / PR
• Project in Medical Informatics / 185.A30 / PR
• Propädeutikum für Informatik / 180.771 / VU
• Research Seminar for Master and PhD students / 185.A39 / SE
• Research Seminar LogiCS / 184.767 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar for Master Students in Logic and Computation / 180.773 / SE
• Seminar for Master Students in Medical Informatics / 180.776 / SE
• Seminar in Logic / 192.132 / SE
• Theoretical Computer Science and Logics / 185.278 / VU

2023S

• Bachelor Thesis for Informatics and Business Informatics / 185.A26 / PR
• Basics of physiology and pathology / 185.A47 / VO
• Clinics / 185.334 / VO
• Deontic Logic for Normative Reasoning / 192.130 / VU
• Formal Modelling / 185.A06 / VU
• Foundations of Computer and Communication Systems / 192.121 / VU
• Fundamentals of Computer Engineering for Business Informatics / 185.A74 / VU
• Fundamentals of programming and algorithms / 192.097 / VU
• Introduction to Logical Methods in Computer Science / 184.766 / VO
• Introduction to Programming 1 / 185.A91 / VU
• Introduction to Theoretical Computer Science and Logics / 192.071 / VU
• Legal Basics of Medical Health Care / 185.A57 / VO
• Molecular Computing / 185.326 / VU
• Non-classical Logics / 192.085 / VU
• Non-monotonic Extension of Temporal Logic / 199.107 / VU
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Privatissimum on Didactics of Informatics / 192.100 / SE
• Project in Computer Science 1 / 185.A36 / PR
• Project in Computer Science 2 / 185.A37 / PR
• Project in Medical Informatics / 185.A30 / PR
• ProWriting -- Effective Research Project Proposal Writing for Public Funding / 195.109 / VU
• Research Seminar for Master and PhD students / 185.A39 / SE
• Research Seminar LogiCS / 184.767 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar for Master Students in Logic and Computation / 180.773 / SE
• Seminar for Master Students in Medical Informatics / 180.776 / SE
• Seminar in Logic / 185.316 / SE
• Smart Contracts / 192.078 / VU

• Training and Guiding AI Agents with Ethical Rules
  2023 – 2027 / Vienna Science and Technology Fund (WWTF)
• Mosaic -- modal logics
  2021 – 2025 / European Commission
• Axiomatizing conditional normative reasoning
  2021 – 2023 / Austrian Science Fund (FWF) / Publications: 106736, 142664, 86211, 87343, 88248
• From Semantic Games to Analytic Calculi – and Back
  2019 – 2023 / Austrian Science Fund (FWF) / Publications: 142651, 147747, 147846, 147856, 149720, 84985
• On the Computational Interpretation of Intermediate Logics
  2019 – 2022 / Austrian Science Fund (FWF)
• Norm-based reasoning: from legal and moral traditions to AI systems
  2019 – 2020 / Norms
• Reasoning Tools for Deontic Logic and Applications to Indian Sacred Texts
  2017 – 2022 / Vienna Science and Technology Fund (WWTF) / Publications: 141592, 148447, 86062, 86107, 88847
• TICAMORE: Translating and discovering calculi for modal and related logics
  2017 – 2022 / Austrian Science Fund (FWF) / Publications: 106738, 88830
• Syntax meet Semantics: Methods, Interactions, and Connections in Substructural logics
  2016 – 2019 / European Commission
• Formalizing Proof Theory
  2016 – 2017 / Austrian Exchange Service (OeAD)
• Modeling vague quantifiers in mathematical fuzzy logic
  2015 – 2018 / Austrian Science Fund (FWF) / Publication: 880
• Proof-theoretic Analysis of Modal Logics
  2015 – 2017 / European Commission
• Nested Sequents for Interpolation and Realization
  2015 – 2017 / FWF / Publication: 86046
• A Logical Framework for Dialogue Games
  2013 – 2017 / Austrian Science Fund (FWF) / Publication: 86046
• Nonclassical Proofs: Theory, Applications and Tools
  2011 – 2019 / Austrian Science Fund (FWF)

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

2022

• Disambiguating permissions: A contribution from Mīmāṃsā.’ / Dik, J. F. (2022, December 17). Disambiguating permissions: A contribution from Mīmāṃsā.’ [Presentation]. Logic Seminar at the University of Gothenburg, Göteburg, Sweden. / Project: RTD-Indian
• Representing Normative Reasoning in Answer Set Programming Using Weak Constraints / Hatschka, C., Ciabattoni, A., & Eiter, T. (2022, November 28). Representing Normative Reasoning in Answer Set Programming Using Weak Constraints [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria.
• Dyadic Obligations: Proofs and Countermodels via Hypersequents / Ciabattoni, A., Olivetti, N., & Parent, X. (2022). Dyadic Obligations: Proofs and Countermodels via Hypersequents. In PRIMA 2022: Principles and Practice of Multi-Agent Systems.  24th International Conference, Valencia, Spain, November 16–18, 2022, Proceedings (pp. 54–71). Springer. https://doi.org/10.1007/978-3-031-21203-1_4 / Project: Lisa Meitner grant
• Finite model theory for many-valued logics - Some challenges and open problems / Fermüller, C. (2022, November 10). Finite model theory for many-valued logics - Some challenges and open problems [Conference Presentation]. Finite Model Theory and Many-Valued Logic: Challenges and Interactions, Australia.
• Public Announcements for Intuitionistic Epistemic Logic / Pavlova, A. (2022). Public Announcements for Intuitionistic Epistemic Logic. In Proceedings of the 8th Workshop on Formal and Cognitive Reasoning (pp. 29–40). CEUR-WS.org. https://doi.org/10.34726/3507 / Project: SEGACAB
• P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks / Alhazov, A., Freund, R., & Ivanov, S. (2022). P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks. In H. Bordihn, G. Horváth, & G. Vaszil (Eds.), Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022 (pp. 28–48). https://doi.org/10.48550/arXiv.2208.14723
• Prescribed Teams of Rules Working on Several Objects / Alhazov, A., Freund, R., Ivanov, S., & Verlan, S. (2022). Prescribed Teams of Rules Working on Several Objects. In Machines, Computations, and Universality (pp. 27–41). Springer. https://doi.org/10.1007/978-3-031-13502-6_6
• Reasoning With and About Norms in Logical Argumentation / van Berkel, K., & Straßer, C. (2022). Reasoning With and About Norms in Logical Argumentation. In Computational Models of Argument. Proceedings of COMMA 2022 (pp. 332–343). IOS Press. https://doi.org/10.3233/FAIA220164 / Project: RTD-Indian
• Re-visiting Giles's game / Fermüller, C. (2022, August 9). Re-visiting Giles’s game [Conference Presentation]. Reasoning and uncertainty: probabilistic, logical, and psychological perspectives, Regensburg, Germany. / Project: SEGACAB
• Revisiting Brandom’s Incompatibility Semantics / Fermüller, C., & Hafner, J. (2022). Revisiting Brandom’s Incompatibility Semantics. In I. Sedlar (Ed.), The Logica Yearbook 2021 (pp. 77–98). College Publications. / Project: SEGACAB
• New Developments in Dyadic Deontic Logic / Parent, X. (2022, July 16). New Developments in Dyadic Deontic Logic [Conference Presentation]. Automated reasoning with Legal Entities workshop - New Developments in Dyadic Deontic Logic, Luxembourg, International. / Project: Lisa Meitner grant
• From Semantic Games to Analytic Calculi / Fermüller, C. (2022, June 16). From Semantic Games to Analytic Calculi [Conference Presentation]. Czech Gathering of Logicians, Prag, Czechia. / Project: SEGACAB
• Variants of derivation modes for which purely catalytic {P} systemsare computationally complete / Alhazov, A., Freund, R., Ivanov, S., & Oswald, M. (2022). Variants of derivation modes for which purely catalytic {P} systemsare computationally complete. Theoretical Computer Science, 920, 95–112. https://doi.org/10.1016/j.tcs.2022.03.007
• Fuzzy judgment aggregation – background, observations, ideas / Fermüller, C. (2022, June 9). Fuzzy judgment aggregation – background, observations, ideas [Keynote Presentation]. 39th Linz Seminar on Fuzzy Set Theory, Linz, Austria.
• From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic / Fermüller, C., Lang, T. A., & Pavlova, A. (2022). From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic. Logica Universalis, 16(1–2), 221–235. https://doi.org/10.1007/s11787-022-00300-0 / Project: SEGACAB
• Deontic Explanations by means of Formal Argumentation / van Berkel, K. (2022, March 31). Deontic Explanations by means of Formal Argumentation [Conference Presentation]. The ACLC-ILLC Workshop on Argumentation, Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/135855
• Automated Instantiation of Control Flow Tracing Exercises / Eisenhofer, C., & Riener, M. (2022). Automated Instantiation of Control Flow Tracing Exercises. In J. Marcos, W. Neuper, & P. Quaresma (Eds.), Proceedings 10th International Workshop on Theorem Proving Components for Educational Software (pp. 43–58). EPTCS. https://doi.org/10.4204/EPTCS.354.4
• Dyadic deontic logic and the (non-)transitivity of betterness / Parent, X. (2022, January 17). Dyadic deontic logic and the (non-)transitivity of betterness [Conference Presentation]. Meeting Eight Ticamore, Wien, Austria. / Project: TICAMORE
• Enforcing ethical goals over reinforcement-learning policies / Neufeld, E. A., Bartocci, E., Ciabattoni, A., & Governatori, G. (2022). Enforcing ethical goals over reinforcement-learning policies. Ethics and Information Technology, 24(4), Article 43. https://doi.org/10.1007/s10676-022-09665-8 / Project: RTD-Indian
• A Four-year Study of a Placement Exam for an Introductory Programming Course / Podlipnig, S. (2022). A Four-year Study of a Placement Exam for an Introductory Programming Course. In SIGCSE 2022: Proceedings of the 53rd ACM Technical Symposium on Computer Science Education - Volume 1 (pp. 920–926). https://doi.org/10.1145/3478431.3499321
• Probabilistic interpretations of argumentative attacks: Logical and experimental results / Pfeifer, N., & Fermüller, C. G. (2022). Probabilistic interpretations of argumentative attacks: Logical and experimental results. Argument & Computation, 1–33. https://doi.org/10.34726/3521
• Annotated Sequent Calculi for Paraconsistent Reasoning and Their Relations to Logical Argumentation / Arieli, O., van Berkel, K., & Straßer, C. (2022). Annotated Sequent Calculi for Paraconsistent Reasoning and Their Relations to Logical Argumentation. In L. D. Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 2532–2538). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/351
• Prescribed Teams of Rules Working in Parallel on Different Objects / Alhazov, A., Freund, R., Ivanov, S., & Verlan, S. (2022). Prescribed Teams of Rules Working in Parallel on Different Objects. In Theorietag 2022 (pp. 21–24).
• Deontic Paradoxes in Mīmāṃsā Logics: There and Back Again / van Berkel, K., Ciabattoni, A., Freschi, E., Gulisano, F., & Olszewski, M. (2022). Deontic Paradoxes in Mīmāṃsā Logics: There and Back Again. Journal of Logic, Language and Information. https://doi.org/10.1007/s10849-022-09375-w / Project: RTD-Indian
• Tissue P Systems with Vesicles of Multisets / Alhazov, A., Freund, R., Ivanov, S., & Verlan, S. (2022). Tissue P Systems with Vesicles of Multisets. International Journal of Foundations of Computer Science, 33(03n04), 179–202. https://doi.org/10.1142/S0129054122410015
• On Some Weakened Forms of Transitivity in the Logic of Norms / Parent, X. (2022). On Some Weakened Forms of Transitivity in the Logic of Norms. In O. Arieli & G. Casini (Eds.), Non-Monotonic Reasoning 2022 (NMR 2022). Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, Haifa, Israel, August 7-9, 2022 (pp. 147–150). https://doi.org/10.34726/3069 / Project: Lisa Meitner grant
• Taming Bounded Depth with Nested Sequents / Ciabattoni, A., Straßburger, L., & Tesi, M. (2022). Taming Bounded Depth with Nested Sequents. In David Fernández-Duque, A. PALMIGIANO, & S. Pinchinat (Eds.), Advances in Model Logic (pp. 199–217). College Publications. / Project: TICAMORE
• Logic, Language, Information, and Computation / Ciabattoni, A., Pimentel, E., & de Queiroz, R. J. G. B. (Eds.). (2022). Logic, Language, Information, and Computation (Vol. 13468). Springer. https://doi.org/10.1007/978-3-031-15298-6
• On Normative Reinforcement Learning via Safe Reinforcement Learning / Neufeld, E. A., Bartocci, E., & Ciabattoni, A. (2022). On Normative Reinforcement Learning via Safe Reinforcement Learning. In PRIMA 2022: Principles and Practice of Multi-Agent Systems - Proceedings (pp. 72–89). https://doi.org/10.1007/978-3-031-21203-1_5 / Project: RTD-Indian
• Automated Verification of Deontic Correspondences in Isabelle/HOL - First results / Parent, X., & Benzmüller, C. (2022). Automated Verification of Deontic Correspondences in Isabelle/HOL - First results. In Proceedings of Automated Reasoning in Quantified Non-Classical Logics, 4th International Workshop (associated with FLoC and IJCAR 2022). ARQNL22 - Automated Reasoning in Quantified Non-Classical Logics, 4th International Workshop (associated with FLoC and IJCAR 2022), Haifa, Israel. http://hdl.handle.net/20.500.12708/136992 / Project: Lisa Meitner grant
• Regulated Insertion-Deletion Systems / Alhazov, A., Freund, R., Ivanov, S., & Sergey Verlan. (2022). Regulated Insertion-Deletion Systems. Journal of Automata, Languages and Combinatorics, 27(1–3), 15–45. https://doi.org/10.25596/jalc-2022-015
• Dyadic Deontic Logic in HOL: Faithful Embedding and Meta-Theoretical Experiments / Benzmüller, C., Farjami, A., & Parent, X. (2022). Dyadic Deontic Logic in HOL: Faithful Embedding and Meta-Theoretical Experiments. In S. Rahman, M. Armgardt, & H. C. N. Kvernenes (Eds.), New Developments in Legal Reasoning and Logic: From Ancient Law to Modern Legal Systems (Vol. 23, pp. 353–377). https://doi.org/10.1007/978-3-030-70084-3_14 / Project: Lisa Meitner grant
• Review of Automated Vulnerability Analysis of Smart Contracts on Ethereum / Rameder, H., di Angelo, M., & Salzer, G. (2022). Review of Automated Vulnerability Analysis of Smart Contracts on Ethereum. Frontiers in Blockchain, 5. https://doi.org/10.3389/fbloc.2022.814977

2021

• Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete / Alhazov, A., Freund, R., Ivanov, S., & Verlan, S. (2021). Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete. Journal of Membrane Computing, 3(4), 233–245. https://doi.org/10.1007/s41965-021-00085-z
• Identification of token contracts on Ethereum: standard compliance and beyond / Di Angelo, M., & Salzer, G. (2021). Identification of token contracts on Ethereum: standard compliance and beyond. International Journal of Data Science and Analytics. https://doi.org/10.1007/s41060-021-00281-1
• Handbook of Deontic Logic and Normative Systems / Gabbay, D., Horty, J., Parent, X., van der Meyden, R., & van der Torre, L. (Eds.). (2021). Handbook of Deontic Logic and Normative Systems. College Publications, 2021.
• Logic for exact real arithmetic / Wiesnet, F., & Schwichtenberg, H. (2021). Logic for exact real arithmetic. Logical Methods in Computer Science, 17(2), 7:1-7:27. https://doi.org/10.23638/LMCS-17(2:7)2021
• Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach / Lellmann, B., Gulisano, F., & Ciabattoni, A. (2021). Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach. Artificial Intelligence and Law, 29(3), 351–394. https://doi.org/10.1007/s10506-020-09278-w
• Connecting Sequent Calculi with Lorenzen-Style Dialogue Games / Fermüller, C. (2021). Connecting Sequent Calculi with Lorenzen-Style Dialogue Games. In G. Heinzmann & G. Wolters (Eds.), Paul Lorenzen -- Mathematician and Logician (Vol. 51, pp. 115–141). https://doi.org/10.1007/978-3-030-65824-3_8
• Preface / Freund, R. (2021). Preface. Natural Computing, 20(4), 637–638. https://doi.org/10.1007/s11047-021-09872-0
• From Semantic Games to Provability: The Case of Gödel Logic / Pavlova, A., Lang, T., & Freiman, R. (2021). From Semantic Games to Provability: The Case of Gödel Logic. Studia Logica, 110(2), 429–456. https://doi.org/10.1007/s11225-021-09966-x
• Rates of convergence for asymptotically weakly contractive mappings in normed spaces / Wiesnet, F., & Powell, T. (2021). Rates of convergence for asymptotically weakly contractive mappings in normed spaces. Numerical Functional Analysis and Optimization, 42(15), 1802–1838. https://doi.org/10.1080/01630563.2021.2006696
• Bounded-analytic sequent calculi and embeddings for hypersequent logics. / CIABATTONI, A., LANG, T., & RAMANAYAKE, R. (2021). Bounded-analytic sequent calculi and embeddings for hypersequent logics. Journal of Symbolic Logic, 86(2), 635–668. https://doi.org/10.1017/jsl.2021.42
• P systems with limited number of objects / Freund, R., Ivanov, S., & Alhazov, A. (2021). P systems with limited number of objects. Journal of Membrane Computing, 3(1), 1–9. https://doi.org/10.1007/s41965-020-00068-6
• When catalytic P systems with one catalyst can be computationally complete. / Freund, R., Ivanov, S., & Alhazov, A. (2021). When catalytic P systems with one catalyst can be computationally complete. Journal of Membrane Computing, 3(3), 170–181. https://doi.org/10.1007/s41965-021-00079-x
• Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. / Lellmann, B., Pimentel, E., & Dalmonte, T. (2021). Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. Journal of Logic and Computation, 31(1), 67–111. https://doi.org/10.1093/logcom/exaa072
• An abstract form of the first epsilon theorem / Baaz, M., Leitsch, A., & Lolic, A. (2021). An abstract form of the first epsilon theorem. Journal of Logic and Computation, 30(8), 1447–1468. https://doi.org/10.1093/logcom/exaa044
• Schematic Refutations of Formula Schemata / Leitsch, A., Cerna, D., & Lolic, A. (2021). Schematic Refutations of Formula Schemata. Journal of Automated Reasoning, 65(5), 599–645. https://doi.org/10.1007/s10817-020-09583-8
• A universal algorithm for Krull's theorem / Wiesnet, F. (2021). A universal algorithm for Krull’s theorem. Information and Computation, 287(104761), 104761. https://doi.org/10.1016/j.ic.2021.104761
• Relations between Control Mechanisms for Sequential Grammars / Freund, R., Oswald, M., Alhazov, A., & Ivanov, S. (2021). Relations between Control Mechanisms for Sequential Grammars. Fundamenta Informaticae, 181(2–3), 239–271. https://doi.org/10.3233/fi-2021-2058
• Display to Labeled Proofs and Back Again for Tense Logics / Ciabattoni, A., Lyon, T., & Ramanayake, R. (2021). Display to Labeled Proofs and Back Again for Tense Logics. ACM Transactions on Computational Logic, 22(3), 1–31. https://doi.org/10.1145/3460492
• Dialogue Games for Minimal Logic / Pavlova, A. (2021). Dialogue Games for Minimal Logic. Logic and Logical Philosophy, 1. https://doi.org/10.12775/llp.2020.022
• Proof-theory of agency logics of bringing-it-about / Dalmonte, T. (2021). Proof-theory of agency logics of bringing-it-about. TICAMORE 7th meeting, Wien, International. http://hdl.handle.net/20.500.12708/87272
• Using formal argumentation to clarify structures of legal reasoning / van Berkel, K., & Sartor, G. (2021). Using formal argumentation to clarify structures of legal reasoning. 26th European Conference on South Asian Studies (ECSAS), University of Vienna, virtuel, International. http://hdl.handle.net/20.500.12708/87240
• What is the (potential) role of proof theory for normative reasoning? / van Berkel, K. (2021). What is the (potential) role of proof theory for normative reasoning? TICAMORE 7th meeting, Wien, International. http://hdl.handle.net/20.500.12708/87239
• What is the (potential) role of proof theory for normative reasoning? / van Berkel, K. (2021). What is the (potential) role of proof theory for normative reasoning? AuReLeE kick-off workshop, Automated Reasoning with Legal Entities (AuReLeE), ICR University of Luxembourg (virtual), International. http://hdl.handle.net/20.500.12708/87238
• Normative reasoning in Mīmāṃsā: A deontic logic approach / Ciabattoni, A. (2021). Normative reasoning in Mīmāṃsā: A deontic logic approach. ICLA 2021 9th Indian Conference on Logic and its Applications, online, International. http://hdl.handle.net/20.500.12708/87237
• A case study of proof mining in analysis / Wiesnet, F. (2021). A case study of proof mining in analysis. Doc in Progress, online Seminar, University di Trento, International. http://hdl.handle.net/20.500.12708/87236
• An algorithmic version of Zariski's lemma / Wiesnet, F. (2021). An algorithmic version of Zariski’s lemma. Computability in Europe 2021: Connecting with Computability, Online Seminar, Gent, Belgien, International. http://hdl.handle.net/20.500.12708/87235
• Public Announcement for Intuitionistic Epistemic Logic / Pavlova, A. (2021). Public Announcement for Intuitionistic Epistemic Logic. The Twelfth Smirnov Readings in Logic (24-26 June 2021, Moscow, online), Moskau, Non-EU. http://hdl.handle.net/20.500.12708/87234
• Game Approach to Logical Validity: A Case of Mezhirov's Provability Game / Pavlova, A. (2021). Game Approach to Logical Validity: A Case of Mezhirov’s Provability Game. WiL2021: 5th International Workshop “Women in Logic” Rome, Italy, June 27, 2021, Rom, Online, EU. http://hdl.handle.net/20.500.12708/87233
• Revisting Brandom's Incompatibility Semantics / Fermüller, C. (2021). Revisting Brandom’s Incompatibility Semantics. Logica 2021, Hejnice, Czech Republic, EU. http://hdl.handle.net/20.500.12708/87232
• Membrane Computing / Freund, R., Tseren-Onolt, I., Rozenberg, G., Salomaa, A., & ZANDRON, C. (Eds.). (2021). Membrane Computing. Springer International Publishing. https://doi.org/10.1007/978-3-030-77102-7
• MCP: Capturing Big Data by Satisfiability (Tool Description) / Hermann, M., & Salzer, G. (2021). MCP: Capturing Big Data by Satisfiability (Tool Description). In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 207–215). Springer LNCS. https://doi.org/10.1007/978-3-030-80223-3_14
• Provability Games for Non-classical Logics / Pavlova, A. (2021). Provability Games for Non-classical Logics. In P. A. Silva (Ed.), Logic, Language, Information, and Computation (pp. 408–425). https://doi.org/10.1007/978-3-030-88853-4_25
• Terminating Calculi and Countermodels for Constructive Modal Logics / Dalmonte, T. (2021). Terminating Calculi and Countermodels for Constructive Modal Logics. In Lecture Notes in Computer Science (pp. 391–408). https://doi.org/10.1007/978-3-030-86059-2_23
• Games for Hybrid Logic / Freiman, R. (2021). Games for Hybrid Logic. In P. A. Silva (Ed.), Logic, Language, Information, and Computation (pp. 133–149). https://doi.org/10.1007/978-3-030-88853-4_9
• An Algorithmic Version of Zariski’s Lemma / Wiesnet, F. (2021). An Algorithmic Version of Zariski’s Lemma. In Lecture Notes in Computer Science (pp. 469–482). Springer International Publishing. https://doi.org/10.1007/978-3-030-80049-9_46
• A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic / Gore, R. (2021). A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic. In Lecture Notes in Computer Science (pp. 281–298). https://doi.org/10.1007/978-3-030-86059-2_17
• Input/Output Logic With a Consistency Check-the Case of Permission / Olszewski, M., & Parent, X. (2021). Input/Output Logic With a Consistency Check-the Case of Permission. In Proceedings of DEON2020/21 (pp. 358–375). http://hdl.handle.net/20.500.12708/58512
• A Reduction in Violation Logic / Lang, T. (2021). A Reduction in Violation Logic. In Proceedings of DEON2020/21 (pp. 291–307). http://hdl.handle.net/20.500.12708/58511
• If You Want to Smoke, Don't Buy Cigarettes: Near Anankastics, Contexts, and Hyper Modality / van Berkel, K., & Gabbay, D. M. (2021). If You Want to Smoke, Don’t Buy Cigarettes: Near Anankastics, Contexts, and Hyper Modality. In Proceedings of DEON2020/21 (pp. 36–55). http://hdl.handle.net/20.500.12708/58510
• Empirical Evaluation of MakerDAO's Resilience / Kjäer, M., Di Angelo, M., & Salzer, G. (2021). Empirical Evaluation of MakerDAO’s Resilience. In Proc. Conference on Blockchain Research & Applications for Innovative Networks and Services (p. 8). http://hdl.handle.net/20.500.12708/58467
• A Normative Supervisor for Reinforcement Learning Agents / Neufeld, E., Bartocci, E., Ciabattoni, A., & Governatori, G. (2021). A Normative Supervisor for Reinforcement Learning Agents. In Automated Deduction – CADE 28 (pp. 565–576). https://doi.org/10.1007/978-3-030-79876-5_32
• Towards the Identification of Security Tokens on Ethereum / Di Angelo, M., & Salzer, G. (2021). Towards the Identification of Security Tokens on Ethereum. In 3rd International Workshop on Blockchains and Smart Contracts (BSC 2020-2021) (p. 5). http://hdl.handle.net/20.500.12708/58178
• The Power of Parallelism in Membrane Computing / Freund, R. (2021). The Power of Parallelism in Membrane Computing. In Proceedings of the 21st Conference Information Technologies - Applications and Theory {(ITAT} (pp. 1–16). http://hdl.handle.net/20.500.12708/55634
• A Kelsenian Deontic Logic / Ciabattoni, A., & Parent, X. (2021). A Kelsenian Deontic Logic. In Frontiers in Artificial Intelligence and Applications. Jurix 2021, 34th International Conference on Legal Knowledge and Information Systems, Vilnius, Litauen, International. https://doi.org/10.3233/faia210330
• Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq / Gore, R., & Ramanayake, R. (2021). Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq. In Lecture Notes in Computer Science (pp. 299–313). https://doi.org/10.1007/978-3-030-86059-2_18
• CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SAT / Gore, R. (2021). CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SAT. In Lecture Notes in Computer Science (pp. 74–91). https://doi.org/10.1007/978-3-030-86059-2_5
• The Gentle Murder Paradox in Sanskrit Philosophy / Ciabattoni, A., van Berkel, K., Freschi, E., Gulisano, F., & Olszewski, M. (2021). The Gentle Murder Paradox in Sanskrit Philosophy. In Proceedings of DEON2020/21 (pp. 17–35). http://hdl.handle.net/20.500.12708/55623
• Proof Systems for the Logics of Bringing-It-About. / Dalmonte, T., & Olivetti, N. (2021). Proof Systems for the Logics of Bringing-It-About. In Deontic logic and normative systems. Proceedings of 15th international conference DEON 2020/21 (pp. 114–132). http://hdl.handle.net/20.500.12708/55622
• The Varieties of Ought-Implies-Can and Deontic STIT Logic / van Berkel, K., & Lyon, T. (2021). The Varieties of Ought-Implies-Can and Deontic STIT Logic. In Proceedings of DEON2020/21 (pp. 55–76). http://hdl.handle.net/20.500.12708/55616
• Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms / Ciabattoni, A., & Lellmann, B. (2021). Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. In Proceedings of DEON2020/21 (pp. 94–113). College Publications. http://hdl.handle.net/20.500.12708/55610

2020

• Par means parallel: multiplicative linear logic proofs as concurrent functional programs" / Aschieri, F., & Genco, F. A. (2020). Par means parallel: multiplicative linear logic proofs as concurrent functional programs". Proceedings of the ACM on Programming Languages, 4(POPL). https://doi.org/10.1145/3371086
• P systems with randomized right-hand sides of rules / Freund, R., & Alhazov, A. (2020). P systems with randomized right-hand sides of rules. Theoretical Computer Science, 805, 144–160. https://doi.org/10.1016/j.tcs.2018.07.016
• Time-freeness and clock-freeness and related concepts in {P} systems / Freund, R., & Alhazov, A. (2020). Time-freeness and clock-freeness and related concepts in {P} systems. Theoretical Computer Science, 805, 127–143. https://doi.org/10.1016/j.tcs.2018.09.009
• On the concurrent computational content of intermediate logics / Aschieri, F., Ciabattoni, A., & Genco, F. A. (2020). On the concurrent computational content of intermediate logics. Theoretical Computer Science, 813, 375–409. https://doi.org/10.1016/j.tcs.2020.01.022
• How derivation modes and halting conditions may influence the computational power of P systems / Freund, R. (2020). How derivation modes and halting conditions may influence the computational power of P systems. Journal of Membrane Computing, 2(1), 14–25. https://doi.org/10.1007/s41965-019-00028-9
• Schematic Refutations of Formula Schemata / Cerna, D. M., Leitsch, A., & Lolic, A. (2020). Schematic Refutations of Formula Schemata. Journal of Automated Reasoning, 65(5), 599–645. https://doi.org/10.1007/s10817-020-09583-8
• On fuzzification mechanisms for unary quantification / Baldi, P., Fermüller, C. G., & Hofer, M. F. J. (2020). On fuzzification mechanisms for unary quantification. Fuzzy Sets and Systems, 388, 90–123. https://doi.org/10.1016/j.fss.2019.12.009
• A realistic view on normative conflicts / Pascucci, M., & Glavanicova, D. (2020). A realistic view on normative conflicts. Logic and Logical Philosophy, 1. https://doi.org/10.12775/llp.2020.001
• Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms / Lellmann, B., & Ciabattoni, A. (2020). Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. In DEOn 2020/2021 (pp. 1–18). College Publications. http://hdl.handle.net/20.500.12708/58273
• Assessing the Similarity of Smart Contracts by Clustering their Interfaces / di Angelo, M., & Salzer, G. (2020). Assessing the Similarity of Smart Contracts by Clustering their Interfaces. In 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Guangzhou, China, Non-EU. IEEE. https://doi.org/10.1109/trustcom50675.2020.00261
• From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic / Fermüller, C., Lang, T., & Pavlova, A. (2020). From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic. In Information Processing and Management of Uncertainty in Knowledge-Based Systems (pp. 257–270). Springer. https://doi.org/10.1007/978-3-030-50146-4_20
• A typed parallel lambda-calculus via 1-depth intermediate proofs / Aschieri, F., Ciabattoni, A., & Genco, F. A. (2020). A typed parallel lambda-calculus via 1-depth intermediate proofs. In L. Kovacs (Ed.), EPiC Series in Computing. EasyChair EPiC Series in Computing. https://doi.org/10.29007/g15z
• The Good, The Bad and The Ugly: Pitfalls and Best Practices in Automated Sound Static Analysis of Ethereum Smart Contracts / Schneidewind, C., Scherer, M., & Maffei, M. (2020). The Good, The Bad and The Ugly: Pitfalls and Best Practices in Automated Sound Static Analysis of Ethereum Smart Contracts. In Lecture Notes in Computer Science (pp. 212–231). Springer. https://doi.org/10.1007/978-3-030-61467-6_14
• eThor: Practical and Provably Sound Static Analysis of Ethereum Smart Contracts / Schneidewind, C., Grishchenko, I., Scherer, M., & Maffei, M. (2020). eThor: Practical and Provably Sound Static Analysis of Ethereum Smart Contracts. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. ACM Conference on Computer and Communications Security (CCS), Washington, USA, Non-EU. Association for Computing Machinery ACM. https://doi.org/10.1145/3372297.3417250
• Characteristics of Wallet Contracts on Ethereum / di Angelo, M., & Salzer, G. (2020). Characteristics of Wallet Contracts on Ethereum. In 2020 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS). 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services, Paris, EU. IEEE. https://doi.org/10.1109/brains49436.2020.9223287
• Wallet Contracts on Ethereum / Di Angelo, M., & Salzer, G. (2020). Wallet Contracts on Ethereum. In International Conference on Blockchain and Cryptocurrency (pp. 1–2). IEEE. http://hdl.handle.net/20.500.12708/58164
• Functional Differences of Neo and Ethereum as Smart Contract Platforms / Bareis, M., di Angelo, M., & Salzer, G. (2020). Functional Differences of Neo and Ethereum as Smart Contract Platforms. In J. Prieto (Ed.), Advances in Intelligent Systems and Computing (pp. 13–23). Springer. https://doi.org/10.1007/978-3-030-52535-4_2
• Characterizing Types of Smart Contracts in the Ethereum Landscape / di Angelo, M., & Salzer, G. (2020). Characterizing Types of Smart Contracts in the Ethereum Landscape. In Financial Cryptography and Data Security (pp. 389–404). Springer. https://doi.org/10.1007/978-3-030-54455-3_28
• Tokens, Types, and Standards: Identification and Utilization in Ethereum / di Angelo, M., & Salzer, G. (2020). Tokens, Types, and Standards: Identification and Utilization in Ethereum. In 2020 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS). International Conference on Decentralized Applications and Infrastructures (IEEE DAPPS 2020), Oxford, UK, Non-EU. IEEE. https://doi.org/10.1109/dapps49028.2020.00001
• SoK: Development of Secure Smart Contracts – Lessons from a Graduate Course / di Angelo, M., Sack, C., & Salzer, G. (2020). SoK: Development of Secure Smart Contracts – Lessons from a Graduate Course. In Financial Cryptography and Data Security (pp. 91–105). Springer. https://doi.org/10.1007/978-3-030-43725-1_8
• Interpreting Propositional Fuzzy Logics via Imperfect Information Games / Fermüller, C., & Majer, O. (2020). Interpreting Propositional Fuzzy Logics via Imperfect Information Games. In 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL). 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL), Miyazaki, Non-EU. IEEE Computer Society. https://doi.org/10.1109/ismvl49045.2020.00006

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
• 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
• Extraction of Expansion Trees / Lolic, A., & Leitsch, A. (2019). Extraction of Expansion Trees. Journal of Automated Reasoning, 62(3), 393–430. https://doi.org/10.1007/s10817-018-9453-9
• Duty and sacrifice. A logical analysis of the Mīmāṃsā theory of Vedic injunctions / Pascucci, M., & Freschi, E. (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
• 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, 23(7), 2255–2270. https://doi.org/10.1007/s00500-018-3513-2
• Preface / Pascucci, M. (2019). Preface. Organon F, 26(3). https://doi.org/10.31577/orgf.2019.26301
• Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors / Freund, R., & 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
• 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
• 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
• 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
• 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, EU. 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, EU. 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, EU. 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, EU. http://hdl.handle.net/20.500.12708/86971
• 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
• Reversibility and Determinism in P Systems / Freund, R. (2019). Reversibility and Determinism in P Systems. Reversibility in Programming, Languages, and Automata (RPLA), Porto, EU. 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, EU. http://hdl.handle.net/20.500.12708/86965
• 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
• "Defining Responsibility / Pascucci, M., & Glavanicova, D. (2019). "Defining Responsibility. Current Trends in Deontic Logic II, Bratislava, EU. 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, EU. http://hdl.handle.net/20.500.12708/86933
• 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, EU. 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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, Non-EU. ACM. https://doi.org/10.1145/3327959.3329537
• 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, EU. IEEE. https://doi.org/10.1109/ntms.2019.8763828
• 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
• 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, Zypern, EU. ACM. https://doi.org/10.1145/3297280.3297321
• 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, Non-EU. IEEE. https://doi.org/10.1109/dappcon.2019.00018
• 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
• 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
• 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
• 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

• A counterexample to the reconstruction of omega-categorical structures from their endomorphism monoids / Bodirsky, M., Evans, D., Kopatscher, M., & Pinsker, M. (2018). A counterexample to the reconstruction of omega-categorical structures from their endomorphism monoids. Israel Journal of Mathematics, 224(1), 57–82. https://doi.org/10.1007/s11856-018-1645-9
• Extraction of Expansion Trees / Lolic, A., & Leitsch, A. (2018). Extraction of Expansion Trees. Journal of Automated Reasoning, 62(3), 393–430. https://doi.org/10.1007/s10817-018-9453-9
• Hypersequents and Systems of Rules: Embeddings and Applications. / Ciabattoni, A., & Genco, F. A. (2018). Hypersequents and Systems of Rules: Embeddings and Applications. ACM Transactions on Computational Logic, 19(2), 1–27. https://doi.org/10.1145/3180075
• Multicomponent Proof-theoretic Method for Proving Interpolation Property / Kuznets, R. (2018). Multicomponent Proof-theoretic Method for Proving Interpolation Property. Annals of Pure and Applied Logic, 169(12), 1369–1418. https://doi.org/10.1016/j.apal.2018.08.007
• From Display to Labelled Calculi for Tense Logics / Lyon, T., Ramanayake, R., & Ciabattoni, A. (2018). From Display to Labelled Calculi for Tense Logics. In Logical Foundations of Computer Science (pp. 120–139). https://doi.org/10.1007/978-3-319-72056-2_8
• Automated Reasoning in Normative Detachment Structures with Ideal Conditions / Pascucci, M., & Libal, T. (2018). Automated Reasoning in Normative Detachment Structures with Ideal Conditions. arXiv. https://doi.org/10.48550/arXiv.1810.09993
• Disjunctive Axioms and Concurrent lambda-Calculi: a Curry-Howard Approach / Aschieri, F., Ciabattoni, A., & Genco, F. (2018). Disjunctive Axioms and Concurrent lambda-Calculi: a Curry-Howard Approach. CoRR - Computing Research Repository. http://hdl.handle.net/20.500.12708/154516
• Review of "Fuzzy Logic and Mathematics: A Historical Perspective" / Fermüller, C. (2018). Review of “Fuzzy Logic and Mathematics: A Historical Perspective.” Notre Dame Philosophical Reviews, (ONLINE). http://hdl.handle.net/20.500.12708/144564
• Deontic Reasoning: From Ancient Texts to Artificial Intelligence. Workshop report / Ciabattoni, A., Lellmann, B., & van Berkel, K. (2018). Deontic Reasoning: From Ancient Texts to Artificial Intelligence. Workshop report. ACM SIGLOG News, 5(4), 48–51. https://doi.org/10.1145/3292048.3292054
• Substructural logics: semantics, proof theory, and applications. Report on the second SYSMICS workshop / Ciabattoni, A., Genco, F. A., & Ramanayake, R. (2018). Substructural logics: semantics, proof theory, and applications. Report on the second SYSMICS workshop. ACM SIGLOG News, 5(2), 58–60. https://doi.org/10.1145/3212019.3212027
• Logic-Based Concurrent Calculi / Aschieri, F., Ciabattoni, A., & Genco, F. (2018). Logic-Based Concurrent Calculi. Substructural logics: semantics, proof theory, and applications, SYSMICS 2018, Wien, Austria. http://hdl.handle.net/20.500.12708/122706
• Activation and Blocking of Rules / Freund, R., Alhazov, A., & Ivanov, S. (2018). Activation and Blocking of Rules. The 5th Annual Rogozhin Lectures on Foundations of Informatics and Unconventional Computing Systems, Chisinau, Moldavien, Non-EU. http://hdl.handle.net/20.500.12708/86822
• Automated reasoning in normative detachment structures with ideal conditions / Pascucci, M. (2018). Automated reasoning in normative detachment structures with ideal conditions. Cyberspace 2018, Brno, EU. http://hdl.handle.net/20.500.12708/86805
• Cohesiveness in canonical models / Pascucci, M. (2018). Cohesiveness in canonical models. Colloquium Logicum 2018, Bayreuth, EU. http://hdl.handle.net/20.500.12708/86804
• Cut-free Calculi and Relational Semantics for temporal STIT logics / van Berkel, K. (2018). Cut-free Calculi and Relational Semantics for temporal STIT logics. FISP Workshop (3rd FISP Meeting), Vienna, Austria. http://hdl.handle.net/20.500.12708/86803
• Nesting multi-conclusions: the Maehara conundrum / Kuznets, R. (2018). Nesting multi-conclusions: the Maehara conundrum. FISP Workshop (3rd FISP Meeting), Vienna, Austria. http://hdl.handle.net/20.500.12708/86798
• Substructural Calculi and Games of Information Extraction / Fermüller, C. (2018). Substructural Calculi and Games of Information Extraction. Forschungsseminar Informatik, Uni Bamberg, Bamberg, EU. http://hdl.handle.net/20.500.12708/86796
• A cost conscious game model for intutionistic linear logic with subexponentials / Fermüller, C. (2018). A cost conscious game model for intutionistic linear logic with subexponentials. FISP Workshop (3rd FISP Meeting), Vienna, Austria. http://hdl.handle.net/20.500.12708/86795
• Automated Deduction in Classical and Nonclassical Logic: A bird's eyes view with hints on bounded reasoning / Fermüller, C. (2018). Automated Deduction in Classical and Nonclassical Logic: A bird’s eyes view with hints on bounded reasoning. Models of Bounded Reasoning in Individuals and Groups, Leiden, Netherlands, EU. http://hdl.handle.net/20.500.12708/86794
• Exploring Argumentation Based Semantics for Relevance Logic / Fermüller, C. (2018). Exploring Argumentation Based Semantics for Relevance Logic. AsubL (Algebra & Substructural Logics- Take 6), Cagliari, Italy, EU. http://hdl.handle.net/20.500.12708/86793
• From Lorenzen's dialogue game to game semantics for substructural logics / Fermüller, C. (2018). From Lorenzen’s dialogue game to game semantics for substructural logics. Paul Lorenzen: Mathematician and Logician, Konstanz, EU. http://hdl.handle.net/20.500.12708/86792
• Games and analytic proof systems / Fermüller, C. (2018). Games and analytic proof systems. PhDs in Logic X, Prague, EU. http://hdl.handle.net/20.500.12708/86791
• Interpretpreting Substructural Logics by Games of Information Extraction / Fermüller, C., & Lang, T. (2018). Interpretpreting Substructural Logics by Games of Information Extraction. Games for Logic and Programming Languages XIII, Thessaloniki, Greece, EU. http://hdl.handle.net/20.500.12708/86790
• On the Expressivity of the Propositional Fragment of Independence Friendly Logic / Majer, O., & Fermüller, C. (2018). On the Expressivity of the Propositional Fragment of Independence Friendly Logic. Games for Logic and Programming Languages XIII, Thessaloniki, Greece, EU. http://hdl.handle.net/20.500.12708/86789
• On Herbrand constructive Logics III: Intuitionistic logic of constant domains / Aschieri, F. (2018). On Herbrand constructive Logics III: Intuitionistic logic of constant domains. Classical Logic and Computation" (CL&C 2018), Oxford, EU. http://hdl.handle.net/20.500.12708/86732
• Natural Deduction and Normalization Proofs for the Intersection Type Discipline / Aschieri, F. (2018). Natural Deduction and Normalization Proofs for the Intersection Type Discipline. “Intersection Types and Related Systems” (ITRS 2018), Oxford, EU. http://hdl.handle.net/20.500.12708/86733
• Analytic Calculi for substructural logics: Theory and applications / Ciabattoni, A. (2018). Analytic Calculi for substructural logics: Theory and applications. Logic Colloquium 2018, Udine, EU. http://hdl.handle.net/20.500.12708/86718
• Deontic Reasoning: From Ancient Texts to Artificial Intelligence / Ciabattoni, A. (2018). Deontic Reasoning: From Ancient Texts to Artificial Intelligence. TICAMORE Meeting/Workshop 3, Nancy, EU. http://hdl.handle.net/20.500.12708/86706
• Intermediate logics: from hypersequents to parallel computation / Ciabattoni, A. (2018). Intermediate logics: from hypersequents to parallel computation. British Colloquium for Theoretical Computer Science 2018, London, EU. http://hdl.handle.net/20.500.12708/86696
• From semi-abstract argumentation to logical consequence / Corsi, E. A., & Fermüller, C. (2018). From semi-abstract argumentation to logical consequence. In S. Oswald & D. Mailat (Eds.), Argumentation and Inference, Proceedings of the 2 nd European Conference on Argumentation (pp. 151–164). College Publications. http://hdl.handle.net/20.500.12708/57667
• Input-Driven Tissue P Automata / Freund, R., Oswald, M., & Alhazov, A. (2018). Input-Driven Tissue P Automata. In G. Paun (Ed.), Sixteenth Brainstorming Week on Membrane Computing (pp. 39–58). Fénix Editora. http://hdl.handle.net/20.500.12708/57661
• One-Membrane P Systems with Activation and Blocking of Rules. / Freund, R., Alhazov, A., & Ivanov, S. (2018). One-Membrane P Systems with Activation and Blocking of Rules. In G. Paun (Ed.), Sixteenth Brainstorming Week on Membrane Computing (pp. 23–38). Fénix Editora. http://hdl.handle.net/20.500.12708/57660
• Introducing the Concept of Activation and Blocking of Rules in the General Framework for Regulated Rewriting in Sequential Grammars. / Freund, R., Alhazov, A., & Ivanov, S. (2018). Introducing the Concept of Activation and Blocking of Rules in the General Framework for Regulated Rewriting in Sequential Grammars. In G. Paun (Ed.), Sixteenth Brainstorming Week on Membrane Computing (pp. 1–22). Fénix Editora. http://hdl.handle.net/20.500.12708/57659
• Unfair P Systems / Freund, R., Alhazov, A., & Ivanov, S. (2018). Unfair P Systems. In Proceedings of the Workshop on Membrane Computing at UCNC 2018. Fontainebleau, France June 25th, 2018 (pp. 63–71). TU Wien. http://hdl.handle.net/20.500.12708/57658
• Hierarchical P systems with randomized right-hand sides of rules. / Freund, R., & Alhazov, A. (2018). Hierarchical P systems with randomized right-hand sides of rules. In M. Gheorghe (Ed.), Membrane Computing: 18th International Conference, CMC 2017, Bradford, UK, July 25-28, 2017, Revised Selected Papers (pp. 15–39). Springer International Publishing. http://hdl.handle.net/20.500.12708/57656
• Notions of Instrumentality in Agency Logic / van Berkel, K., & Pascucci, M. (2018). Notions of Instrumentality in Agency Logic. In T. M. Miller (Ed.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-030-03098-8
• On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains / Aschieri, F. (2018). On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains. In S. Berardi (Ed.), Proceedings Seventh International Workshop on Classical Logic and Computation, Oxford (UK), 7th of July 2018. Open Publishing Association. https://doi.org/10.4204/eptcs
• Control Mechanisms for Array Grammars on Cayley Grids / Freund, R. (2018). Control Mechanisms for Array Grammars on Cayley Grids. In S. Verlan (Ed.), Machines, Computations, and Universality (pp. 1–33). Springer. http://hdl.handle.net/20.500.12708/55493
• Classical Proofs as Parallel Programs / Aschieri, F., Genco, F., & Ciabattoni, A. (2018). Classical Proofs as Parallel Programs. In Electronic Proceedings in Theoretical Computer Science (pp. 43–57). https://doi.org/10.4204/eptcs.277.4
• Resolving Conflicting Obligations in Mīmāṃsā: A Sequent-based Approach / Ciabattoni, A., Gulisano, F., & Lellmann, B. (2018). Resolving Conflicting Obligations in Mīmāṃsā: A Sequent-based Approach. In J. Broersen, C. Condoravdi, S. Nair, & G. Pigozzi (Eds.), Deontic Logic and Normative Systems DEON 2018 (pp. 91–110). College Publications. http://hdl.handle.net/20.500.12708/57498
• Tissue P Systems with Point Mutation Rules / Freund, R. (2018). Tissue P Systems with Point Mutation Rules. In Proceedings of the 19th International Conference on Membrane Computing (pp. 29–50). Friedrich Schiller University Jena. http://hdl.handle.net/20.500.12708/57419
• P Systems with Activation and Blocking of Rules / Freund, R. (2018). P Systems with Activation and Blocking of Rules. In S. Verlan (Ed.), Unconventional Computation and Natural Computation (pp. 1–15). LNCS/Springer. http://hdl.handle.net/20.500.12708/57417
• Sequential Grammars with Activation and Blocking of Rules / Freund, R. (2018). Sequential Grammars with Activation and Blocking of Rules. In S. Verlan (Ed.), Machines, Computations, and Universality (pp. 51–68). Springer. http://hdl.handle.net/20.500.12708/57416
• Unfair P Systems / Freund, R., Alhazov, A., & Ivanov, S. (2018). Unfair P Systems. In K. Reinhardt (Ed.), Theorietage 2018, Wittenberg, Technical Report 18-1, Universität Halle-Wittenberg (pp. 87–90). Universität Halle-Wittenberg. http://hdl.handle.net/20.500.12708/57095
• Probabilistic interpretations of argumentative attacks: logical and experimental foundations / Pfeifer, N., & Fermüller, C. (2018). Probabilistic interpretations of argumentative attacks: logical and experimental foundations. In V. Kratochvil & J. Vejnarova (Eds.), Proceedings of the 11th Workshop on Uncertainty Processing (WUPES´18) Trebon, Czech Republic (pp. 141–152). MatfyzPress, Publishing House of the Faculty of Mathematics and Physics Charles University. http://hdl.handle.net/20.500.12708/56714
• A Granularity Approach to Vague Quantification / Fermüller, C. (2018). A Granularity Approach to Vague Quantification. In V.-N. Hunyh (Ed.), IUKM 2018. International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making (pp. 3–14). International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making. http://hdl.handle.net/20.500.12708/56708
• A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem / Leitsch, A., Baaz, M., & Lolic, A. (2018). A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem. In Logical Foundations of Computer Science (pp. 55–71). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-72056-2_4
• Small Universal Reversible Counter Machines / Freund, R., Alhazov, A., & Verlan, S. (2018). Small Universal Reversible Counter Machines. In A. Adamatzky (Ed.), Emergence, Complexity and Computation (pp. 433–446). Springer International Publishing. http://hdl.handle.net/20.500.12708/29939
• Chocolate P Automata / Freund, R., Oswald, M., & Alhazov, A. (2018). Chocolate P Automata. In G. Paun (Ed.), Enjoying Natural Computing (pp. 1–20). Springer International Publishing. https://doi.org/10.1007/978-3-030-00265-7_1
• On Semantic Games for Łukasiewicz Logic / Fermüller, C., & Majer, O. (2018). On Semantic Games for Łukasiewicz Logic. In H. van Ditmarsch & G. Sandu (Eds.), Jaakko Hintikka on Knowledge and Game-Theoretical Semantics (pp. 263–278). Springer. http://hdl.handle.net/20.500.12708/29877
• Proceedings of the Workshop on Membrane Computing at UCNC 2018. / Freund, R., & Ivanov, S. (Eds.). (2018). Proceedings of the Workshop on Membrane Computing at UCNC 2018. TU Wien. http://hdl.handle.net/20.500.12708/24536
• Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, (NCMA) / Freund, R. (Ed.). (2018). Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, (NCMA). OCG (Österreichische Computer Gesellschaft). http://hdl.handle.net/20.500.12708/24454

2017

• Reconstructing the topology of clones / Pinsker, M. (2017). Reconstructing the topology of clones. Transactions of the American Mathematical Society, 369(5), 3707–3740. https://doi.org/10.1090/tran/6937
• From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction / Lellmann, B., & Ciabattoni, A. (2017). From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction. Electronic Notes in Theoretical Computer Science, 332, 75–93. https://doi.org/10.1016/j.entcs.2017.04.006
• PREFACE OF A SPECIAL ISSUE OF THE J. of LOGIC AND COMPUTATION / Ciabattoni, A., Baaz, M., & Gabbay, D. M. (2017). PREFACE OF A SPECIAL ISSUE OF THE J. of LOGIC AND COMPUTATION. Journal of Logic and Computation, 27(2), 415–415. https://doi.org/10.1093/logcom/exu076
• Anderson's restriction of deontic modalities to contingent propositions / Pascucci, M. (2017). Anderson’s restriction of deontic modalities to contingent propositions. Theoria, 83(4), 440–470. http://hdl.handle.net/20.500.12708/147312
• Contextual array grammars with matrix control, regular control languages, and tissue P systems control / Freund, R., Alhazov, A., & Ivanov, S. (2017). Contextual array grammars with matrix control, regular control languages, and tissue P systems control. Theoretical Computer Science, 682, 5–21. https://doi.org/10.1016/j.tcs.2017.03.012
• {CERES} for first-order schemata / Leitsch, A., & Weller, D. (2017). {CERES} for first-order schemata. Journal of Logic and Computation. https://doi.org/10.1093/logcom/exx003
• The problem of Pi_2-cut-introduction / Leitsch, A., & Lettmann, M. (2017). The problem of Pi_2-cut-introduction. Theoretical Computer Science, 706, 83–116. https://doi.org/10.1016/j.tcs.2017.10.003
• Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors / Freund, R., & Fernau, H. (2017). Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. Fundamenta Informaticae, 155(1–2), 209–232. http://hdl.handle.net/20.500.12708/147176
• Watson-Crick {T0L} Systems and Red-Green Register Machines / Freund, R. (2017). Watson-Crick {T0L} Systems and Red-Green Register Machines. Fundamenta Informaticae, 155(1–2), 111–129. http://hdl.handle.net/20.500.12708/147175
• Ceres in intuitionistic logic / Leitsch, A., Cerna, D., & Reis, G. (2017). Ceres in intuitionistic logic. Annals of Pure and Applied Logic, 168(10), 1783–1836. https://doi.org/10.1016/j.apal.2017.04.001
• Algebraic proof theory: Hypersequents and hypercompletions / Ciabattoni, A., & Galatos, N. (2017). Algebraic proof theory: Hypersequents and hypercompletions. Annals of Pure and Applied Logic, 168(3), 693–737. https://doi.org/10.1016/j.apal.2016.10.012
• Ninth Workshop on Non-Classical Models of Automata and Applications, {NCMA} 2017, Prague, Czech Republic / Freund, R. (Ed.). (2017). Ninth Workshop on Non-Classical Models of Automata and Applications, {NCMA} 2017, Prague, Czech Republic. Österreichische Computer Gesellschaft. http://hdl.handle.net/20.500.12708/176089
• Understanding prescriptive texts: rules and logic elaborated by Mīmāṃsā school / Ciabattoni, A., Genco, F., & Freschi, E. (2017). Understanding prescriptive texts: rules and logic elaborated by Mīmāṃsā school. Online Journal of World Philosophies, 2(1), 19. http://hdl.handle.net/20.500.12708/146793
• Expansion Trees from Non-Normalized Proofs with CERES / Lolic, A., & Leitsch, A. (2017). Expansion Trees from Non-Normalized Proofs with CERES. Collegium Logicum Proof Theory: Herbrand’s Theorem Revisited, Wien, Austria. http://hdl.handle.net/20.500.12708/122275
• Discussion on Quantifier Fuzzyfication Mechanisms. / Baldi, P., & Hofer, M. (2017). Discussion on Quantifier Fuzzyfication Mechanisms. Workshop on Fuzzy Quantifiers and related topics MOVAQ 2017, Wien, Austria. http://hdl.handle.net/20.500.12708/86675
• Double-shrinking pseudo-Siggers / Pinsker, M. (2017). Double-shrinking pseudo-Siggers. LIAFA, Paris, EU. http://hdl.handle.net/20.500.12708/86658
• Equations in algebras from omega-categorical structures / Pinsker, M. (2017). Equations in algebras from omega-categorical structures. Seminar an der TU Wien, Wien, 06/2017, Austria. http://hdl.handle.net/20.500.12708/86659
• The two dichotomy conjectures for in nite domain CSPs are equivalent / Pinsker, M. (2017). The two dichotomy conjectures for in nite domain CSPs are equivalent. 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, Reykjavik, EU. http://hdl.handle.net/20.500.12708/86657
• Proof-Theory for Non-Classical Logics: Sequent calculi and beyond / Ciabattoni, A. (2017). Proof-Theory for Non-Classical Logics: Sequent calculi and beyond. International Summer School for Proof Theory, Funchal, EU. http://hdl.handle.net/20.500.12708/86646
• Goedel Logic: from Hypersequents to Parallel Computation / Ciabattoni, A. (2017). Goedel Logic: from Hypersequents to Parallel Computation. ISRALOG 2017, Haifa, Israel, Non-EU. http://hdl.handle.net/20.500.12708/86644
• From hypersequents to parallel computation for intermediate logics / Ciabattoni, A. (2017). From hypersequents to parallel computation for intermediate logics. Workshop TICAMORE, Marseille, EU. http://hdl.handle.net/20.500.12708/86645
• Logic-based process calculi: Gödel logic and beyond / Ciabattoni, A. (2017). Logic-based process calculi: Gödel logic and beyond. Workshop Open Problems in Concurrency Theory II, Klosterneuburg, Austria. http://hdl.handle.net/20.500.12708/86643
• How to Reach Heaven: Different career paths / Ciabattoni, A. (2017). How to Reach Heaven: Different career paths. 2nd Logic Mentoring Workshop, Reykjavik, EU. http://hdl.handle.net/20.500.12708/86642
• From hypersequent calculi to parallel computation / Ciabattoni, A. (2017). From hypersequent calculi to parallel computation. International Workshop on Proofs, Paris, EU. http://hdl.handle.net/20.500.12708/86641
• Modalities between a logical and an empirical account of indeterminism / Pascucci, M. (2017). Modalities between a logical and an empirical account of indeterminism. Modal Metaphysics V, Bratislava, EU. http://hdl.handle.net/20.500.12708/86631
• Natural deduction for modal logic with propositional quantifiers / Pascucci, M. (2017). Natural deduction for modal logic with propositional quantifiers. ECAP (European Congress for Analytic Philosophy) 9, München, EU. http://hdl.handle.net/20.500.12708/86630
• Temporal irreflexivity in terms of a propositional constant / Pascucci, M. (2017). Temporal irreflexivity in terms of a propositional constant. XXVI AILA (Italian Association for Logic and its Applications) Meeting, Padova, EU. http://hdl.handle.net/20.500.12708/86629
• Equations in oligomorphic algebras / Pinsker, M. (2017). Equations in oligomorphic algebras. AAA 93, Bern, Non-EU. http://hdl.handle.net/20.500.12708/86604
• Cores of omega-categorical structures / Kompatscher, M. (2017). Cores of omega-categorical structures. Algebra Seminar TU Wien, Wien, Austria. http://hdl.handle.net/20.500.12708/86596
• Completing edge-labelled graphs to metric spaces / Kompatscher, M. (2017). Completing edge-labelled graphs to metric spaces. Seminar der Arbeitsgruppe Diskrete Mathematik, Wien, Austria. http://hdl.handle.net/20.500.12708/86595
• Linearization of certain non-trivial equations in oligomorphic clones / Kompatscher, M. (2017). Linearization of certain non-trivial equations in oligomorphic clones. AAA94+NSAC2017, Novi Sad, Non-EU. http://hdl.handle.net/20.500.12708/86594
• Oligomorphic clones / Kompatscher, M., & Pinsker, M. (2017). Oligomorphic clones. Tianfu Universal Algebra workshop, South West University of Finance and Economics, Chengdu, China, Non-EU. http://hdl.handle.net/20.500.12708/86593
• Herbrand's Phenomena in Justification Logic / Kuznets, R. (2017). Herbrand’s Phenomena in Justification Logic. Collegium Logicum 2017, Proof Theory: Herbrand’s Theorem Revisited, Wien, Austria. http://hdl.handle.net/20.500.12708/86566
• Connecting Argumentation, Incompatibility Semantics, Nmatrices, and Relevance Logics / Fermüller, C. (2017). Connecting Argumentation, Incompatibility Semantics, Nmatrices, and Relevance Logics. ISRALOG 2017, Haifa, Israel, Non-EU. http://hdl.handle.net/20.500.12708/86560
• Connecting fuzzy logic and argumentation frames via logical attack principles / Fermüller, C. (2017). Connecting fuzzy logic and argumentation frames via logical attack principles. ManyVal 2017, Toulouse, Frankreich, EU. http://hdl.handle.net/20.500.12708/86559
• A logical perspective on argumentation / Fermüller, C. (2017). A logical perspective on argumentation. Metaphor and Argumentation, Cagliari, Italy, EU. http://hdl.handle.net/20.500.12708/86535
• Through an Inference Rule, Darkly / Kuznets, R. (2017). Through an Inference Rule, Darkly. Humboldt Kolleg “​Proof Theory as Mathesis Universalis,” Menaggio, Italien, EU. http://hdl.handle.net/20.500.12708/86512
• A new proof of the existence of cores of omega-categorical structures / Kompatscher, M. (2017). A new proof of the existence of cores of omega-categorical structures. AAA93, Bern, Non-EU. http://hdl.handle.net/20.500.12708/86488
• Efficient Proof Systems for Modal Logics / Kuznets, R., & Strassburger, L. (2017). Efficient Proof Systems for Modal Logics. 29th European Summer School in Logic, Language, and Information (ESSLLI 2017), Toulouse, Frankreich, EU. http://hdl.handle.net/20.500.12708/86479
• Modal Calculi from Semantics: a Case Study / Kuznets, R. (2017). Modal Calculi from Semantics: a Case Study. Workshop Translating and Discovering Calculi for Modal and Related Logics 2017, Wien, Austria. http://hdl.handle.net/20.500.12708/86100
• Justification logic for constructive modal logic / Kuznets, R., Marin, S., & Straßburger, L. (2017). Justification logic for constructive modal logic (No. 01614707). http://hdl.handle.net/20.500.12708/39304
• Completing graphs to metric spaces / Kompatscher, M. (2017). Completing graphs to metric spaces. In Electronic Notes in Discrete Mathematics (pp. 53–60). Elsevier Science Publishers. https://doi.org/10.1016/j.endm.2017.06.020
• The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems / Kompatscher, M., & Pinsker, M. (2017). The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press. https://doi.org/10.1109/lics.2017.8005128
• (Tissue) P Systems with Vesicles of Multisets / Freund, R. (2017). (Tissue) P Systems with Vesicles of Multisets. In Electronic Proceedings in Theoretical Computer Science (pp. 11–25). corr. https://doi.org/10.4204/eptcs.252.6
• Interpreting Sequent Calculi as Client-Server Games / Fermüller, C. G., & Lang, T. (2017). Interpreting Sequent Calculi as Client-Server Games. In R. Schmidt (Ed.), Lecture Notes in Computer Science (pp. 98–113). Springer. https://doi.org/10.1007/978-3-319-66902-1_6
• From Semi-fuzzy to Fuzzy Quantifiers via Lukasiewicz Logic and Games / Baldi, P., & Fermüller, C. (2017). From Semi-fuzzy to Fuzzy Quantifiers via Lukasiewicz Logic and Games. In Proceedings of: EUSFLAT-2017 (pp. 112–124). http://hdl.handle.net/20.500.12708/57214
• Standard Completeness for extensions of IMTL / Baldi, P., & Ciabattoni, A. (2017). Standard Completeness for extensions of IMTL. In G. Acampora (Ed.), Proceedings of : 2017 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2017, (p. 1). IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/57207
• Time-freeness and Clock-freeness and Related Concepts in P Systems. / Freund, R., & Alhazov, A. (2017). Time-freeness and Clock-freeness and Related Concepts in P Systems. In G. Paun (Ed.), Proceedings of BWMC 2017: 15th Brainstorming Week on Membrane Computing (2017), Sevilla (pp. 43–70). Fénix Editora. http://hdl.handle.net/20.500.12708/57184
• P Systems with Randomized Right-hand Sides of Rules / Freund, R., Alhazov, A., & Ivanov, S. (2017). P Systems with Randomized Right-hand Sides of Rules. In G. Paun (Ed.), Proceedings of BWMC 2017: 15th Brainstorming Week on Membrane Computing (2017), Sevilla (pp. 13–42). Fénix Editora. http://hdl.handle.net/20.500.12708/57183
• P Systems with Random RHS Exchange / Freund, R. (2017). P Systems with Random RHS Exchange. In Conference on Mathematical Foundations of Informatics, 2017, Chişinău: Proceedings MFOI, 2017 (pp. 27–30). Acad. of Sciences of Moldova. http://hdl.handle.net/20.500.12708/57102
• P Systems and the Concept of Fairness / Freund, R., Alhazov, A., & Ivanov, S. (2017). P Systems and the Concept of Fairness. In Conference on Mathematical Foundations of Informatics, 2017, Chişinău: Proceedings MFOI, 2017 (pp. 11–26). Acad. of Sciences of Moldova. http://hdl.handle.net/20.500.12708/57101
• Transitional P Systems with Randomized Rule Right-hand Sides. / Freund, R., Alhazov, A., & Ivanov, S. (2017). Transitional P Systems with Randomized Rule Right-hand Sides. In M. Gheorghe (Ed.), Preproceedings of the 18th Conference on Membrane Computing, CMC18, Bradford (pp. 23–47). IMCS. http://hdl.handle.net/20.500.12708/57083
• P Systems Working in Maximal Variants of the Set Derivation Mode / Freund, R., Alhazov, A., & Verlan, S. (2017). P Systems Working in Maximal Variants of the Set Derivation Mode. In G. Rozenberg (Ed.), International Conference on Membrane Computing 2016 (pp. 83–102). Springer LNCS. http://hdl.handle.net/20.500.12708/57081
• Purely Catalytic P Systems over Integers and Their Generative Power / Freund, R., Alhazov, A., & Ivanov, S. (2017). Purely Catalytic P Systems over Integers and Their Generative Power. In G. Rozenberg (Ed.), International Conference on Membrane Computing 2016 (pp. 67–82). Springer LNCS. http://hdl.handle.net/20.500.12708/57080
• Simulating R Systems by P Systems / Freund, R., Ivanov, S., & Alhazov, A. (2017). Simulating R Systems by P Systems. In International Conference on Membrane Computing 2016 (pp. 51–66). Springer LNCS. http://hdl.handle.net/20.500.12708/57079
• Bunched Hypersequent Calculi for Distributive Substructural Logics / Ramanayake, R., & Ciabattoni, A. (2017). Bunched Hypersequent Calculi for Distributive Substructural Logics. In T. Eiter (Ed.), LNCS 7180, 21st International Proceedings of 21st Int. Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 417–434). Springer LNCS. http://hdl.handle.net/20.500.12708/57070
• Logical Argumentation Principles, Sequents, and Nondeterministic Matrices / Corsi, E. A., & Fermüller, C. G. (2017). Logical Argumentation Principles, Sequents, and Nondeterministic Matrices. In A. Baltag (Ed.), Logic, Rationality, and Interaction (pp. 422–437). Springer. https://doi.org/10.1007/978-3-662-55665-8_29
• Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors / Freund, R. (2017). Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. In Descriptional Complexity of Formal Systems - 19th {IFIP} {WG} 1.02 International Conference, {DCFS} 2017, Milano, Italy, July 3-5, 2017, Proceedings} (pp. 140–151). Springer. http://hdl.handle.net/20.500.12708/56982
• Sequential Polarized Tissue P Systems with Vesicles of Multisets / Freund, R., Alhazov, A., & Verlan, S. (2017). Sequential Polarized Tissue P Systems with Vesicles of Multisets. In Conference on Mathematical Foundations of Informatics, 2017, Chişinău: Proceedings MFOI, 2017 (pp. 7–10). Acad. of Sciences of Moldova. http://hdl.handle.net/20.500.12708/57185
• Unfair P Systems / Freund, R., Alhazov, A., & Ivanov, S. (2017). Unfair P Systems. In G. Paun (Ed.), Proceedings of BWMC 2017: 15th Brainstorming Week on Membrane Computing (2017), Sevilla (pp. 1–12). Fénix Editora. http://hdl.handle.net/20.500.12708/57182
• Gödel Logic: From Natural Deduction to Parallel Computation / Ciabattoni, A., & Genco, F. (2017). Gödel Logic: From Natural Deduction to Parallel Computation. In Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland (pp. 1–12). http://hdl.handle.net/20.500.12708/56981
• A complexity dichotomy for poset constraint satisfaction / Kompatscher, M., & Van Pham, T. (2017). A complexity dichotomy for poset constraint satisfaction. In Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (pp. 1–12). http://hdl.handle.net/20.500.12708/56757

2016

• System Description: GAPT 2.0 / Ebner, G., Hetzl, S., Reis, G., Riener, M., Wolfsteiner, S. P., & Zivota, S. (2016). System Description: GAPT 2.0. In Automated Reasoning (pp. 293–301). Springer. https://doi.org/10.1007/978-3-319-40229-1_20 / Project: ASCP
• Proof theory of witnessed Gödel logic: A negative result / Baaz, M., & Ciabattoni, A. (2016). Proof theory of witnessed Gödel logic: A negative result. Journal of Logic and Computation, 26(1), 51–64. https://doi.org/10.1093/logcom/ext018
• Preface / Freund, R. (2016). Preface. Fundamenta Informaticae, 148(3–4). http://hdl.handle.net/20.500.12708/149938
• Natural dualities through product representations: bilattices and beyond / Cabrer, L. (2016). Natural dualities through product representations: bilattices and beyond. Studia Logica, 104(3), 567–592. https://doi.org/10.1007/s11225-016-9651-6
• Classifying $\mathsf{GL}(n,\mathbb Z)$-orbits of points and rational subspaces. / Cabrer, L. (2016). Classifying $\mathsf{GL}(n,\mathbb Z)$-orbits of points and rational subspaces. Discrete and Continuous Dynamical Systems - Series A, 36, 4723–4738. http://hdl.handle.net/20.500.12708/149915
• MV-algebras, infinite dimensional polyhedra, and natural dualities / Cabrer, L. (2016). MV-algebras, infinite dimensional polyhedra, and natural dualities. Archive for Mathematical Logic, 56(1–2), 21–42. https://doi.org/10.1007/s00153-016-0512-9
• Idempotent Endomorphisms of free MV-algebras and unital $\ell$-groups / Cabrer, L. (2016). Idempotent Endomorphisms of free MV-algebras and unital $\ell$-groups. Journal of Pure and Applied Algebra, 221(4), 908–934. https://doi.org/10.1016/j.jpaa.2016.08.011
• Distance constraint satisfaction problems / Pinsker, M. (2016). Distance constraint satisfaction problems. Information and Computation, 247, 87–105. https://doi.org/10.1016/j.ic.2015.11.010
• The Reducts of the Homogeneous Binary Branching C-relation / Van Pham, T. (2016). The Reducts of the Homogeneous Binary Branching C-relation. Journal of Symbolic Logic, 81(4), 1255–1297. https://doi.org/10.1017/jsl.2016.37
• Chip-firing game and a partial Tutte polynomial for Eulerian digraphs / Van Pham, T. (2016). Chip-firing game and a partial Tutte polynomial for Eulerian digraphs. Electronic Journal of Combinatorics, 23(1). http://hdl.handle.net/20.500.12708/149500
• Power and Limits of Structural Display Rules / Ramanayake, R., & Ciabattoni, A. (2016). Power and Limits of Structural Display Rules. ACM Transactions on Computational Logic, 17(3), 1–39. https://doi.org/10.1145/2874775
• Going Beyond Turing with {P} Automata: Regular Observer {\(\omega\)}-Languages and Partial Adult Halting / Freund, R., Staiger, L., & Ivanov, S. (2016). Going Beyond Turing with {P} Automata: Regular Observer {\(\omega\)}-Languages and Partial Adult Halting. International Journal of Unconventional Computing, 12(1), 51–69. http://hdl.handle.net/20.500.12708/148979
• On matrices, Nmatrices and games / Fermüller, C. G. (2016). On matrices, Nmatrices and games. Journal of Logic and Computation, 26(1), 189–211. https://doi.org/10.1093/logcom/ext024
• Representing strategic games and their equilibria in many-valued logics / Běhounek, L., Cintula, P., Fermüller, C., & Kroupa, T. (2016). Representing strategic games and their equilibria in many-valued logics. Logic Journal of the IGPL, 24(3), 238–267. https://doi.org/10.1093/jigpal/jzw004
• Semantic Games with Backtracking for T-norm Based Fuzzy Logics / Fermüller, C. (2016). Semantic Games with Backtracking for T-norm Based Fuzzy Logics. Journal of Multiple-Valued Logic and Soft Computing, 26(1–2), 157–173. http://hdl.handle.net/20.500.12708/148622
• Proof search and Co-NP completeness for many-valued logics / Ciabattoni, A., & Montagna, F. (2016). Proof search and Co-NP completeness for many-valued logics. Fuzzy Sets and Systems, 292, 130–149. https://doi.org/10.1016/j.fss.2015.02.016
• Weak Arithmetical Interpretations for the Logic of Proofs / Kuznets, R., & Studer, T. (2016). Weak Arithmetical Interpretations for the Logic of Proofs. Logic Journal of the IGPL, 24(3), 424–440. https://doi.org/10.1093/jigpal/jzw002
• Grafting Hypersequents onto Nested Sequents / Kuznets, R., & Lellmann, B. (2016). Grafting Hypersequents onto Nested Sequents. Logic Journal of the IGPL, 24(3), 375–423. https://doi.org/10.1093/jigpal/jzw005
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors / Freund, R., & Alhazov, A. (2016). Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors. Natural Computing, 15(1), 51–68. https://doi.org/10.1007/s11047-015-9534-1
• Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016) / Freund, R., & Bordihn, H. (Eds.). (2016). Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). OCG (Österreichische Computer Gesellschaft). http://hdl.handle.net/20.500.12708/176086
• Polymorphic P Systems / Freund, R. (2016). Polymorphic P Systems. Bulletin of the International Membrane Computing Society, 12(2), 79–101. http://hdl.handle.net/20.500.12708/158093
• Schematic Cut elimination and the Ordered Pigeonhole Principle / Leitsch, A., & Cerna, D. (2016). Schematic Cut elimination and the Ordered Pigeonhole Principle. CoRR - Computing Research Repository. http://hdl.handle.net/20.500.12708/148950
• Constraint satisfaction problems for reducts of homogeneous graphs / Pinsker, M. (2016). Constraint satisfaction problems for reducts of homogeneous graphs. arXiv. https://doi.org/10.48550/arXiv.1602.05819
• Interpolation Method for Multicomponent Sequent Calculi / Kuznets, R. (2016). Interpolation Method for Multicomponent Sequent Calculi. In S. Artemov & A. Nerode (Eds.), Logical Foundations of Computer Science. International Symposium, LFCS 2016 (pp. 202–218). LNCS/Springer. https://doi.org/10.1007/978-3-319-27683-0_15
• How I stopped worrying about formulas and learned to interpolate / Kuznets, R. (2016). How I stopped worrying about formulas and learned to interpolate. Logic and Theory Group, Institute of Computer Science, University of Bern, Bern, Schweiz, Non-EU. http://hdl.handle.net/20.500.12708/86511
• Models of Grammars Inspired by Marcus Contextual Grammars / Freund, R. (2016). Models of Grammars Inspired by Marcus Contextual Grammars. DCFS 2016, Bucharest, EU. http://hdl.handle.net/20.500.12708/86478
• Computations on a Moebius Rope / Freund, R. (2016). Computations on a Moebius Rope. 17th International Conference on Membrane Computing (CMC17), Mailand, EU. http://hdl.handle.net/20.500.12708/86477
• Variants of Energy-Controlled P Systems" Autoren / Freund, R. (2016). Variants of Energy-Controlled P Systems" Autoren. Workshop “Unconventional Computing Systems” in commemoration of Yuri Rogozhin, Chisinau, Non-EU. http://hdl.handle.net/20.500.12708/86473
• Interpolation beyond sequent calculi: modal, intuitionistic, and intermediate logics / Kuznets, R. (2016). Interpolation beyond sequent calculi: modal, intuitionistic, and intermediate logics. FISP: The Fine Structure of Formal Proof Systems and their Computational Interpretations at the University of Innsbruck, Innsbruck, Austria. http://hdl.handle.net/20.500.12708/86412
• An introduction to Ramsey theory / Kompatscher, M. (2016). An introduction to Ramsey theory. Fall school des Algebra department der Karls-Universität Prag, Prag, EU. http://hdl.handle.net/20.500.12708/86402
• Complexity classification for the binary branching semilinear-order constraint satisfaction problems / Van Pham, T. (2016). Complexity classification for the binary branching semilinear-order constraint satisfaction problems. Arbeitstagung Allgemeine Algebra 92, Prag, EU. http://hdl.handle.net/20.500.12708/86382
• Syntactic Interpolation: Limits and Challenges / Kuznets, R. (2016). Syntactic Interpolation: Limits and Challenges. Workshop “Proof Theory and Modal Logic,” Turin, Italien, EU. http://hdl.handle.net/20.500.12708/86347
• Craig and Lyndon Interpolation Via Labelled Sequent Calculi / Kuznets, R. (2016). Craig and Lyndon Interpolation Via Labelled Sequent Calculi. Modalities, Conditionals, and Values, Symposium on Philosophical Logic in Celebration of the Centenary of Georg Henrik von Wright at the University of Helsinki, Helsinki, Finnland, EU. http://hdl.handle.net/20.500.12708/86348
• Variants of Energy-Controlled P Systems / Freund, R. (2016). Variants of Energy-Controlled P Systems. NIT 2016, Valencia, EU. http://hdl.handle.net/20.500.12708/86325
• Red-Green P Automata / Freund, R. (2016). Red-Green P Automata. 26.Theorietag Automata und Formale Sprachen, Tannenfelde, EU. http://hdl.handle.net/20.500.12708/86319
• Hypersequents and Systems of Rules: An Embedding / Ciabattoni, A., & Genco, F. (2016). Hypersequents and Systems of Rules: An Embedding. Syntax Meets Semantics 2016, Barcelona, EU. http://hdl.handle.net/20.500.12708/86317
• Interpreting Sequent Calculi as Client-Server Games / Fermüller, C. (2016). Interpreting Sequent Calculi as Client-Server Games. Syntax Meets Semantics 2016, Barcelona, EU. http://hdl.handle.net/20.500.12708/86315
• Syntax Meets Semantcs to Prove Interpolation / Kuznets, R. (2016). Syntax Meets Semantcs to Prove Interpolation. Syntax Meets Semantics 2016, Barcelona, EU. http://hdl.handle.net/20.500.12708/86316
• CERES in intuitionistic logic completeness / Leitsch, A. (2016). CERES in intuitionistic logic completeness. Magica 16, Mailand, EU. http://hdl.handle.net/20.500.12708/86314
• Giles' Game - Recent Developments and Challenges / Fermüller, C. (2016). Giles’ Game - Recent Developments and Challenges. Magica 16, Mailand, EU. http://hdl.handle.net/20.500.12708/86313
• Constraint satisfaction problems over the random poset / Kompatscher, M. (2016). Constraint satisfaction problems over the random poset. Logic Colloquium 2016, Leeds. GB, EU. http://hdl.handle.net/20.500.12708/86311
• CSPs over the random partial order / Kompatscher, M. (2016). CSPs over the random partial order. AAA92 (92. Allgemeine Arbeitstagung Algebra), Prag, EU. http://hdl.handle.net/20.500.12708/86312
• Logical Consequence and Belief Change Arising From Semi-Abstract Argumentation / Fermüller, C. (2016). Logical Consequence and Belief Change Arising From Semi-Abstract Argumentation. Workshop on New Trends in Belief Change, Vienna, Austria. http://hdl.handle.net/20.500.12708/86298
• The future of MFL: pure math or seriously interdisciplinary? / Fermüller, C. (2016). The future of MFL: pure math or seriously interdisciplinary? The Future of Mathematical Fuzzy Logic, Prague, EU. http://hdl.handle.net/20.500.12708/86297
• Systematic proof theory for substructural logics and applications / Ciabattoni, A. (2016). Systematic proof theory for substructural logics and applications. Mathematics for Computation, Niederaltaich, EU. http://hdl.handle.net/20.500.12708/86280
• A complexity dichotomy for Poset-SAT / Kompatscher, M. (2016). A complexity dichotomy for Poset-SAT. Algebra Seminar, Wien, Austria. http://hdl.handle.net/20.500.12708/86279
• 2^omega many maximal-closed subgroups of Sym(omega) / Kompatscher, M. (2016). 2^omega many maximal-closed subgroups of Sym(omega). New Pathways between Group Theory and Model Theory, Mülheim an der Ruhr, EU. http://hdl.handle.net/20.500.12708/86268
• The Next Whisky Bar / Salzer, G., & Hermann, M. (2016). The Next Whisky Bar. In Computer Science – Theory and Applications (pp. 41–56). Springer. https://doi.org/10.1007/978-3-319-34171-2_4
• Contextual Array Grammars with Matrix and Regular Control / Freund, R., & Fernau, H. (2016). Contextual Array Grammars with Matrix and Regular Control. In Descriptional Complexity of Formal Systems (pp. 98–110). https://doi.org/10.1007/978-3-319-41114-9_8
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems / Pinsker, M. (2016). The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM Press. https://doi.org/10.1145/2933575.2934544
• Simulating R Systems by P Systems / Freund, R. (2016). Simulating R Systems by P Systems. In Proceedings of 17th International Conference on Membrane Computing (CMC17) (pp. 13–26). http://hdl.handle.net/20.500.12708/56911
• Maximal Variants of the Set Derivation Mode / Freund, R. (2016). Maximal Variants of the Set Derivation Mode. In Proceedings of 17th International Conference on Membrane Computing (CMC17) (pp. 57–72). http://hdl.handle.net/20.500.12708/56910
• Semilinear Sets, Register Machines, and Integer Vector Addition (P) Systems / Freund, R. (2016). Semilinear Sets, Register Machines, and Integer Vector Addition (P) Systems. In Proceedings of 17th International Conference on Membrane Computing (CMC17) (pp. 39–56). http://hdl.handle.net/20.500.12708/56909
• Extended Spiking Neural P Systems with States / Freund, R., Alhazov, A., & Ivanov, S. (2016). Extended Spiking Neural P Systems with States. In Unconventional Computation and Natural Computation (pp. 42–54). LNCS/Springer. http://hdl.handle.net/20.500.12708/56907
• P Systems Working in Set Modes / Freund, R. (2016). P Systems Working in Set Modes. In Unconventional Computation and Natural Computation 15th International Conference, UCNC 2016, Manchester, UK, July 11-15, 2016, Proceedings (pp. 4–15). LNCS/Springer. http://hdl.handle.net/20.500.12708/56906
• Embedding formalisms: hypersequents and two-level systems of rules / Ciabattoni, A., & Genco, F. (2016). Embedding formalisms: hypersequents and two-level systems of rules. In Advances in Modal Logic (AIML 2016) (pp. 197–216). http://hdl.handle.net/20.500.12708/56823
• Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi / Kuznets, R. (2016). Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi. In L. Michael & A. C. Kakas (Eds.), Logics in Artificial Intelligence (pp. 320–335). Springer LNCS. https://doi.org/10.1007/978-3-319-48758-8_21
• Analytic Calculi for Non-Classical Logics: Theory and Applications / Ciabattoni, A. (2016). Analytic Calculi for Non-Classical Logics: Theory and Applications. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, Marseille, EU. http://hdl.handle.net/20.500.12708/56799
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs / Pinsker, M. (2016). Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. In Proceedings of 43rd International Colloquium on Automata, Languages, and Programming, ICALP (pp. 1–14). Springer. https://doi.org/10.4230/LIPIcs.ICALP.2016.119
• P Automata: New ideas and results / Freund, R. (2016). P Automata: New ideas and results. In Proceedings of Eighth Workshop on Non-Classical Models of Automata and Applications (pp. 13–40). Austrian Computer Society. http://hdl.handle.net/20.500.12708/56740
• Purely Catalytic P Systems over Integers and Their Generative Power / Freund, R. (2016). Purely Catalytic P Systems over Integers and Their Generative Power. In Proceccings of 17th International Conference on Membrane Computing (CMC17) (pp. 27–38). http://hdl.handle.net/20.500.12708/56908
• Schematic Cut Elimination and the Ordered Pigeonhole Principle / Leitsch, A., & Cerna, D. (2016). Schematic Cut Elimination and the Ordered Pigeonhole Principle. In N. Olivetti (Ed.), Automated Reasoning - 8th International Joint Conference, {IJCAR} 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings (pp. 241–256). http://hdl.handle.net/20.500.12708/56560
• As Close as It Gets / Salzer, G., Behrisch, M., & Hermann, M. (2016). As Close as It Gets. In M. Kaykobad (Ed.), {WALCOM:} Algorithms and Computation - 10th International Workshop, {WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings (pp. 222–235). http://hdl.handle.net/20.500.12708/56476
• Łukasiewicz Public Announcement Logic / Cabrer, L. (2016). Łukasiewicz Public Announcement Logic. In Information Processing and Management of Uncertainty in Knowledge-Based Systems (pp. 108–122). https://doi.org/10.1007/978-3-319-40581-0_10
• Craig Interpolation via Hypersequents / Kuznets, R. (2016). Craig Interpolation via Hypersequents. In D. Probst & P. Schuster (Eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science (pp. 193–214). Walter de Gruyter GmbH. https://doi.org/10.1515/9781501502620-012

2015

• The 42 reducts of the random ordered graph / Pinsker, M. (2015). The 42 reducts of the random ordered graph. LMS J. Comput.Math., 111(3), 591–632. http://hdl.handle.net/20.500.12708/151434
• Topological Birkhoff / Pinsker, M. (2015). Topological Birkhoff. Transactions of the American Mathematical Society, 367, 2527–2549. http://hdl.handle.net/20.500.12708/151435
• Schaefer's Theorem for Graphs / Pinsker, M. (2015). Schaefer’s Theorem for Graphs. Journal of the ACM, 62(3), 1–52. https://doi.org/10.1145/2764899
• Permutations on the Random Permutation / Pinsker, M. (2015). Permutations on the Random Permutation. Electronic Journal of Combinatorics, 22(2). https://doi.org/10.37236/4910
• Exact unification and admissibility. / Cabrer, L., & Metcalfe, G. (2015). Exact unification and admissibility. Logical Methods in Computer Science, 11(3). https://doi.org/10.2168/lmcs-11(3:23)2015
• Admissibility via natural dualities. / Cabrer, L., & Metcalfe, G. (2015). Admissibility via natural dualities. Journal of Pure and Applied Algebra, 219(9), 4229–4253. https://doi.org/10.1016/j.jpaa.2015.02.015
• Severi-Bouligand tangents, Frenet frames, Riesz spaces / Cabrer, L. M., & Mundici, D. (2015). Severi-Bouligand tangents, Frenet frames, Riesz spaces. Advances in Applied Mathematics, 64, 1–20. https://doi.org/10.1016/j.aam.2014.11.004
• Product representation for default bilattices: an application of natural duality theory / Cabrer, L. (2015). Product representation for default bilattices: an application of natural duality theory. Journal of Pure and Applied Algebra, 219(7), 2962–2988. https://doi.org/10.1016/j.jpaa.2014.09.034
• Classifying orbits of the affine group over the integers / Cabrer, L. (2015). Classifying orbits of the affine group over the integers. Ergodic Theory and Dynamical Systems, 37(2), 440–453. https://doi.org/10.1017/etds.2015.45
• A general framework for product representations: bilattices and beyond / Cabrer, L. (2015). A general framework for product representations: bilattices and beyond. Logic Journal of the IGPL, 23(5), 816–841. https://doi.org/10.1093/jigpal/jzv030
• Uniform proofs of standard completeness for extensions of first-order MTL / Baldi, P., & Ciabattoni, A. (2015). Uniform proofs of standard completeness for extensions of first-order MTL. Theoretical Computer Science, 603, 43–57. https://doi.org/10.1016/j.tcs.2015.07.014
• Proof Search and Co-NP Completeness for Many-Valued Logics / Ciabattoni, A., & Montagna, F. (2015). Proof Search and Co-NP Completeness for Many-Valued Logics. Fuzzy Sets and Systems, 292, 130–149. https://doi.org/10.1016/j.fss.2015.02.016
• The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems / Freund, R., & Fernau, H. (2015). The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. International Journal of Foundations of Computer Science, 26(08), 1167–1188. https://doi.org/10.1142/s0129054115400171
• Contextual array grammars and array {P} systems / Freund, R., & Fernau, H. (2015). Contextual array grammars and array {P} systems. Annals of Mathematics and Artificial Intelligence, 75(1–2), 5–26. https://doi.org/10.1007/s10472-013-9388-0
• Catalytic and Purely Catalytic {P} Systems and {P} Automata: Control Mechanisms for Obtaining Computational Completeness / Freund, R., Oswald, M., & Paun, G. (2015). Catalytic and Purely Catalytic {P} Systems and {P} Automata: Control Mechanisms for Obtaining Computational Completeness. Fundamenta Informaticae, 136(1–2), 59–84. http://hdl.handle.net/20.500.12708/151740
• Variants of Small Universal {P} Systems with Catalysts / Freund, R., & Alhazov, A. (2015). Variants of Small Universal {P} Systems with Catalysts. Fundamenta Informaticae, 138(1–2), 227–250. http://hdl.handle.net/20.500.12708/151741
• Permutations on the Random Permutation / Pinsker, M. (2015). Permutations on the Random Permutation. Electronic Journal of Combinatorics, 22(2). https://doi.org/10.37236/4910
• Modal Interpolation via Nested Sequents / Kuznets, R., & Fitting, M. (2015). Modal Interpolation via Nested Sequents. Annals of Pure and Applied Logic, 166(3), 274–305. https://doi.org/10.1016/j.apal.2014.11.002
• Seventh Workshop on Non-Classical Models of Automata and Applications / Freund, R. (Ed.). (2015). Seventh Workshop on Non-Classical Models of Automata and Applications. OCG (Österreichische Computer Gesellschaft). http://hdl.handle.net/20.500.12708/176081
• Analysis of Clause set Schema Aided by Automated Theorem Proving: {A} Case Study [Extended Paper] / Leitsch, A., & Cerna, D. (2015). Analysis of Clause set Schema Aided by Automated Theorem Proving: {A} Case Study [Extended Paper]. arXiv. https://doi.org/10.48550/arXiv.1503.08551
• Minimal Distance of Propositional Models / Salzer, G., Behrisch, M., & Hermann, M. (2015). Minimal Distance of Propositional Models. arXiv. https://doi.org/10.48550/arXiv.1502.06761
• Interpolation Method for Multicomponent Sequent Calculi / Kuznets, R. (2015). Interpolation Method for Multicomponent Sequent Calculi. Seminar “Logic and Theoretical Computer Science”, Universität Bern, Bern, Schweiz, Non-EU. http://hdl.handle.net/20.500.12708/86346
• Computational Completeness and Universality in Membrane Computing / Freund, R. (2015). Computational Completeness and Universality in Membrane Computing. CMC’16 Membrane Computing, Valencia, EU. http://hdl.handle.net/20.500.12708/86218
• Going Beyond Turing with Watson-Crick T0L Systems / Freund, R. (2015). Going Beyond Turing with Watson-Crick T0L Systems. UCNC 2015, Auckland, Non-EU. http://hdl.handle.net/20.500.12708/86219
• New Results for Small Universal P Systems Based on the Simulation of Generalized Register Machines and Generalized Counter Automata / Freund, R., & Alhazov, A. (2015). New Results for Small Universal P Systems Based on the Simulation of Generalized Register Machines and Generalized Counter Automata. CMC’16 Membrane Computing, Valencia, EU. http://hdl.handle.net/20.500.12708/86217
• The Set-Maximally Parallel Derivation Mode / Freund, R., & Verlan, S. (2015). The Set-Maximally Parallel Derivation Mode. CMC’16 Membrane Computing, Valencia, EU. http://hdl.handle.net/20.500.12708/86216
• P Systems with Multiple Catalysts of the Same Name / Freund, R., & Ivanov, S. (2015). P Systems with Multiple Catalysts of the Same Name. CMC’16 Membrane Computing, Valencia, EU. http://hdl.handle.net/20.500.12708/86215
• Uniform Birkhoff / Pinsker, M. (2015). Uniform Birkhoff. Technische Universität Dresden, Dresden, EU. http://hdl.handle.net/20.500.12708/86187
• Uniform Birkhoff / Pinsker, M. (2015). Uniform Birkhoff. Workshop Duality in Computer Science, Dagstuhl, EU. http://hdl.handle.net/20.500.12708/86186
• Proof-theoretic Approach to Craig Interpolation / Kuznets, R. (2015). Proof-theoretic Approach to Craig Interpolation. Special Session on Proof Theory at the Logic Colloquium 2015, Helsinki, Finnland, EU. http://hdl.handle.net/20.500.12708/86146
• A counterexample on the reconstruction of oligomorphic clones / Kompatscher, M. (2015). A counterexample on the reconstruction of oligomorphic clones. Workshop on Homogeneous Structures, Banff International Research Station, Banff, Non-EU. http://hdl.handle.net/20.500.12708/86144
• Maximal-closed subgroups of Sym(omega) via Henson digraphs / Kompatscher, M. (2015). Maximal-closed subgroups of Sym(omega) via Henson digraphs. KAFKA Seminar, Prag, Karls Universität, EU. http://hdl.handle.net/20.500.12708/86145
• Reducts of Henson digraphs / Kompatscher, M. (2015). Reducts of Henson digraphs. Wiener Algebra Seminar, Wien, Austria. http://hdl.handle.net/20.500.12708/86143
• Algebraic methods in constraint satisfaction / Kompatscher, M. (2015). Algebraic methods in constraint satisfaction. Workshop Matej-Bel-Universität in Banská Bystrica, Slowakei, Banska Bystrica, EU. http://hdl.handle.net/20.500.12708/86142
• Dichotomy results for constraint satisfaction problems / Kompatscher, M. (2015). Dichotomy results for constraint satisfaction problems. PhDs in Logic VII Konferenz, Wien, Austria. http://hdl.handle.net/20.500.12708/86140
• Endomorphism monoids of omega-categorical structures / Kompatscher, M. (2015). Endomorphism monoids of omega-categorical structures. Topology, Algebra, and Categories in Logic 2015 (TACL 2015), Ischia, EU. http://hdl.handle.net/20.500.12708/86141
• Topological clones / Pinsker, M. (2015). Topological clones. Topology, Algebra, and Categories in Logic 2015 (TACL 2015), Ischia, EU. http://hdl.handle.net/20.500.12708/86139
• Topological clones / Pinsker, M. (2015). Topological clones. EPSRC Durham Symposium Permutation Groups and Transformation Semigroups, Durham, EU. http://hdl.handle.net/20.500.12708/86138
• Proof Search and Co-NP Completeness for Many-Valued Logics / Ciabattoni, A. (2015). Proof Search and Co-NP Completeness for Many-Valued Logics. Konferenz zu Coherence & Truth-In memoriam Franco Montagna, Pontignano, EU. http://hdl.handle.net/20.500.12708/86114
• Algebraic proof theory for substructural logics and applications / Ciabattoni, A. (2015). Algebraic proof theory for substructural logics and applications. Topology, Algebra, and Categories in Logic 2015 (TACL 2015), Ischia, EU. http://hdl.handle.net/20.500.12708/86113
• Proof theory meets semantics: the case of substructural logics / Ciabattoni, A. (2015). Proof theory meets semantics: the case of substructural logics. Boolean Algebras, Lattices, Algebraic & Quantum Logic, Universal Algebra, Set Theory, and Set-theoretic and Point-free Topology (BLAST 2015), Denton, Texas, Non-EU. http://hdl.handle.net/20.500.12708/86112
• (Algebraic) Proof Theory for Substructural Logics / Ciabattoni, A. (2015). (Algebraic) Proof Theory for Substructural Logics. Algebra and Coalgebra meet Proof Theory VI, 2015, Delft, EU. http://hdl.handle.net/20.500.12708/86111
• Conjectures for clones over finitely bounded homogenous structures / Pinsker, M. (2015). Conjectures for clones over finitely bounded homogenous structures. Workshop on Homogeneous Structures, Banff International Research Station, Banff, Non-EU. http://hdl.handle.net/20.500.12708/86102
• Justification Logic / Kuznets, R. (2015). Justification Logic. Eleventh International Tbilisi Summer School in Logic and Language, Tiflis, Georgien, Non-EU. http://hdl.handle.net/20.500.12708/86101
• Grafted Hypersequents / Kuznets, R. (2015). Grafted Hypersequents. Graduate Seminar Logic and Information (Münchenwiler Meeting) of Universities of Bern, Neuchâtel, and Fribourg within the framework of the Swiss Joint Master of Science in Computer Science program, Münchenwiler, Schweiz, Non-EU. http://hdl.handle.net/20.500.12708/86099
• Lorenzen-style Dialogues and Substructural Sequent Systems / Fermüller, C. (2015). Lorenzen-style Dialogues and Substructural Sequent Systems. Workshop on Logica Dialogue Games, Wien, Austria. http://hdl.handle.net/20.500.12708/86098
• Equilibrium Semantics for IF-Logic and Many-Valued Connectives / Fermüller, C. (2015). Equilibrium Semantics for IF-Logic and Many-Valued Connectives. TbiLLC 2015: 11th International Tbilisi Symposium on Language, Logic and Computation, Tiflis, Non-EU. http://hdl.handle.net/20.500.12708/86097
• Connecting Lorenzen style games and Gentzen style calculi / Fermüller, C. (2015). Connecting Lorenzen style games and Gentzen style calculi. CiE 2015 - Evolving Computability, Bucharest, EU. http://hdl.handle.net/20.500.12708/86096
• Game Semantics for Vague Quantifiers / Fermüller, C. (2015). Game Semantics for Vague Quantifiers. Logica 2015, Hejnice, EU. http://hdl.handle.net/20.500.12708/86095
• Hintikka-style semantic games for many-valued logics / Fermüller, C. (2015). Hintikka-style semantic games for many-valued logics. Seminar of Logic Group at University of Milano, Mailand, EU. http://hdl.handle.net/20.500.12708/86094
• Why Computer Science Can't Get Enough of Clones / Salzer, G. (2015). Why Computer Science Can’t Get Enough of Clones. AAA89, Dresden, EU. http://hdl.handle.net/20.500.12708/86034
• Give Me Another One! / Behrisch, M., & Salzer, G. (2015). Give Me Another One! In I. Elbassioni (Ed.), Algorithms and Computation (pp. 664–676). Springer LNCS. https://doi.org/10.1007/978-3-662-48971-0_56
• Equilibrium Semantics for IF Logic and Many-Valued Connectives / Fermüller, C., & Majer, O. (2015). Equilibrium Semantics for IF Logic and Many-Valued Connectives. In H. H. Hansen (Ed.), Logic, Language, and Computation. TbiLLC 2015 (pp. 290–312). Springer. http://hdl.handle.net/20.500.12708/57243
• Solving SAT with Antimatter in Membrane Computing / Freund, R. (2015). Solving SAT with Antimatter in Membrane Computing. In M. J. Dinneen (Ed.), CDMTCS Research Report Series Proceedings of the Workshop on Membrane Computing 2015 (WMC2015) (pp. 48–58). http://hdl.handle.net/20.500.12708/56372
• Realization Theorems for Justification Logics: Full Modularity / Borg, A., & Kuznets, R. (2015). Realization Theorems for Justification Logics: Full Modularity. In H. De Nivelle (Ed.), Lecture Notes in Computer Science (pp. 221–236). Springer LNCS. https://doi.org/10.1007/978-3-319-24312-2_16
• Combining Fuzziness and Context Sensitivity in Game Based Models of Vague Quantification / Fermüller, C. G. (2015). Combining Fuzziness and Context Sensitivity in Game Based Models of Vague Quantification. In V.-N. Huynh, M. Inuiguchi, & T. Denoeux (Eds.), Lecture Notes in Computer Science (pp. 19–31). Springer. https://doi.org/10.1007/978-3-319-25135-6_4
• Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic / Baaz, M., & Fermüller, C. (2015). Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic. In S. Kreutzer (Ed.), 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) (p. 14). https://doi.org/10.4230/LIPIcs.CSL.2015.94
• Going Beyond Turing with Extended Spiking Neural P Systems with White Hole Rules / Freund, R., & Oswald, M. (2015). Going Beyond Turing with Extended Spiking Neural P Systems with White Hole Rules. In M. J. Dinneen (Ed.), Proceedings of the Workshop on Membrane Computing 2015 (WMC2015) (pp. 17–32). http://hdl.handle.net/20.500.12708/56371
• Small Catalytic P Systems / Freund, R. (2015). Small Catalytic P Systems. In M. Dinneen (Ed.), Proceedings of the Workshop on Membrane Computing 2015 (WMC2015) (pp. 1–16). http://hdl.handle.net/20.500.12708/56370
• Higher-Order Modal Logics: Automation and Applications / Woltzenlogel-Paleo, B. (2015). Higher-Order Modal Logics: Automation and Applications. In Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin (pp. 32–74). Springer LNCS. http://hdl.handle.net/20.500.12708/56336
• Interacting with Modal Logics in the Coq Proof Assistant / Woltzenlogel-Paleo, B. (2015). Interacting with Modal Logics in the Coq Proof Assistant. In L. Beklemishev (Ed.), Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, {CSR} 2015 (pp. 398–411). Springer LNCS. http://hdl.handle.net/20.500.12708/56334
• Dialogues for proof search / Alama, J. (2015). Dialogues for proof search. In C. Benzmüller (Ed.), ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics (pp. 65–70). EasyChair. http://hdl.handle.net/20.500.12708/56332
• Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses / Woltzenlogel-Paleo, B. (2015). Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses. In A. Middeldorp (Ed.), Automated Deduction - {CADE-25} - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings (pp. 356–366). Springer, LNAI. http://hdl.handle.net/20.500.12708/56333
• Non-isometric Contextual Array Grammars with Regular Control and Local Selectors / Freund, R. (2015). Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. In J. Durand-Lose (Ed.), Machines, Computations, and Universality: 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings (pp. 61–78). Springer LNCS. http://hdl.handle.net/20.500.12708/56309
• Variants of P Systems with Toxic Objects / Freund, R. (2015). Variants of P Systems with Toxic Objects. In J. Sempere (Ed.), Proceedings of the 16th International Conference on Membrane Computing, {CMC} 2015 (pp. 23–49). http://hdl.handle.net/20.500.12708/56181
• Standard Completeness for Uninorm-Based Logics / Baldi, P., & Ciabattoni, A. (2015). Standard Completeness for Uninorm-Based Logics. In 2015 IEEE International Symposium on Multiple-Valued Logic. 2015 IEEE International Symposium on Multiple-Valued Logic (ISMVL 2015), Waterloo, Canada, Non-EU. https://doi.org/10.1109/ismvl.2015.20
• A Note on the Complexity of Classical and Intuitionistic Proofs / Leitsch, A., Baaz, M., & Reis, G. (2015). A Note on the Complexity of Classical and Intuitionistic Proofs. In Logic in Computer Science (LICS) (pp. 657–666). http://hdl.handle.net/20.500.12708/56144
• How to Go Beyond Turing with P Automata: Time Travels, Regular Observer w-Languages, and Partial Adult Halting / Freund, R., & Ivanov, S. (2015). How to Go Beyond Turing with P Automata: Time Travels, Regular Observer w-Languages, and Partial Adult Halting. In G. Paun (Ed.), Proceedings of the Thirteenth Brainstorming Week on Membrane Computing (pp. 143–158). Fenix Editora. http://hdl.handle.net/20.500.12708/56143
• On The Semantics of Annihilation Rules in Membrane Computing / Freund, R. (2015). On The Semantics of Annihilation Rules in Membrane Computing. In G. Paun (Ed.), Proceedings of the Thirteenth Brainstorming Week on Membrane Computing (pp. 131–142). Fenix Editora. http://hdl.handle.net/20.500.12708/56142
• Extended Spiking Neural P Systems with White Hole Rules / Freund, R., Oswald, M., & Alhazov, A. (2015). Extended Spiking Neural P Systems with White Hole Rules. In G. Paun (Ed.), Proceedings of the Thirteenth Brainstorming Week on Membrane Computing (pp. 45–62). Fenix Editora. http://hdl.handle.net/20.500.12708/56141
• Variants of P Systems with Toxic Objects / Freund, R., & Alhazov, A. (2015). Variants of P Systems with Toxic Objects. In G. Paun (Ed.), Proceedings of the Thirteenth Brainstorming Week on Membrane Computing (pp. 19–44). Fenix Editora. http://hdl.handle.net/20.500.12708/56140
• Polarizationless P Systems with One Active Membrane / Freund, R., & Alhazov, A. (2015). Polarizationless P Systems with One Active Membrane. In G. Paun (Ed.), Proceedings of the Thirteenth Brainstorming Week on Membrane Computing (pp. 9–18). Fenix Editora. http://hdl.handle.net/20.500.12708/56139
• Deterministic Non-cooperative P Systems with Strong Context Conditions / Freund, R., & Alhazov, A. (2015). Deterministic Non-cooperative P Systems with Strong Context Conditions. In G. Paun (Ed.), Proceedings of the Thirteenth Brainstorming Week on Membrane Computing (pp. 1–8). Fenix Editora. http://hdl.handle.net/20.500.12708/56138
• Going Beyond Turing with P Automata: Partial Adult Halting and Regular Ovserver Languages / Freund, R., & Staiger, L. (2015). Going Beyond Turing with P Automata: Partial Adult Halting and Regular Ovserver Languages. In C. S. Calude (Ed.), Unconventional Computation and Natural Computation (pp. 169–181). LNCS/Springer. http://hdl.handle.net/20.500.12708/56126
• P Systems with Generalized Multisets Over Totally Ordered Abelian Groups / Freund, R. (2015). P Systems with Generalized Multisets Over Totally Ordered Abelian Groups. In J. Sempere (Ed.), Membrane Computing (pp. 117–136). https://doi.org/10.1007/978-3-319-28475-0_9
• A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems / Freund, R. (2015). A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. In J. Durand-Lose (Ed.), Lecture Notes in Computer Science (pp. 31–44). Springer International Publishing. https://doi.org/10.1007/978-3-319-23111-2_3
• Mīmāṃsā Deontic Logic: Proof Theory and Applications / Lellmann, B., Ciabattoni, A., Freschi, E., & Genco, F. (2015). Mīmāṃsā Deontic Logic: Proof Theory and Applications. In H. De Nivelle (Ed.), Lecture Notes in Computer Science (pp. 323–338). Springer LNCS. https://doi.org/10.1007/978-3-319-24312-2_22
• Grafting Hypersequents onto Nested Sequents / Kuznets, R., & Lellmann, B. (2015). Grafting Hypersequents onto Nested Sequents (1502.00814). http://hdl.handle.net/20.500.12708/38665
• Algebraic Representation of Regular Array Languages on Cayley Graphs / Freund, R., & Oswald, M. (2015). Algebraic Representation of Regular Array Languages on Cayley Graphs. In G. Paun (Ed.), Discrete Mathematics and Computer Science (pp. 165–189). Editura Academiei Romane. http://hdl.handle.net/20.500.12708/28930
• All about Proofs, Proofs for All / Woltzenlogel-Paleo, B. (Ed.). (2015). All about Proofs, Proofs for All. College Publications. http://hdl.handle.net/20.500.12708/24054

2014

• The universal homogeneous binary tree / Pinsker, M. (2014). The universal homogeneous binary tree. arXiv. https://doi.org/10.48550/arXiv.1409.2170
• Realizing public announcements by justifications / Bucheli, S., Kuznets, R., & Studer, T. (2014). Realizing public announcements by justifications. Journal of Computer and System Sciences, 80(6), 1046–1066. https://doi.org/10.1016/j.jcss.2014.04.001
• Logical omniscience as infeasibility / Artemov, S., & Kuznets, R. (2014). Logical omniscience as infeasibility. Annals of Pure and Applied Logic, 165(1), 6–25. https://doi.org/10.1016/j.apal.2013.07.003
• Reducts of the random partial order. / Pinsker, M. (2014). Reducts of the random partial order. Advances in Mathematics, 267, 94–120. https://doi.org/10.1016/j.aim.2014.08.008
• Cut-Elimination: Syntax and Semantics / Baaz, M., & Leitsch, A. (2014). Cut-Elimination: Syntax and Semantics. Studia Logica, 102(6), 1217–1244. https://doi.org/10.1007/s11225-014-9563-2
• Hypersequent and Display Calculi - a Unified Perspective / Ciabattoni, A., & Ramanayake, R. (2014). Hypersequent and Display Calculi - a Unified Perspective. Studia Logica, 102(6), 1245–1294. https://doi.org/10.1007/s11225-014-9566-z
• Taming Paraconsistent (and Other) Logics: An Algorithmic Approach / Ciabattoni, A., & Spendier, L. (2014). Taming Paraconsistent (and Other) Logics: An Algorithmic Approach. Journal of the ACM, 16(1), 1–23. https://doi.org/10.1145/2661636
• Premise selection for mathematics by corpus analysis and kernel methods / Alama, J., Heskes, T., Kühlwein, D., Tsivtsivadze, E., & Urban, J. (2014). Premise selection for mathematics by corpus analysis and kernel methods. Journal of Automated Reasoning, 52(2), 191–213. https://doi.org/10.1007/s10817-013-9286-5
• The simplest axiom system for plane hyperbolic geometry revisited, again / Alama, J. (2014). The simplest axiom system for plane hyperbolic geometry revisited, again. Studia Logica, 102(3), 609–615. https://doi.org/10.1007/s11225-013-9509-0
• A curious dialogical logic and its composition problem / Uckelman, S. L., Alama, J., & Knoks, A. (2014). A curious dialogical logic and its composition problem. Journal of Philosophical Logic, 43(6), 1065–1100. https://doi.org/10.1007/s10992-013-9307-1
• Preface / Ciabattoni, A., Baaz, M., Gabbay, D. M., Hetzl, S., & Weller, D. (2014). Preface. Journal of Logic and Computation, 27(2), 415–415. https://doi.org/10.1093/logcom/exu076
• Antimatter as a Frontier of Tractability in Membrane Computing / Freund, R., & Alhazov, A. (2014). Antimatter as a Frontier of Tractability in Membrane Computing. Fundamenta Informaticae, 134(1–2), 83–96. http://hdl.handle.net/20.500.12708/157271
• Length P Systems / Freund, R., & Alhazov, A. (2014). Length P Systems. Fundamenta Informaticae, 134(1–2), 17–37. http://hdl.handle.net/20.500.12708/157270
• Report on UCNC 2014 / Freund, R., & Hava, T. (2014). Report on UCNC 2014. Bulletin of the EATCS, 114. http://hdl.handle.net/20.500.12708/157234
• From Games to Truth Functions: A Generalization of Giles's Game / Fermüller, C. G., & Roschger, C. (2014). From Games to Truth Functions: A Generalization of Giles’s Game. Studia Logica, 102(2), 389–410. https://doi.org/10.1007/s11225-014-9550-7
• Randomized game semantics for semi-fuzzy quantifiers / Fermüller, C., & Roschger, C. (2014). Randomized game semantics for semi-fuzzy quantifiers. Logic Journal of the IGPL, 22(3), 413–439. http://hdl.handle.net/20.500.12708/157224
• Numeric semantics of class diagrams with multiplicity and uniqueness constraints / Salzer, G., & Feinerer, I. (2014). Numeric semantics of class diagrams with multiplicity and uniqueness constraints. Software and Systems Modeling, 13(3), 1167–1187. https://doi.org/10.1007/s10270-012-0294-4
• Introducing Quantified Cuts in Logic with Equality / Leitsch, A., Hetzl, S., Reis, G., & Weller, D. (2014). Introducing Quantified Cuts in Logic with Equality. arXiv. https://doi.org/10.48550/arXiv.1402.2474
• Algorithmic Introduction of Quantified Cuts / Hetzl, S., Reis, G., & Weller, D. (2014). Algorithmic Introduction of Quantified Cuts. arXiv. https://doi.org/10.48550/arXiv.1401.4330
• Algorithmic introduction of quantified cuts / Hetzl, S., Leitsch, A., Reis, G., & Weller, D. (2014). Algorithmic introduction of quantified cuts. Theoretical Computer Science, 549, 1–16. https://doi.org/10.1016/j.tcs.2014.05.018
• Dialogues for proof search / Alama, J. (2014). Dialogues for proof search. Automated Reasoning in Quantified Non-Classical Logics (VSL 2014), Wien, Austria. http://hdl.handle.net/20.500.12708/85966
• Without E / Alama, J. (2014). Without E. Logica 2014, Hejnice, Tschechien, EU. http://hdl.handle.net/20.500.12708/85967
• Reverse-engineering mathematics / Alama, J. (2014). Reverse-engineering mathematics. Seminar Young India Fellows @ Ashoka University, Sonipat, Indien, Non-EU. http://hdl.handle.net/20.500.12708/85965
• New results on Hilbert's 24th problem / Alama, J. (2014). New results on Hilbert’s 24th problem. Algebra and Logic Seminar, Center for Mathematics and its Applications, New University of Lisbon, Caparica, Portugal, EU. http://hdl.handle.net/20.500.12708/85963
• New views into dialogue games for classical and intuitionistic logic / Alama, J. (2014). New views into dialogue games for classical and intuitionistic logic. Seminar Faculty of Information Systems and Applied Computer Science @ University of Bamberg, Bamberg, Germany, EU. http://hdl.handle.net/20.500.12708/85964
• From truth-functional to substructural logics via semantic games / Fermüller, C. (2014). From truth-functional to substructural logics via semantic games. AsubL take 5, Mrlbourne, Australien, Non-EU. http://hdl.handle.net/20.500.12708/85961
• Vagueness and logical dialogue games / Fermüller, C. (2014). Vagueness and logical dialogue games. Workshop on Vagueness via Nonclassical Logics, Sydbey, Australien, Non-EU. http://hdl.handle.net/20.500.12708/85962
• n Equilibrium Semantics for IF-Logic and Many-Valued Connectives / Fermüller, C. (2014). n Equilibrium Semantics for IF-Logic and Many-Valued Connectives. ISRALOG 2014, Haifa, Israel, Non-EU. http://hdl.handle.net/20.500.12708/85960
• Parallel Dialogue Games and Hypersequents / Fermüller, C. (2014). Parallel Dialogue Games and Hypersequents. Workshop on Proofs as Processes, Kanazawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/85959
• Topological Birkhoff and Constraint Satisfaction / Pinsker, M. (2014). Topological Birkhoff and Constraint Satisfaction. LIAFA, Automates et Applications Seminar, Paris, EU. http://hdl.handle.net/20.500.12708/85932
• Introduction to Constraint Satisfaction over infinite structures / Pinsker, M. (2014). Introduction to Constraint Satisfaction over infinite structures. Logic Seminar of the University of Colorado, Boulder, Non-EU. http://hdl.handle.net/20.500.12708/85931
• Decomposing function clones on infinite sets / Pinsker, M. (2014). Decomposing function clones on infinite sets. Algebra Seminar at University of Colorado, Boulder, Non-EU. http://hdl.handle.net/20.500.12708/85930
• Constraint Satisfaction on infinite domains (tutorial) / Pinsker, M. (2014). Constraint Satisfaction on infinite domains (tutorial). Workshop of Banff International Research Station- Algebraic and Model Theoretical Methods in Constraint Satisfaction, Banff, Non-EU. http://hdl.handle.net/20.500.12708/85927
• Algebraic and model theoretic methods in constraint satisfaction / Pinsker, M. (2014). Algebraic and model theoretic methods in constraint satisfaction. CUNY Logic Workshop, New York, Non-EU. http://hdl.handle.net/20.500.12708/85926
• Algebraic and model theoretic methods in constraint satisfaction / Pinsker, M. (2014). Algebraic and model theoretic methods in constraint satisfaction. Doc-Course Prag, Charles University Prague,Prag, EU. http://hdl.handle.net/20.500.12708/85924
• Projective clone homomorphisms / Pinsker, M. (2014). Projective clone homomorphisms. STRUCO Meeting, Charles University Prague,Prag, EU. http://hdl.handle.net/20.500.12708/85925
• Integer Sequences, Recursive Lemma Elimination and Combinatorics / Cerna, D. (2014). Integer Sequences, Recursive Lemma Elimination and Combinatorics. DIMACS Conference on Challenges of Identifying Integer Sequences, New York, Non-EU. http://hdl.handle.net/20.500.12708/85922
• Formalization and Automated Verification of Gödel's Proof of God's Existence / Woltzenlogel-Paleo, B., & Benzmüller, C. (2014). Formalization and Automated Verification of Gödel’s Proof of God’s Existence. 4th World Congress on the Square of Opposition, Vatikan, EU. http://hdl.handle.net/20.500.12708/85917
• Reconstructing structures from their abstract clones / Pinsker, M. (2014). Reconstructing structures from their abstract clones. ASL North American Annual Meeting (Special Session on Universal Algebra and CSPs, Boulder, Non-EU. http://hdl.handle.net/20.500.12708/85916
• Clones on Ramsey Structures / Pinsker, M. (2014). Clones on Ramsey Structures. Konferenz Algebra and Clones Fest, Prag, EU. http://hdl.handle.net/20.500.12708/85915
• Tools for the investigation of substructural and paraconsistent logics / Ciabattoni, A. (2014). Tools for the investigation of substructural and paraconsistent logics. XXV incontro dell’Associazione Italiana di Logica e sue Applicazioni, Pisa, EU. http://hdl.handle.net/20.500.12708/85913
• (Algebraic) Proof Theory for Substructural Logics and Applications / Ciabattoni, A. (2014). (Algebraic) Proof Theory for Substructural Logics and Applications. 87. Arbeitstagung Allgemeine Algebra (AAA87), Linz, Austria. http://hdl.handle.net/20.500.12708/85914
• A proof theoretic approach to Standard completeness / Ciabattoni, A. (2014). A proof theoretic approach to Standard completeness. Konference: Beyond True and False: Logic, Algebra and Topology, Florenz, EU. http://hdl.handle.net/20.500.12708/85912
• Mathematical Proof Analysis / Leitsch, A. (2014). Mathematical Proof Analysis. VSL 2014, Wien, Austria. http://hdl.handle.net/20.500.12708/85900
• "Weak Arithmetical Interpretations for the Logic of Proofs / Kuznets, R., & Studer, T. (2014). "Weak Arithmetical Interpretations for the Logic of Proofs. ISRALOG´14: Israeli Workshop on Non-Classical Logics and Their Applications, Haifa, Israel, Non-EU. http://hdl.handle.net/20.500.12708/85880
• Applications of Nested-Sequent Proof Systems for Modal Logics to the Craig Interpolation Property / Fitting, M., & Kuznets, R. (2014). Applications of Nested-Sequent Proof Systems for Modal Logics to the Craig Interpolation Property. VSL - Nonclassical Proofs Workshop, Wien, Austria. http://hdl.handle.net/20.500.12708/85878
• Separating Truth and Proof in the Logic of Proofs / Kuznets, R. (2014). Separating Truth and Proof in the Logic of Proofs. VSL-GetFun Workshop, Wien, Austria. http://hdl.handle.net/20.500.12708/85879
• A survey of residuated frames with connections to semirings and to display logic / Galatos, N. (2014). A survey of residuated frames with connections to semirings and to display logic. Prague seminar of substructural logics, Prag, EU. http://hdl.handle.net/20.500.12708/85877
• Proof theory for lattice-ordered groups / Galatos, N. (2014). Proof theory for lattice-ordered groups. Brazilian Logic Conference, Petropolis, Non-EU. http://hdl.handle.net/20.500.12708/85876
• Embeddings into BiFL-algebras and conservativity / Galatos, N. (2014). Embeddings into BiFL-algebras and conservativity. VSL - LADT Workshop, Wien, Austria. http://hdl.handle.net/20.500.12708/85875
• Standard completeness: proof-theoretical and algebraic approaches / Baldi, P., Ciabattoni, A., & Terui, K. (2014). Standard completeness: proof-theoretical and algebraic approaches. 35th Linz Seminar of Fuzzy Set Theory, Linz, Austria. http://hdl.handle.net/20.500.12708/85866
• Non classical proofs: Theory, applications and tools / Ciabattoni, A. (2014). Non classical proofs: Theory, applications and tools. Prague Seminar on Substructural Logics, Prag, Czech Republic, EU. http://hdl.handle.net/20.500.12708/85785
• The topology of algebras, or: Polish clones / Pinsker, M. (2014). The topology of algebras, or: Polish clones. Arbeitstagung Allgemeine Algebra, Linz, Austria. http://hdl.handle.net/20.500.12708/85776
• Skeptik: A Proof Compression System / Woltzenlogel-Paleo, B. (2014). Skeptik: A Proof Compression System. In Automated Reasoning (pp. 374–380). Springer LNCS. https://doi.org/10.1007/978-3-319-08587-6_29
• Tools for the Investigation of Substructural and Paraconsistent Logics / Ciabattoni, A., & Spendier, L. (2014). Tools for the Investigation of Substructural and Paraconsistent Logics. In Logics in Artificial Intelligence (pp. 18–32). LNCS/Springer. https://doi.org/10.1007/978-3-319-11558-0_2
• Variants of P Automata / Freund, R. (2014). Variants of P Automata. In New Computing Paradigms - Workshop (p. 7). http://hdl.handle.net/20.500.12708/55729
• P Systems with Matter and Anti-Matter / Freund, R., Paun, G., & Alhazov, A. (2014). P Systems with Matter and Anti-Matter. In A. Beckmann (Ed.), Tenth Conference on Computability in Europe, CiE 2014 Language, Life, Limits (p. 1). http://hdl.handle.net/20.500.12708/55728
• Red-Green P Automata / Freund, R. (2014). Red-Green P Automata. In M. Gheorghe (Ed.), Membrane Computing - 15th International Conference, CMC 2014 (pp. 139–157). http://hdl.handle.net/20.500.12708/55391
• P Systems with Toxic Objects / Freund, R., & Alhazov, A. (2014). P Systems with Toxic Objects. In M. Gheorghe (Ed.), Membrane Computing (pp. 99–125). https://doi.org/10.1007/978-3-319-14370-5_7
• Promoters and Inhibitors in Purely Catalytic P Systems / Freund, R., Verlan, S., & Alhazov, A. (2014). Promoters and Inhibitors in Purely Catalytic P Systems. In M. Gheorghe (Ed.), Membrane Computing (pp. 126–138). https://doi.org/10.1007/978-3-319-14370-5_8
• Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems / Freund, R., & Alhazov, A. (2014). Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems. In M. Gheorghe (Ed.), Membrane Computing (pp. 86–98). https://doi.org/10.1007/978-3-319-14370-5_6
• P Systems with Anti-Matter / Freund, R., & Alhazov, A. (2014). P Systems with Anti-Matter. In M. Gheorghe & G. Rozenberg (Eds.), Membrane Computing (pp. 66–85). https://doi.org/10.1007/978-3-319-14370-5_5
• On the use of Hesitant Fuzzy Linguistic Term Set in FLINTSTONES / Rodriguez, R. (2014). On the use of Hesitant Fuzzy Linguistic Term Set in FLINTSTONES. In 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, Austria. IEEE Computer Society Press. https://doi.org/10.1109/fuzz-ieee.2014.6891799
• Quati: An Automated Tool for Proving Permutation Lemmas / Reis, G. (2014). Quati: An Automated Tool for Proving Permutation Lemmas. In D. Kapur (Ed.), Automated Reasoning (pp. 255–261). LNCS/Springer. https://doi.org/10.1007/978-3-319-08587-6_18
• Flattening in (Tissue) P Systems / Freund, R., & Verlan, S. (2014). Flattening in (Tissue) P Systems. In A. Alhazov (Ed.), Membrane Computing (pp. 173–188). LNCS/Springer. https://doi.org/10.1007/978-3-642-54239-8_13
• P Systems with Anti-Matter / Freund, R., & Paun, G. (2014). P Systems with Anti-Matter. In G. Paun (Ed.), 12th Brainstorming Week on membrane Computing - Proceedings (pp. 169–183). Fenix Editora. http://hdl.handle.net/20.500.12708/55337
• Red-Green P Automata / Freund, R., & Csuhaj-Varjú, E. (2014). Red-Green P Automata. In 12th Brainstorming Week on membrane Computing - Proceedings (pp. 73–79). Fenix Editora. http://hdl.handle.net/20.500.12708/55336
• Length P Systems with a Lone Traveler / Freund, R., & Alhazov, A. (2014). Length P Systems with a Lone Traveler. In G. Paun (Ed.), 12th Brainstorming Week on membrane Computing - Proceedings (pp. 37–49). Fenix Editora. http://hdl.handle.net/20.500.12708/55335
• Priorities, Promoters and Inhibitors in Deterministic Non-Cooperative P Systems / Freund, R., & Alhazov, A. (2014). Priorities, Promoters and Inhibitors in Deterministic Non-Cooperative P Systems. In G. Paun (Ed.), 12th Brainstorming Week on membrane Computing - Proceedings (pp. 27–37). Fenix Editora. http://hdl.handle.net/20.500.12708/55334
• Matter and Anti-Matter in Membrane Systems / Freund, R. (2014). Matter and Anti-Matter in Membrane Systems. In G. Paun (Ed.), 12th Brainstorming Week on membrane Computing - Proceedings (pp. 1–27). Fenix Editora. http://hdl.handle.net/20.500.12708/55333
• P Systems with Anti-Matter / Freund, R., & Alhazov, A. (2014). P Systems with Anti-Matter. In H. Bordihn (Ed.), 24.Theorietag “Automaten und Formale Sprachen” (pp. 19–23). Universität Potsdam. http://hdl.handle.net/20.500.12708/55332
• Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete / Freund, R., Alhazov, A., & Rogozhin, Y. (2014). Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete. In O. H. Ibarra (Ed.), Unconventional Computation and Natural Computation (pp. 1–13). LNCS/Springer. https://doi.org/10.1007/978-3-319-08123-6_1
• Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes / Freund, R., Fernau, H., & Holzer, M. (2014). Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. In Z. Esik (Ed.), Electronic Proceedings in Theoretical Computer Science (pp. 246–260). EPTCS. https://doi.org/10.4204/eptcs.151.17
• Semantic Games with Backtracking for Fuzzy Logics / Fermüller, C. (2014). Semantic Games with Backtracking for Fuzzy Logics. In 2014 IEEE 44th International Symposium on Multiple-Valued Logic. ISMVL 2014, Bremen, EU. https://doi.org/10.1109/ismvl.2014.15
• Hintikka-Style Semantic Games for Fuzzy Logics / Fermüller, C. G. (2014). Hintikka-Style Semantic Games for Fuzzy Logics. In C. Beierle (Ed.), Lecture Notes in Computer Science (pp. 193–210). LNCS/Springer. https://doi.org/10.1007/978-3-319-04939-7_9
• Automating Gödel's Ontological Proof of God's Existence with Higher-order Automated Theorem Provers / Woltzenlogel-Paleo, B., & Benzmüller, C. (2014). Automating Gödel’s Ontological Proof of God’s Existence with Higher-order Automated Theorem Provers. In T. Schaub (Ed.), Proceeding to ECAI 2014 - 21st European Conference on Artificial Intelligence (pp. 93–98). IOS Press. http://hdl.handle.net/20.500.12708/55256
• Introducing Quantified Cuts in Logic with Equality / Hetzl, S., Leitsch, A., Reis, G., Tapolczai, J., & Weller, D. (2014). Introducing Quantified Cuts in Logic with Equality. In Automated Reasoning (pp. 240–254). LNCS 8562. https://doi.org/10.1007/978-3-319-08587-6_17
• Bridges between contextual linguistic models of vagueness and t-norm based fuzzy logic / Fermüller, C., & Roschger, C. (2014). Bridges between contextual linguistic models of vagueness and t-norm based fuzzy logic. In F. Montagna (Ed.), Petr Hajek on Mathematical Fuzzy Logic (pp. 91–116). Springer. http://hdl.handle.net/20.500.12708/28400
• Small P Systems Defining Non-semilinear Sets / Freund, R., & Alhazov, A. (2014). Small P Systems Defining Non-semilinear Sets. In A. Adamatzky (Ed.), Automata, Computation, Universality (pp. 183–217). Springer International Publishing. http://hdl.handle.net/20.500.12708/28547
• Generating and accepting P systems with minimal left and right insertion and deletion / Freund, R., Rogozhin, Y., & Verlan, S. (2014). Generating and accepting P systems with minimal left and right insertion and deletion. In J. M. Ferrandez (Ed.), Natural Computing (pp. 257–268). Springer. https://doi.org/10.1007/s11047-013-9396-3

2013

• On matrices, Nmatrices and games / Fermüller, C. G. (2013). On matrices, Nmatrices and games. Journal of Logic and Computation, 26(1), 189–211. https://doi.org/10.1093/logcom/ext024
• Proof theory for locally finite many-valued logics: Semi-projective logics / Ciabattoni, A., & Montagna, F. (2013). Proof theory for locally finite many-valued logics: Semi-projective logics. Theoretical Computer Science, 480, 26–42. http://hdl.handle.net/20.500.12708/155501
• Universality of the lattice of transformation monoids. / Pinsker, M. (2013). Universality of the lattice of transformation monoids. Proceedings of the American Mathematical Society, 141(9), 3005–3011. https://doi.org/10.1090/s0002-9939-2013-11566-2
• Reconstructing the topology of clones / Pinsker, M. (2013). Reconstructing the topology of clones (p. 29). arXiv. https://doi.org/10.48550/arXiv.1312.7699
• A new operation on partially ordered sets / Pinsker, M. (2013). A new operation on partially ordered sets. Journal of Combinatorial Theory, Series A, 120(7), 1450–1462. https://doi.org/10.1016/j.jcta.2013.04.003
• A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone / Pinsker, M., & Goldstern, M. (2013). A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone. International Journal of Algebra and Computation, 23(05), 1115–1125. https://doi.org/10.1142/s0218196713500197
• A dissimilarity-based framework for generating inconsistency-tolerant logics / Zamansky, A. (2013). A dissimilarity-based framework for generating inconsistency-tolerant logics. Annals of Mathematics and Artificial Intelligence, 73(1–2), 47–73. https://doi.org/10.1007/s10472-013-9333-2
• Herbrand-Confluence / Hetzl, S., & Strassburger, L. (2013). Herbrand-Confluence. Logical Methods in Computer Science, 9(4), 1–25. https://doi.org/10.48550/arXiv.1310.8156
• Finite-valued Semantics for Canonical Labelled Calculi / Zamansky, A., & Baaz, M. (2013). Finite-valued Semantics for Canonical Labelled Calculi. Journal of Automated Reasoning, 51(4), 401–430. https://doi.org/10.1007/s10817-013-9273-x
• A formalization of membrane szstems with dynamically evolving structures / Freund, R., & Verlan, S. (2013). A formalization of membrane szstems with dynamically evolving structures. International Journal of Computer Mathematics, 90(4), 801–815. https://doi.org/10.1080/00207160.2012.748899
• Ceres for First-Order Schemata / Leitsch, A., Dunchev, T., Weller, D., & Rukhaia, M. (2013). Ceres for First-Order Schemata (p. 40). arXiv. https://doi.org/10.48550/arXiv.1303.4257
• Formal approaches to rule-based systems in medicine: The case of CADIAG-2 / Ciabattoni, A., Picado Muino, D., Vetterlein, T., & El Zekey, M. (2013). Formal approaches to rule-based systems in medicine: The case of CADIAG-2. International Journal of Approximate Reasoning: Uncertainty in Intelligent Systems, 54(1), 132–148. https://doi.org/10.1016/j.ijar.2012.09.002
• Contextual Natural Deduction / Woltzenlogel-Paleo, B. (2013). Contextual Natural Deduction. In S. Artemov & A. Nerode (Eds.), Logical Foundations of Computer Science : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings (pp. 372–386). Springer LNCS. https://doi.org/10.1007/978-3-642-35722-0_27
• Compression of Propositional Resolution Proofs by Lowering Subproofs / Boudou, J., & Woltzenlogel-Paleo, B. (2013). Compression of Propositional Resolution Proofs by Lowering Subproofs. In D. Galmiche & D. Larchey-Wendling (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods : 22nd International Conference, TABLEAUX 2013, Nancy, France, September 16-19, 2013, Proceedings (pp. 59–73). Springer. https://doi.org/10.1007/978-3-642-40537-2_7
• Finitary aspects of reducts of homogeneous structures / Pinsker, M. (2013). Finitary aspects of reducts of homogeneous structures. Eötvös University, Budapest, EU. http://hdl.handle.net/20.500.12708/85735
• Topological Birkhoff and reconstructing the random graph / Pinsker, M. (2013). Topological Birkhoff and reconstructing the random graph. Hausdorff Research Institute for Mathematics, Bonn, EU. http://hdl.handle.net/20.500.12708/85733
• Reconstructing the topology of clones, Workshop on Homogeneous Structures / Pinsker, M. (2013). Reconstructing the topology of clones, Workshop on Homogeneous Structures. Workshop on Homogeneous Structures, Hausdorff Research Institute for Mathematics, Bonn, EU. http://hdl.handle.net/20.500.12708/85734
• Reconstructing omega-categorical structures from their clones / Pinsker, M. (2013). Reconstructing omega-categorical structures from their clones. Oberseminar mathematische Logik, Universitaet Bonn, Bonn, EU. http://hdl.handle.net/20.500.12708/85732
• Towards Powerful and Decidable Formalizations Through Schematic Representation / Cerna, D. (2013). Towards Powerful and Decidable Formalizations Through Schematic Representation. UNILOG 2013 - Workshop on Compositional Meaning in Logic (GeTFun 1.0), Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/85719
• A framework for specifying and reasoning in sequent calculus systems / Reis, G. (2013). A framework for specifying and reasoning in sequent calculus systems. UNILOG 2013 - Workshop on Compositional Meaning in Logic (GeTFun 1.0), Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/85718
• Checking Proof Transformations with ASP / Reis, G. (2013). Checking Proof Transformations with ASP. ICLP 2013, Istanbul, Non-EU. http://hdl.handle.net/20.500.12708/85717
• Cut-Introduction: GAPT System Demonstration / Reis, G. (2013). Cut-Introduction: GAPT System Demonstration. 3rd workshop of the Amadeus project on Proof Compression (co-located with Tableaux 2013), Nancy, EU. http://hdl.handle.net/20.500.12708/85716
• Methods of Cut-Elimination / Leitsch, A. (2013). Methods of Cut-Elimination. Ninth International Tbilisi Summer School in Logic and Language, Tbilisi, Georgia, Non-EU. http://hdl.handle.net/20.500.12708/85688
• Game Based Interpretations of Mathematical Fuzzy Logics / Fermüller, C. (2013). Game Based Interpretations of Mathematical Fuzzy Logics. 2nd Workshop on Algebraic Logics and Mathematical Fuzzy Logic, Prag, EU. http://hdl.handle.net/20.500.12708/85675
• Power andl limits of structural rules / Ciabattoni, A. (2013). Power andl limits of structural rules. LIX Colloquium 2013: Theory and Application of Formal Proofs, Paris, France, EU. http://hdl.handle.net/20.500.12708/85640
• Analytic calculi for non-classical logics: The Baha'i Method / Ciabattoni, A. (2013). Analytic calculi for non-classical logics: The Baha’i Method. UniLog 2013, Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/85639
• Analytic calculi for non-classical logics: The Baha'i Method / Ciabattoni, A. (2013). Analytic calculi for non-classical logics: The Baha’i Method. Tenth International Tbilisi Symposium on Language, Logic and Computation, TbiLLC 2013, Tbilisi, Georgia, Non-EU. http://hdl.handle.net/20.500.12708/85638
• Informatik - Knifflige Rätsel und andere Spielereien / Spendier, L. (2013). Informatik - Knifflige Rätsel und andere Spielereien. Yo!Tech 2013, Wien, Austria. http://hdl.handle.net/20.500.12708/85585
• How to get featured in TIME magazine as a logician / Spendier, L. (2013). How to get featured in TIME magazine as a logician. Sofia Science Festival 2013, Sofia, EU. http://hdl.handle.net/20.500.12708/85584
• Automated Support for the Investigation of Paraconsistent and Other Logics / Spendier, L. (2013). Automated Support for the Investigation of Paraconsistent and Other Logics. 4th World Congress on Universal Logic, Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/85580
• Many Values in Semantic Games / Fermüller, C. (2013). Many Values in Semantic Games. Logica, Hejnice, Czech Republic, EU. http://hdl.handle.net/20.500.12708/85578
• Semantic games and hypersequents - a case study in many valued reasoning / Fermüller, C. (2013). Semantic games and hypersequents - a case study in many valued reasoning. Seminar of the Munich Center for Mathematical Philosophy, München, Deutschland, EU. http://hdl.handle.net/20.500.12708/85579
• A method of algorithmic cut-introduction / Leitsch, A. (2013). A method of algorithmic cut-introduction. Workshop on Skolemization, Utrecht, EU. http://hdl.handle.net/20.500.12708/85577
• Towards CERES in intuitionistic logic / Reis, G. (2013). Towards CERES in intuitionistic logic. Workshop on Skolemization, Utrecht, EU. http://hdl.handle.net/20.500.12708/85576
• Games semantics for deterministic and nondeterministic many-valued logics / Fermüller, C. (2013). Games semantics for deterministic and nondeterministic many-valued logics. UniLog 2013, Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/85553
• Prooftool: a GUI for the GAPT Framework / Leitsch, A., Libal, T., Riener, M., Weller, D., Woltzenlogel-Paleo, B., & Dunchev, T. (2013). Prooftool: a GUI for the GAPT Framework. In C. Kaliszyk (Ed.), Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/eptcs.118
• Class Diagrams with Equated Association Chains / Feinerer, I., Salzer, G., & Sisel, T. (2013). Class Diagrams with Equated Association Chains. In 2013 International Symposium on Theoretical Aspects of Software Engineering. 7th International Symposium on Theoretical Aspects of Software Engineering, Birmingham, EU. https://doi.org/10.1109/tase.2013.35
• Structural extensions of display calculi: A general recipe / Ciabattoni, A., & Ramanayake, R. (2013). Structural extensions of display calculi: A general recipe. In Lecture Notes in Computer Science. 20th International Workshop on Logic, Language, Information and Computation WoLLIC 2013, Darmstadt. Germany, EU. Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39992-3
• VCWC: A Versioning Competition Workflow Compiler / Charwat, G., Ianni, G., Krennwallner, T., Kronegger, M., Pfandler, A., Redl, C., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). VCWC: A Versioning Competition Workflow Compiler. In T. C. Son & P. Cabalar (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 233–238). Springer. http://hdl.handle.net/20.500.12708/54641 / Projects: ASP, HEX-Programme
• The Fourth Answer Set Programming Competition: Preliminary Report / Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Puehrer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). The Fourth Answer Set Programming Competition: Preliminary Report. In P. Cabalar & T. C. Son (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 42–53). Springer. http://hdl.handle.net/20.500.12708/54640 / Projects: ASP, HEX-Programme
• Sequential P Systems with Regular Control / Freund, R., Oswald, M., & Alhazov, A. (2013). Sequential P Systems with Regular Control. In M. Gheorghe (Ed.), Membrane Computing (pp. 112–127). Springer LNCS. https://doi.org/10.1007/978-3-642-36751-9_9
• Asynchronous and maximally parallel deterministic controlled non-cooperative P systems characterize NFIN and coNFIN / Freund, R., & Alhazov, A. (2013). Asynchronous and maximally parallel deterministic controlled non-cooperative P systems characterize NFIN and coNFIN. In M. Gheorghe (Ed.), Membrane computing. 13th international conference, CMC 2012, Budapest, Hungary, August 28--31, 2012 (pp. 101–111). Springer LNCS. http://hdl.handle.net/20.500.12708/54982
• Computational Completeness withe Generationg and Accepting P Systems Using Minimal Left and Right Insertion and Deletion / Freund, R., & Verlan, S. (2013). Computational Completeness withe Generationg and Accepting P Systems Using Minimal Left and Right Insertion and Deletion. In A. Alhazov (Ed.), The 14th International Conferense on Membrane Computing, CMC 14, Chisinau, Moldova (pp. 321–325). http://hdl.handle.net/20.500.12708/54980
• Control Mechnisms for Obtaining Comutational Completeness / Freund, R., Oswald, M., & Paun, G. (2013). Control Mechnisms for Obtaining Comutational Completeness. In Proceedings of The 14th International Conferense on Membrane Computing, CMC 14, Chisinau, Moldova (pp. 317–321). http://hdl.handle.net/20.500.12708/54979
• Undecidability and Computational Completeness for P Systems with One- and Two- dimensional Array Insertion and Deletion Rules / Freund, R., Fernau, H., & Oswald, M. (2013). Undecidability and Computational Completeness for P Systems with One- and Two- dimensional Array Insertion and Deletion Rules. In A. Alhazov (Ed.), The 14th International Conferense on Membrane Computing, CMC 14, Chisinau, Moldova (pp. 309–313). http://hdl.handle.net/20.500.12708/54978
• Two Catalysts Can Be Sufficent for Computational Completeness / Freund, R. (2013). Two Catalysts Can Be Sufficent for Computational Completeness. In A. Alhazov (Ed.), The 14th International Conferense on Membrane Computing, CMC 14, Chisinau, Moldova (pp. 153–167). http://hdl.handle.net/20.500.12708/54977
• How to Obtain Computational Completeness in P Systems with One Catalyst / Freund, R., & Paun, G. (2013). How to Obtain Computational Completeness in P Systems with One Catalyst. In T. Neary (Ed.), Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/eptcs.128
• Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness / Freund, R., & Oswald, M. (2013). Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. In S. Bensch & R. Freund (Eds.), Proceedings of the 5th Workshop on Non-Classical Models of Automata and Applications (NCMA) (pp. 133–150). http://hdl.handle.net/20.500.12708/54956
• Array Insertion and Deletion P Systems / Freund, R., & Fernau, H. (2013). Array Insertion and Deletion P Systems. In G. Mauri & A. Dennunzio (Eds.), 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013. Proceedings (pp. 67–78). http://hdl.handle.net/20.500.12708/54955
• Eine natürliche Membranhierachie / Freund, R., & Fernau, H. (2013). Eine natürliche Membranhierachie. In Automaten und Formale Sprachen (pp. 49–52). http://hdl.handle.net/20.500.12708/54692
• Array insertion and deletion P systems / Freund, R., Fernau, H., & Oswald, M. (2013). Array insertion and deletion P systems. In Automaten und Formale Sprachen (pp. 46–49). http://hdl.handle.net/20.500.12708/54691
• Universal P Systems: One Catalyst Can Be Sufficient / Freund, R., & Paun, G. (2013). Universal P Systems: One Catalyst Can Be Sufficient. In G. Paun & L. Valencia-Cabrera (Eds.), Proceedings of Eleventh Brainstorming Week on Membrane Computing (pp. 81–97). Fenix Editora. http://hdl.handle.net/20.500.12708/54686
• Automated Support for the Investigation of Paraconsistent and Other Logics / Ciabattoni, A., Lahav, O., Spendier, L., & Zamansky, A. (2013). Automated Support for the Investigation of Paraconsistent and Other Logics. In S. Artemov & A. Nerode (Eds.), Proceedings of the Symposium on Logical Foundations in Computer Science (LFCS 2013) (pp. 119–133). http://hdl.handle.net/20.500.12708/54662
• Hypersequent and Labelled Calculi for Intermediate Logics / Ciabattoni, A., Maffezioli, P., & Spendier, L. (2013). Hypersequent and Labelled Calculi for Intermediate Logics. In D. Galmiche & D. Larchey-Wendling (Eds.), Tableaux 2013 (pp. 81–96). http://hdl.handle.net/20.500.12708/54661
• Vermittlung informatischer Kompetenzen und Medienkompetenzen in allen Lehramtstudien aller Ausbildungsinstitute Österreichs / Bachinger, A., Brandhofer, G., Fuchs, K., Futschek, G., Freund, R., Gabriel, S., Goebl, R., Grossmann, W., Micheuz, P., Neuwirth, E., Nosko, C., Schedler, M., Traxler, P., & Wohlhart, D. (2013). Vermittlung informatischer Kompetenzen und Medienkompetenzen in allen Lehramtstudien aller Ausbildungsinstitute Österreichs. In Digitale Schule Österreich (pp. 67–70). books@ocg.at. http://hdl.handle.net/20.500.12708/27978
• MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123 / MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123. (2013). In A. Kucera, I. Potapov, A. Ciabattoni, S. Szeider, & R. Freivalds (Eds.), Fundamenta Informaticae. IOS Press. http://hdl.handle.net/20.500.12708/23747 / Project: Complex Reason

2012

• Towards Algorithmic Cut-Introduction / Leitsch, A., Hetzl, S., & Weller, D. (2012). Towards Algorithmic Cut-Introduction. In N. Bjørner & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 228–242). Springer LNCS. https://doi.org/10.1007/978-3-642-28717-6_19
• Modularity in term rewriting revisited / Gramlich, B. (2012). Modularity in term rewriting revisited. Theoretical Computer Science, 464, 3–19. https://doi.org/10.1016/j.tcs.2012.09.008
• Numeric semantics of class diagrams with multiplicity and uniqueness constraints / Feinerer, I., & Salzer, G. (2012). Numeric semantics of class diagrams with multiplicity and uniqueness constraints. Software and Systems Modeling, 13(3), 1167–1187. https://doi.org/10.1007/s10270-012-0294-4
• The Church-Fitch knowability paradox in the light of structural proof theory / Maffezioli, P., Naibo, A., & Negri, S. (2012). The Church-Fitch knowability paradox in the light of structural proof theory. Synthese, 190(14), 2677–2716. https://doi.org/10.1007/s11229-012-0061-7
• Note on deduction theorems in contraction-free logics / Chvalovský, K., & Cintula, P. (2012). Note on deduction theorems in contraction-free logics. Mathematical Logic Quarterly, 58(3), 236–243. http://hdl.handle.net/20.500.12708/164006
• Editorial / Cintula, P., Klement, E. P., & Stout, L. N. (2012). Editorial. Fuzzy Sets and Systems, 197, 1–2. http://hdl.handle.net/20.500.12708/164005
• Theorem proving for prenex Gödel logic with Delta: checkingvalidity and unsatisfiability / Ciabattoni, A., Baaz, M., & Fermüller, C. (2012). Theorem proving for prenex Gödel logic with Delta: checkingvalidity and unsatisfiability. Logical Methods in Computer Science, 8(1). https://doi.org/10.2168/lmcs-8(1:20)2012
• Sequential and maximally parallel multiset rewriting: reversiblility and determinism / Freund, R., Alhazov, A., & Morita, K. (2012). Sequential and maximally parallel multiset rewriting: reversiblility and determinism. Natural Computing, 11(1), 95–106. https://doi.org/10.1007/s11047-011-9267-8
• Algebraic proof theory for substructural logics: Cut elimination and completions / Ciabattoni, A., Galatos, N., & Terui, K. (2012). Algebraic proof theory for substructural logics: Cut elimination and completions. Annals of Pure and Applied Logic, 163(3), 266–290. https://doi.org/10.1016/j.apal.2011.09.003
• Proof theory for non-classical logics: negative results / Baaz, M., & Ciabattoni, A. (2012). Proof theory for non-classical logics: negative results. Logic, Algebra and Truth Degrees 2012, JAIST, Ishikawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/120071
• On Modularity of Termination Properties of Rewriting under Strategies / Gramlich, B. (2012). On Modularity of Termination Properties of Rewriting under Strategies. Annual Meeting of the IFIP-WG 1.6 - Term Rewriting, Valencia, Spain, Austria. http://hdl.handle.net/20.500.12708/85521
• CERES for First-Order Schemata / Leitsch, A. (2012). CERES for First-Order Schemata. Collegium Logicum 2012: Structural Proof Theory, Paris, France, EU. http://hdl.handle.net/20.500.12708/85552
• From Giles's game for reasoning in physics to analytic proof systems for fuzzy logics / Fermüller, C. (2012). From Giles’s game for reasoning in physics to analytic proof systems for fuzzy logics. OASIS: The Oxford Advanced Seminar on Informatic Structures, Oxford, UK, EU. http://hdl.handle.net/20.500.12708/85427
• On Matrices, Nmatrices, and Games / Fermüller, C. (2012). On Matrices, Nmatrices, and Games. Logic: Between Semantics and Proof Theory, Tel-Aviv, Non-EU. http://hdl.handle.net/20.500.12708/85428
• Randomizing Giles's Game for Fuzzy Quantification / Fermüller, C. (2012). Randomizing Giles’s Game for Fuzzy Quantification. Games, Game Theory and Game Semantics: Philosophical and Scientific Perspectives, Riga, Latvia, EU. http://hdl.handle.net/20.500.12708/85426
• Automated support for the investigation of paraconsistent and other logics / Spendier, L. (2012). Automated support for the investigation of paraconsistent and other logics. Collegium Logicum 2012: Structural Proof Theory, Paris, France, EU. http://hdl.handle.net/20.500.12708/85401
• Nonclassical proofs: theory, applications, and tools / Ciabattoni, A. (2012). Nonclassical proofs: theory, applications, and tools. Logical Models of Reasoning and Computation (LMRC12), Moskau, Russia, Non-EU. http://hdl.handle.net/20.500.12708/85381
• Proof theory for non-classical logics: a negative result / Ciabattoni, A., & Baaz, M. (2012). Proof theory for non-classical logics: a negative result. Pisa Summer Workshop on Proof Theory, Pisa, Italy, EU. http://hdl.handle.net/20.500.12708/85380
• Systematic proof theory for Many-valued logics / Ciabattoni, A. (2012). Systematic proof theory for Many-valued logics. ManyVal´12 (In honor of Antonio Di Nola´s 65th birthday), Salerno, Italy, EU. http://hdl.handle.net/20.500.12708/85379
• Rechnen mit Molekülen / Freund, R., & Freund, M. (2012). Rechnen mit Molekülen. Institutskolloquium des Instituts für Informatik, Halle an der Saale, EU. http://hdl.handle.net/20.500.12708/85377
• Language Operators for Multiset languages and Modal Logic / Freund, R., Kudlek, M., & Flick, N. E. (2012). Language Operators for Multiset languages and Modal Logic. NCMA, Wroclaw, EU. http://hdl.handle.net/20.500.12708/85374
• Membrane Systems With Membrane Labels Changing in Time / Freund, R., & Alhazov, A. (2012). Membrane Systems With Membrane Labels Changing in Time. 10th Brainstoming Week on Membrane Computing, Sevilla, EU. http://hdl.handle.net/20.500.12708/85308
• On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems / Gmeiner, K., Gramlich, B., & Schernhammer, F. (2012). On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. In Proc. 23rd International Conference on Rewriting Techniques and Applications (RTA’12) (pp. 193–208). https://doi.org/10.4230/LIPIcs.RTA.2012.193
• On Modularity of Termination Properties of Rewriting under Strategies / Gramlich, B., & Györgyfalvay, K. (2012). On Modularity of Termination Properties of Rewriting under Strategies. In G. Moser (Ed.), Proc. 12th International Workshop on Termination (pp. 59–63). http://hdl.handle.net/20.500.12708/54553
• Randomized Game Semantics for Semi-fuzzy Quantifiers / Fermüller, C., & Roschger, C. (2012). Randomized Game Semantics for Semi-fuzzy Quantifiers. In Advances in Computational Intelligence. Part IV (pp. 632–641). Springer. http://hdl.handle.net/20.500.12708/54326
• Standard Completeness for Extensions of MTL: An Automated Approach / Baldi, P., Ciabattoni, A., & Spendier, L. (2012). Standard Completeness for Extensions of MTL: An Automated Approach. In Logic, Language, Information and Computation (pp. 154–167). Springer. https://doi.org/10.1007/978-3-642-32621-9_12
• On the Algorithmic Complexity of Vague Descriptions / Fermüller, C. (2012). On the Algorithmic Complexity of Vague Descriptions. In F. Hong (Ed.), Int. Proceedings of Computer Science and Information Technology (pp. 39–44). IACSIT Press. http://hdl.handle.net/20.500.12708/54128
• (Tissue) P Systems with Decaying Objects / Freund, R. (2012). (Tissue) P Systems with Decaying Objects. In E. Csuhaj-Varjú (Ed.), Proceedings of 13th Int.Conference of Membrane Computing (pp. 1–26). http://hdl.handle.net/20.500.12708/54687
• Configuration Repair via Flow Networks / Salzer, G., Feinerer, I., & Sisel, T. (2012). Configuration Repair via Flow Networks. In C. Li & A. Felfernig (Eds.), Lecture Notes in Computer Science (pp. 321–330). https://doi.org/10.1007/978-3-642-34624-8_37
• Realizing Monads in Interaction Nets via Generic Typed Rules / Jiresch, E., & Gramlich, B. (2012). Realizing Monads in Interaction Nets via Generic Typed Rules. In M. Agrawal (Ed.), Proceedings of the 9th annual conference on Theory and Applications of Models of Computation (TAMC 2012) (pp. 509–524). Springer. http://hdl.handle.net/20.500.12708/54248
• Extending Giles's Game for Lukasiewicz Logic to Fuzzy Quantification / Fermüller, C., & Roschger, C. (2012). Extending Giles’s Game for Lukasiewicz Logic to Fuzzy Quantification. In N. Preining & K. Terui (Eds.), Logic, Algebra and Truth Degrees 2012 - Book of Abstracts (pp. 71–75). Jaist. http://hdl.handle.net/20.500.12708/54239
• Towards CERes in intuitionistic logic / Leitsch, A., Reis, G., & Woltzenlogel-Paleo, B. (2012). Towards CERes in intuitionistic logic. In P. Cegielski (Ed.), Computer Science Logic (CSL’12) - 26th International Workshop/21st (pp. 485–499). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. http://hdl.handle.net/20.500.12708/54225
• P Systems with Minimal Left and Right Insertion and Deletion / Freund, R., Rogozhin, Y., & Verlan, S. (2012). P Systems with Minimal Left and Right Insertion and Deletion. In J. Durand-Lose (Ed.), 11th Int. Conference on Unconventional Computation and Natural Computation (pp. 82–93). Springer LNCS. http://hdl.handle.net/20.500.12708/54221
• A formal framework for P systems with Dynamic Structure / Freund, R., & Verlan, S. (2012). A formal framework for P systems with Dynamic Structure. In E. Csuhaj-Varjú (Ed.), 13th International Conference on Membrane Computing (pp. 199–210). MTA Sztaki. http://hdl.handle.net/20.500.12708/54219
• Time-varying sequential P systems / Freund, R., Oswald, M., & Verlan, S. (2012). Time-varying sequential P systems. In E. Csuhaj-Varjú (Ed.), 13th International Conference on Membrane Computing (pp. 99–114). MTA Sztaki. http://hdl.handle.net/20.500.12708/54218
• Asynchronous and Maximally Parallel Deterministic Controlled Non-Cooperative P Systems Characterize NFIN / Freund, R., & Alhazov, A. (2012). Asynchronous and Maximally Parallel Deterministic Controlled Non-Cooperative P Systems Characterize NFIN. In E. Csuhaj-Varjú (Ed.), 13th International Conference on Membrane Computing (pp. 87–98). MTA Sztaki. http://hdl.handle.net/20.500.12708/54217
• P Systems with Minimal Left and Right Insertion and Deletion / Freund, R., & Verlan, S. (2012). P Systems with Minimal Left and Right Insertion and Deletion. In M. Martinez (Ed.), Tenth Brainstorming Week on Membrane Computing (pp. 123–136). Fénix Editora. http://hdl.handle.net/20.500.12708/54215
• A formal framework for P systems with Dynamic Structure / Freund, R., & Verlan, S. (2012). A formal framework for P systems with Dynamic Structure. In M. Martinez (Ed.), Tenth Brainstorming Week on Membrane Computing (pp. 111–122). Fénix Editora. http://hdl.handle.net/20.500.12708/54214
• Asynchronous and Maximally Parallel Deterministic Controlled Non-Cooperative P Systems Characterize NFIN / Freund, R., & Alhazov, A. (2012). Asynchronous and Maximally Parallel Deterministic Controlled Non-Cooperative P Systems Characterize NFIN. In M. Martinez & G. Paun (Eds.), Tenth Brainstorming Week on Membrane Computing (pp. 25–34). Fénix Editora. http://hdl.handle.net/20.500.12708/54213
• Self-Stabilization in Membrane Systems / Freund, R. (2012). Self-Stabilization in Membrane Systems. In G. Paun & A. Paun (Eds.), Tenth Brainstorming Week on Membrane Computing (pp. 1–10). Fénix Editora. http://hdl.handle.net/20.500.12708/54212
• A Note on Minimal Counterexamples to Modularity of Termination / Gramlich, B., & Györgyfalvay, K. (2012). A Note on Minimal Counterexamples to Modularity of Termination (No. E1852-2012–02). http://hdl.handle.net/20.500.12708/37660
• On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems / Gmeiner, K., Gramlich, B., & Schernhammer, F. (2012). On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (No. E1852-2012–01). http://hdl.handle.net/20.500.12708/37659
• System feature description: importing refutations into the GAPT framework / Dunchev, C., Leitsch, A., Libal, T., Riener, M., Rukhaia, M., Weller, D., & Woltzenlogel-Paleo, B. (2012). System feature description: importing refutations into the GAPT framework. In D. Pichardie & T. Weber (Eds.), Proceeding of Proof Exchange for Theorem Proving | Second International Workshop, PxTP 2012 (pp. 51–57). http://hdl.handle.net/20.500.12708/41146
• Automated Reasoning / Automated Reasoning. (2012). In B. Gramlich, D. Miller, & U. Sattler (Eds.), Lecture Notes in Computer Science. Springer-Verlag. https://doi.org/10.1007/978-3-642-31365-3

2011

• Physics and Proof Theory / Paleo, B. W. (2011). Physics and Proof Theory. Applied Mathematics and Computation, 219(1), 45–53. https://doi.org/10.1016/j.amc.2011.06.058
• (Tissue) P systems working in the k - restricted minimally or maximally parallel transition mode / Freund, R., & Verlan, S. (2011). (Tissue) P systems working in the k - restricted minimally or maximally parallel transition mode. Natural Computing, 10(2), 821–833. https://doi.org/10.1007/s11047-010-9215-z
• Preface / Freund, R., & Gheorghe, M. (2011). Preface. International Journal of Foundations of Computer Science, 22(1), 1–6. http://hdl.handle.net/20.500.12708/163359
• First-order satisfiability in Gödel logics: an NP-complete fragment / Ciabattoni, A., Baaz, M., & Preining, N. (2011). First-order satisfiability in Gödel logics: an NP-complete fragment. Theoretical Computer Science, 412(47), 6612–6623. https://doi.org/10.1016/j.tcs.2011.07.015
• Ceres in higher-order logic / Hetzl, S., Leitsch, A., & Weller, D. (2011). Ceres in higher-order logic. Annals of Pure and Applied Logic, 162(12), 1001–1034. https://doi.org/10.1016/j.apal.2011.06.005
• On the non-confluence of cut-elimination / Baaz, M., & Hetzl, S. (2011). On the non-confluence of cut-elimination. Journal of Symbolic Logic, 76(1), 313–340. https://doi.org/10.2178/jsl/1294171002
• MacNeille Comletions of FL-algebras / Ciabattoni, A., Galatos, N., & Terui, K. (2011). MacNeille Comletions of FL-algebras. Algebra Universalis, 66(4), 405–420. https://doi.org/10.1007/s00012-011-0160-1
• Basic contructive connectives, determinism and matric-based semanticst / Ciabattoni, A., & Zamansky, A. (2011). Basic contructive connectives, determinism and matric-based semanticst. TABLEAUX 2011, Bern, Switzerland, Non-EU. http://hdl.handle.net/20.500.12708/119732
• Special Issue Natural Computing: Theory and Applications - Preface / Freund, R., Gheorghe, M., Marcus, S., Mitrana, V., & Pérez-Jiménez, M. (2011). Special Issue Natural Computing: Theory and Applications - Preface. International Journal of Foundations of Computer Science, 22(01), 1–6. https://doi.org/10.1142/s0129054111007770
• On (Un)Soundness of Unraveling Deterministic Conditional Rewrite Systems / Gramlich, B. (2011). On (Un)Soundness of Unraveling Deterministic Conditional Rewrite Systems. Annual Meeting of the IFIP Working Group 1.6 on Term Rewriting (2011), Novi Sad, Serbia, Non-EU. http://hdl.handle.net/20.500.12708/85315
• Quantifier Inference Rules for SMT Proofs / Woltzenlogel-Paleo, B., Fontaine, P., & Deharbe, D. (2011). Quantifier Inference Rules for SMT Proofs. Proof Exchange for Theorem Proving (PxTP), Wroclaw, Poland, EU. http://hdl.handle.net/20.500.12708/85196 / Project: PTACERES
• CERES for Propositional Proof Schemata / Rukhaia, M. (2011). CERES for Propositional Proof Schemata. 2nd Workshop of the Joint Project, Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85420
• A General Framework for Regulated Rewriting Based on the Applicability of Rules / Freund, R., Kogler, M., & Oswald, M. (2011). A General Framework for Regulated Rewriting Based on the Applicability of Rules. Workshop on Computation, Cooperation, and Life, Otava, Teschechien, EU. http://hdl.handle.net/20.500.12708/85306
• Evaluation Games under Vagueness / Roschger, C. (2011). Evaluation Games under Vagueness. Proof and Dialogues (ProDi), Tübingen, Deutschland, EU. http://hdl.handle.net/20.500.12708/85293
• Nonclassical Proofs: theory, applications, and tools / Ciabattoni, A. (2011). Nonclassical Proofs: theory, applications, and tools. 2nd Workshop of the Joint Project “Structural and Computational Proof Theory,” Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85292
• Parallel Dialogue Games and Hypersequents for Intermediate Logics / Fermüller, C. (2011). Parallel Dialogue Games and Hypersequents for Intermediate Logics. Logikseminar des Instituts für Mathematik, Bern, Schweiz, Non-EU. http://hdl.handle.net/20.500.12708/85291
• Systematic (and algebraic) proof theory for substructural logics / Ciabattoni, A. (2011). Systematic (and algebraic) proof theory for substructural logics. Truth, Proof and Consequence. Perspectives on Logic, Pisa, Italien, EU. http://hdl.handle.net/20.500.12708/85290
• Power and Limits of Analytic Calculi: Towards a Systematic Proof Theory for Nonclassical Logics / Ciabattoni, A. (2011). Power and Limits of Analytic Calculi: Towards a Systematic Proof Theory for Nonclassical Logics. Workshop on Logic and Computation, Kanazawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/85263
• A Deep Natural Deduction Calculus / Woltzenlogel-Paleo, B. (2011). A Deep Natural Deduction Calculus. 2nd Workshop Structural Proof Theory, Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85199
• Compression of Propositional Resolution Proofs / Woltzenlogel-Paleo, B. (2011). Compression of Propositional Resolution Proofs. 2nd Workshop Structural Proof Theory, Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85197
• Towards algorithmic cut-introduction / Leitsch, A. (2011). Towards algorithmic cut-introduction. 2nd Workshop of the Joint Project “Structural and Computational Proof Theory,” Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85174
• Logical Models of Reasoning with Vague Information / Fermüller, C. (2011). Logical Models of Reasoning with Vague Information. LogICCC Final Conference, Berlin, Germany, EU. http://hdl.handle.net/20.500.12708/85157
• How to justify your favorite logical system? - A case study / Fermüller, C. (2011). How to justify your favorite logical system? - A case study. Workshop STRUCTURAL, Paris, France, EU. http://hdl.handle.net/20.500.12708/85156
• Vague and Uncertain Entailment - Some Conceptual Clarifications / Fermüller, C. (2011). Vague and Uncertain Entailment - Some Conceptual Clarifications. Workshop: Conditionals, Counterfactuals and Causes in Uncertain Environments, Düsseldorf, Germany, EU. http://hdl.handle.net/20.500.12708/85155
• Parallel Dialogue Games and Hypersequents for Intermediate Logics / Fermüller, C. (2011). Parallel Dialogue Games and Hypersequents for Intermediate Logics. Workshop on Logic and Computation, Kanazawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/85154
• Parallel dialogue games and hypersequents / Fermüller, C. (2011). Parallel dialogue games and hypersequents. Proof and Dialogues (ProDi), Tübingen, Deutschland, EU. http://hdl.handle.net/20.500.12708/85153
• Logic and Vagueness. Report from an Interdisciplinary Battle Ground / Fermüller, C. (2011). Logic and Vagueness. Report from an Interdisciplinary Battle Ground. LogICCC Meets India, New Dehli, Non-EU. http://hdl.handle.net/20.500.12708/85152
• A General Framework for Regulated Rewriting Based on the Applicability of Rules / Freund, R., Kogler, M., & Oswald, M. (2011). A General Framework for Regulated Rewriting Based on the Applicability of Rules. In J. Kelemen & A. Kelemenova (Eds.), Computation, Cooperation, and Life: Essays Dedicated to Gheorghe Paun on the Occasion of His 60th Birthday (pp. 35–53). Springer LNCS. https://doi.org/10.1007/978-3-642-20000-7_5
• Towards a GPU-based Implementation of Interaction Nets / Jiresch, E. (2011). Towards a GPU-based Implementation of Interaction Nets. In A. Gill (Ed.), The 23rd Symposium on Implementation and Application of Functional Languages (IFL 2011) - Draft Proceedings (pp. 1–6). The University of Kansas. http://hdl.handle.net/20.500.12708/54102
• Incremental checking of well-founded recursive specifications modulo axioms / Schernhammer, F., & Meseguer, J. (2011). Incremental checking of well-founded recursive specifications modulo axioms. In P. Schneider-Kamp & M. Hanus (Eds.), Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming - PPDP ’11. ACM Press. https://doi.org/10.1145/2003476.2003481
• Extending the Interaction Nets Calculus by Generic Rules / Jiresch, E. (2011). Extending the Interaction Nets Calculus by Generic Rules. In Central European Functional Programming School - PhD Workshop (p. 3). http://hdl.handle.net/20.500.12708/54100
• Exploiting Symmetry in SMT Problems / Woltzenlogel-Paleo, B., Fontaine, P., Merz, S., & Deharbe, D. (2011). Exploiting Symmetry in SMT Problems. In Lecture Notes in Computer Science (pp. 222–236). Springer LNCS. https://doi.org/10.1007/978-3-642-22438-6_18 / Project: PTACERES
• Compression of Propositional Resolution Proofs via Partial Regularization / Woltzenlogel-Paleo, B., Fontaine, P., & Merz, S. (2011). Compression of Propositional Resolution Proofs via Partial Regularization. In Lecture Notes in Computer Science (pp. 237–251). Springer. https://doi.org/10.1007/978-3-642-22438-6_19
• Reducing Multiplicities in Class Diagrams / Feinerer, I., Salzer, G., & Sisel, T. (2011). Reducing Multiplicities in Class Diagrams. In Model Driven Engineering Languages and Systems (pp. 379–393). https://doi.org/10.1007/978-3-642-24485-8_27
• A General Framework for Regulated Rewriting / Freund, R. (2011). A General Framework for Regulated Rewriting. In J. Dassow & B. Truthe (Eds.), 21.Theorietag - Automaten und Formale Sprachen (pp. 37–41). Otto von Guericke Universität Magdeburg, Fakultät für Informatik. http://hdl.handle.net/20.500.12708/54099
• A Game Based Approach to Quantification in Lukasiewicz Logic / Fermüller, C. (2011). A Game Based Approach to Quantification in Lukasiewicz Logic. In P. Cintula & S. Ju (Eds.), Non-classical Modal and Predicate Logics 2011 (pp. 58–63). F-Solutions. http://hdl.handle.net/20.500.12708/54041
• Realizing Monads in Interaction Nets via Generic Typed Rules / Jiresch, E., & Gramlich, B. (2011). Realizing Monads in Interaction Nets via Generic Typed Rules (No. E1852-2011–0). http://hdl.handle.net/20.500.12708/37348
• Basic constructive connectives, determinism and matrix-based semantics / Ciabattoni, A., Lahav, O., & Zamansky, A. (2011). Basic constructive connectives, determinism and matrix-based semantics. In Lecture Notes in Computer Science. Springer Verlag. https://doi.org/10.1007/978-3-642-22119-4
• Comparing Context Updates in Delineation and Scale Based Models of Vagueness / Roschger, C. (2011). Comparing Context Updates in Delineation and Scale Based Models of Vagueness. In Understanding Vagueness - Logical, Philosophical and Linguistic Perspectives (pp. 231–249). College Publications. http://hdl.handle.net/20.500.12708/27522
• A Conversation About Fuzzy Logic and Vagueness / Fermüller, C., & Hajek, P. (2011). A Conversation About Fuzzy Logic and Vagueness. In P. Cintula & C. Fermüller (Eds.), Understanding Vagueness. Logical, Philosophical and Linguistic Perspectives (pp. 405–416). College Publications. http://hdl.handle.net/20.500.12708/27521
• Bildung 2.0 / Freund, R., & Taschner, R. (2011). Bildung 2.0. In Best Spirit: Best Practice (pp. 109–113). Braumüller. http://hdl.handle.net/20.500.12708/27529
• Comments on Vagueness in Language: The Case Against Fuzzy Logic Revisited by Uli Sauerland / Fermüller, C. (2011). Comments on Vagueness in Language: The Case Against Fuzzy Logic Revisited by Uli Sauerland. In P. Cintula & C. Fermüller (Eds.), Understanding Vagueness. Logical, Philosophical and Linguistic Perspectives (pp. 199–202). College Publications. http://hdl.handle.net/20.500.12708/27520
• Understanding Vagueness. Logical, Philosophical and Linguistic Perspectives / Cintula, P., Fermüller, C., Godo, L., & Hajek, P. (Eds.). (2011). Understanding Vagueness. Logical, Philosophical and Linguistic Perspectives. College Publications. http://hdl.handle.net/20.500.12708/23457
• Methods of Cut-Elimination / Baaz, M., & Leitsch, A. (2011). Methods of Cut-Elimination. Springer Verlag. https://doi.org/10.1007/978-94-007-0320-9

2010

• The Helly Property and Satisfiability of Boolean Formulas Defined on Set Families / Chepoi, V., Creignou, N., Hermann, M., & Salzer, G. (2010). The Helly Property and Satisfiability of Boolean Formulas Defined on Set Families. European Journal of Combinatorics, 31(2), 502–516. https://doi.org/10.1016/j.ejc.2009.03.022
• Computing Product Configurations via UML and Integer Linear Programming / Falkner, A., Feinerer, I., Salzer, G., & Schenner, G. (2010). Computing Product Configurations via UML and Integer Linear Programming. International Journal of Mass Customisation, 3(4), 351. https://doi.org/10.1504/ijmassc.2010.037650
• Realizing Impure Functions in Interaction Nets / Jiresch, E. (2010). Realizing Impure Functions in Interaction Nets. Electronic Communications of the EASST, 38, 1–17. http://hdl.handle.net/20.500.12708/168248
• Termination of Rewriting with and Automated Synthesis of Forbidden Patterns / Gramlich, B., & Schernhammer, F. (2010). Termination of Rewriting with and Automated Synthesis of Forbidden Patterns. Electronic Proceedings in Theoretical Computer Science, 44, 35–50. http://hdl.handle.net/20.500.12708/168103
• Extending Context-Sensitivity in Term Rewriting / Gramlich, B., & Schernhammer, F. (2010). Extending Context-Sensitivity in Term Rewriting. Electronic Proceedings in Theoretical Computer Science, 15, 56–68. https://doi.org/10.4204/eptcs.15.5
• Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems / Schernhammer, F., & Gramlich, B. (2010). Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems. The Journal of Logic and Algebraic Programming, 79(7), 659–688. https://doi.org/10.1016/j.jlap.2009.08.001
• On-Demand Strategy Annotations Revisited: An Improved On-Demand Evaluation Strategy / Alpuente, M., Escobar, S., Gramlich, B., & Lucas, S. (2010). On-Demand Strategy Annotations Revisited: An Improved On-Demand Evaluation Strategy. Theoretical Computer Science, 411(2), 504–541. https://doi.org/10.1016/j.tcs.2009.09.016
• Algebaic and proof-theoretic characterizations of truth stressers for MTL and its extensions / Ciabattoni, A., Metcalfe, G., & Montagna, F. (2010). Algebaic and proof-theoretic characterizations of truth stressers for MTL and its extensions. Fuzzy Sets and Systems, 161 (3), 369–389. http://hdl.handle.net/20.500.12708/168054
• Review: Vagueness and Degrees of Truth / Fermüller, C. (2010). Review: Vagueness and Degrees of Truth. Australasian Journal of Logic, 9, 1–9. http://hdl.handle.net/20.500.12708/167396
• The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach / Klinov, P., Parsia, B., & Picado Muino, D. (2010). The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach. In C. Fermüller & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning : 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings (pp. 432–446). Springer Verlag. https://doi.org/10.1007/978-3-642-16242-8_31
• Generalizing Context-Sensitivity in Term Rewriting / Schernhammer, F. (2010). Generalizing Context-Sensitivity in Term Rewriting. 3rd Austria-Japan Summer Workshop on Term Rewriting, Obergurgl, Austria. http://hdl.handle.net/20.500.12708/85094
• Conditional via Unconditional Rewriting - Some Recent Developments / Gramlich, B. (2010). Conditional via Unconditional Rewriting - Some Recent Developments. Annual Meeting of the IFIP-WG 1.6 - Term Rewriting, Valencia, Spain, Austria. http://hdl.handle.net/20.500.12708/85087
• Making it More Explicit: Brandom's Inferentialist Pragmatism and Logical Dialogue Games / Slivovsky, F. (2010). Making it More Explicit: Brandom’s Inferentialist Pragmatism and Logical Dialogue Games. Logica 2010, Hejnice, Tschechien, EU. http://hdl.handle.net/20.500.12708/85108
• A Generalization of Giles's Game / Fermüller, C. (2010). A Generalization of Giles’s Game. Algebra and Substructural Logics - AsubL4, Kanazawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/85107
• Relations between Medieval and Modern Logical Dialogue Games / Fermüller, C. (2010). Relations between Medieval and Modern Logical Dialogue Games. International Medieval Congress 2010, Leeds, UK, EU. http://hdl.handle.net/20.500.12708/85106
• Is there a role for fuzzy logic in linguistics? / Fermüller, C. (2010). Is there a role for fuzzy logic in linguistics? Workshop on “Vague Quantities and Vague Quantifiers (VQ2),” Berlin, EU. http://hdl.handle.net/20.500.12708/85105
• On Dialogue Games for Multi-Valued Logics / Fermüller, C. (2010). On Dialogue Games for Multi-Valued Logics. Logic, Algebra and Truth Degrees - LATD 2010, Prag, Tschechische Republik, EU. http://hdl.handle.net/20.500.12708/85104
• Formal Rationality Principles in Logical Dialogue Games / Fermüller, C. (2010). Formal Rationality Principles in Logical Dialogue Games. Logic, Reasoning and Rationality - LRR10, Gent, Belgien, EU. http://hdl.handle.net/20.500.12708/85103
• On the complexity of proof deskolemization / Baaz, M., Hetzl, S., & Weller, D. (2010). On the complexity of proof deskolemization. Collegium Locicum 2010: Proofs and Structures, Paris, EU. http://hdl.handle.net/20.500.12708/85099
• CERES in higher-order-logic / Hetzl, S., Leitsch, A., & Weller, D. (2010). CERES in higher-order-logic. Workshop on Classical Logic and Computation (CL&C’10), Brünn, EU. http://hdl.handle.net/20.500.12708/85096
• From Linguistic Models of Vagueness to t-Norm Based Fuzzy Logic / Roschger, C., & Fermüller, C. (2010). From Linguistic Models of Vagueness to t-Norm Based Fuzzy Logic. ManyVal 2010, Varese, Italien, EU. http://hdl.handle.net/20.500.12708/85095
• Recent Developments in Conditional via Unconditional Rewriting / Gramlich, B. (2010). Recent Developments in Conditional via Unconditional Rewriting. 3rd Austria-Japan Summer Workshop on Term Rewriting, Obergurgl, Austria. http://hdl.handle.net/20.500.12708/85093
• Contextual models of vagueness and vague quantifiers / Roschger, C. (2010). Contextual models of vagueness and vague quantifiers. Workshop on “Vague Quantities and Vague Quantifiers (VQ2),” Berlin, EU. http://hdl.handle.net/20.500.12708/85085
• Bridges Between Fuzzy Logic and Linguistic Models of Vagueness / Roschger, C. (2010). Bridges Between Fuzzy Logic and Linguistic Models of Vagueness. Advances in Knowledge-Based Technologies, Hagenberg, Austria. http://hdl.handle.net/20.500.12708/85086
• Systematic (and algebraic) proof theory for substructural logics / Ciabattoni, A. (2010). Systematic (and algebraic) proof theory for substructural logics. International Workshop PCC-Proof, Computation, Complexity, Bern, Non-EU. http://hdl.handle.net/20.500.12708/85074
• CERES in higher-order-logic / Leitsch, A. (2010). CERES in higher-order-logic. Collegium Locicum 2010: Proofs and Structures, Paris, EU. http://hdl.handle.net/20.500.12708/85073
• Evaluation Games for Shapiro's Logic of Vagueness in Context / Roschger, C. (2010). Evaluation Games for Shapiro’s Logic of Vagueness in Context. In The Logica Yearbook 2010. Logica, Hejnice, Czech Republic, EU. College Publications. http://hdl.handle.net/20.500.12708/54092
• Outermost Termination via Contextual Dependency Pairs / Gramlich, B., & Schernhammer, F. (2010). Outermost Termination via Contextual Dependency Pairs. In P. Schneider-Kamp (Ed.), Proc. 11th International Workshop on Termination (WST 2010) (pp. 13–17). http://hdl.handle.net/20.500.12708/53586
• On (Un)Soundness of Unravelings / Gmeiner, K., Gramlich, B., & Schernhammer, F. (2010). On (Un)Soundness of Unravelings. In C. Lynch (Ed.), Proceedings of the 21st International Conference on Rewriting Techniques and Applications (pp. 119–134). LIPIcs - Leibniz International Proceedings in Informatics / Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.RTA.2010.119
• Termination of Rewriting with and Automated Synthesis of Forbidden Patterns / Gramlich, B., & Schernhammer, F. (2010). Termination of Rewriting with and Automated Synthesis of Forbidden Patterns. In H. Kirchner & C. Munoz (Eds.), Prelim. Proc. 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010) (pp. 13–17). http://hdl.handle.net/20.500.12708/53584
• Extensions for Interaction Nets / Jiresch, E., & Gramlich, B. (2010). Extensions for Interaction Nets. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 295–296). http://hdl.handle.net/20.500.12708/53583
• Transformations of Conditional Term Rewrite Systems / Gmeiner, K., & Gramlich, B. (2010). Transformations of Conditional Term Rewrite Systems. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 155–156). http://hdl.handle.net/20.500.12708/53582
• Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough / Freund, R., & Kogler, M. (2010). Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough. In Proceedings of the Eleventh International Conference on Membrane Computing (pp. 193–205). Pro Business GmbH. http://hdl.handle.net/20.500.12708/53567
• System Description: The Proof Transformation System CERES / Leitsch, A., Dunchev, T., Weller, D., Woltzenlogel-Paleo, B., & Libal, T. (2010). System Description: The Proof Transformation System CERES. In J. Giesl & R. Hähnle (Eds.), IJCAR 2010 (pp. 427–433). Springer, LNAI. http://hdl.handle.net/20.500.12708/53564
• Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough / Freund, R., & Kogler, M. (2010). Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough. In M. Gheorghe & G. Paun (Eds.), 11th International Conference, CMC2010 - Membrane Computing (pp. 198–208). Springer LNCS. http://hdl.handle.net/20.500.12708/52559
• On (Un)Soundness of Unravelings / Gmeiner, K., Gramlich, B., & Schernhammer, F. (2010). On (Un)Soundness of Unravelings (Technical Report E1852-2010-01). http://hdl.handle.net/20.500.12708/36767
• A resolution mechanism for Prenex Gödel logic / Baaz, M., & Fermüller, C. (2010). A resolution mechanism for Prenex Gödel logic. In A. Dawar & H. Veith (Eds.), Computer Science Logic (LNCS 6247/2010) (pp. 67–79). Springer. http://hdl.handle.net/20.500.12708/40997
• Catalytic P Systems / Freund, R., & Paun, A. (2010). Catalytic P Systems. In G. Paun, G. Rozenberg, & A. Salomaa (Eds.), The Oxford Handbook of Membrane Computing (pp. 83–118). Oxford University Press. http://hdl.handle.net/20.500.12708/27084
• Fast Cut-Elimination by CERES / Leitsch, A., & Baaz, M. (2010). Fast Cut-Elimination by CERES. In S. Feferman & W. Sieg (Eds.), Proofs, Categories and Computations (pp. 31–49). College Publications. http://hdl.handle.net/20.500.12708/27080
• Fast cut-elimination by CERES / Baaz, M., & Leitsch, A. (2010). Fast cut-elimination by CERES. In S. Feferman & W. Sieg (Eds.), Proofs, Categories and Computations, Essays in Honor of Grigori Mints (pp. 31–48). College Publications (Kings College). http://hdl.handle.net/20.500.12708/27039
• Some Critical Remarks on Incompatibility Semantics / Fermüller, C. (2010). Some Critical Remarks on Incompatibility Semantics. In M. Pelis (Ed.), The Logica Yearbook 2008 (pp. 81–96). College Publications. http://hdl.handle.net/20.500.12708/27029
• On Giles style dialoques games and hypersequent systems / Fermüller, C. (2010). On Giles style dialoques games and hypersequent systems. In H. Hosni & F. Montagna (Eds.), Probability, Uncertainty and Rationality (pp. 169–197). Editioni Della Normale. http://hdl.handle.net/20.500.12708/26788 / Project: LogICCC - fuzzy logic
• Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings LPAR-17 / Fermüller, C., & Voronkov, A. (Eds.). (2010). Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings LPAR-17. Springer. http://hdl.handle.net/20.500.12708/23275
• Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010) / Bordihn, H., & Freund, R. (Eds.). (2010). Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010). Österreichische Computer Gesellschaft. http://hdl.handle.net/20.500.12708/23260

2009

• 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
• 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
• 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
• 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
• 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
• 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
• 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, Pontignano, Italy, EU. http://hdl.handle.net/20.500.12708/84912
• 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
• 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
• A Clausal Approach to Proof Analysis in Second-Order Logic / Leitsch, A., Hetzl, S., Weller, D., & Woltzenlogel-Paleo, B. (2009). A Clausal Approach to Proof Analysis in Second-Order Logic. In E. Artemov & A. Nerode (Eds.), Lecture Notes in Computer Science, 5407 (pp. 214–229). Springer LNCS. http://hdl.handle.net/20.500.12708/26606
• 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
• 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

2008

• A way to interpret Lukasiewicz Logic and Basic Logic / Vetterlein, T. (2008). A way to interpret Lukasiewicz Logic and Basic Logic. Studia Logica, 90, 407–423. http://hdl.handle.net/20.500.12708/170246 / Project: Dialogspielsemantik
• Dialoque Games for Many-Valued Logics - an Overwiew / Fermüller, C. G. (2008). Dialoque Games for Many-Valued Logics - an Overwiew. Studia Logica, 90(1), 43–68. https://doi.org/10.1007/s11225-008-9143-4
• How to Acknowledge Hypercomputation / Leitsch, A., Schachner, G., & Svozil, K. (2008). How to Acknowledge Hypercomputation. Complex Systems, 18, 131–143. http://hdl.handle.net/20.500.12708/170847
• Towards an algorithmic construction of cut-elimination procedures / CIABATTONI, A., & LEITSCH, A. (2008). Towards an algorithmic construction of cut-elimination procedures. Mathematical Structures in Computer Science, 18(1), 81–105. https://doi.org/10.1017/s0960129507006573
• Regular left-continuous t-norms / Vetterlein, T. (2008). Regular left-continuous t-norms. Semigroup Forum, 77, 339–379. http://hdl.handle.net/20.500.12708/170245 / Project: Dialogspielsemantik
• Regular ω-Languages defined by Extended Spiking Neural P Systems / Freund, R., & Oswald, M. (2008). Regular ω-Languages defined by Extended Spiking Neural P Systems. Fundamenta Informaticae, 83(1–2), 65–73. http://hdl.handle.net/20.500.12708/170200
• Analytic calculi for logics of ordinal multiples of standard t-norms / Vetterlein, T. (2008). Analytic calculi for logics of ordinal multiples of standard t-norms. Journal of Logic and Computation, 18, 35–57. http://hdl.handle.net/20.500.12708/169721 / Project: Dialogspielsemantik
• Weak effect algebras / Vetterlein, T. (2008). Weak effect algebras. Algebra Universalis, 58, 129–143. http://hdl.handle.net/20.500.12708/169722 / Project: Dialogspielsemantik
• Fuzzy logic as a logic of the expressive strength of information / Vetterlein, T. (2008). Fuzzy logic as a logic of the expressive strength of information. Soft Computing, 12, 479–485. http://hdl.handle.net/20.500.12708/169720 / Project: Dialogspielsemantik
• Residuated lattices arising from equivalence relations on Boolean and Brouwerian algebras / Vetterlein, T. (2008). Residuated lattices arising from equivalence relations on Boolean and Brouwerian algebras. Mathematical Logic Quarterly, 54, 325–342. http://hdl.handle.net/20.500.12708/169719 / Project: Dialogspielsemantik
• Termination of Lazy Rewriting Revisited / Schernhammer, F., & Gramlich, B. (2008). Termination of Lazy Rewriting Revisited. Electronic Notes in Theoretical Computer Science, 204, 35–51. https://doi.org/10.1016/j.entcs.2008.03.052
• CD Grammar Systems with Regular Start Conditions / Freund, R., & Oswald, M. (2008). CD Grammar Systems with Regular Start Conditions. International Journal of Foundations of Computer Science, 19(4), 767–779. http://hdl.handle.net/20.500.12708/170716
• Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking / Freund, R., Oswald, M., & Ionescu, M. (2008). Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking. International Journal of Foundations of Computer Science, 19(5), 1223–1234. http://hdl.handle.net/20.500.12708/170707
• Efficient Algorithms For Description Problems Over Finite Totally Ordered Domains / Salzer, G., Hermann, M., Gil, A., & Zanuttini, B. (2008). Efficient Algorithms For Description Problems Over Finite Totally Ordered Domains. SIAM Journal on Computing, 38(3), 922–945. https://doi.org/10.1137/050635900
• CERES: An analysis of Fürstenberg's proof of the infinity of primes / Baaz, M., Hetzl, S., Leitsch, A., Richter, C., & Spohr, H. (2008). CERES: An analysis of Fürstenberg’s proof of the infinity of primes. Theoretical Computer Science, 403(2–3), 160–175. https://doi.org/10.1016/j.tcs.2008.02.043
• Complexity of Clausal Constraints Over Chains / Creignou, N., Hermann, M., Krokhin, A., & Salzer, G. (2008). Complexity of Clausal Constraints Over Chains. Theory of Computing Systems, 42(2), 239–255. https://doi.org/10.1007/s00224-007-9043-4
• Cut-elimination / Baaz, M., & Hetzl, S. (2008). Cut-elimination. Third Vienna Tbilisi Summer School in Logic and Language, Tbilisi, Georgia, Non-EU. http://hdl.handle.net/20.500.12708/118581
• Bio-Inspired Computing: DNA Computing and Membrane Computing / Freund, R. (2008). Bio-Inspired Computing: DNA Computing and Membrane Computing. BIRD’08 2nd International Conference on Bioinformatics Research and Development, Wien, Austria. http://hdl.handle.net/20.500.12708/84837
• Membrane Systems / Freund, R. (2008). Membrane Systems. The 12th World Multi-Conference on Systemics, Cybernetics and Informatics: WMSCI 2008, Orlando, Florida, Non-EU. http://hdl.handle.net/20.500.12708/84836
• An Integrating View on DNA Computing and Membrane Computing / Freund, R. (2008). An Integrating View on DNA Computing and Membrane Computing. 10th WSEAS Int. Conf. on MATHEMATICAL METHODS AND COMPUTATIONAL TECHNIQUES IN ELECTRICAL ENGINEERING (MMACTEE ’08), Sofia, Bulgaria, EU. http://hdl.handle.net/20.500.12708/84835
• Brandom's 'incompatibilty semantics' / Fermüller, C. (2008). Brandom’s “incompatibilty semantics.” Kolloquium Institut Wiener Kreis (IVC), Wien, Austria. http://hdl.handle.net/20.500.12708/84827
• Algorithms for Herbrand Sequent Extraction / Woltzenlogel-Paleo, B. (2008). Algorithms for Herbrand Sequent Extraction. Deep Inference, its Algebra, Geometry and Syntax, Nancy, Frankreich, EU. http://hdl.handle.net/20.500.12708/84793
• CERES: Analysis of the fifth Proof of the Infinity of Primes / Leitsch, A. (2008). CERES: Analysis of the fifth Proof of the Infinity of Primes. Non-classical Logics: from Foundations to Applications, Pisa, EU. http://hdl.handle.net/20.500.12708/84789
• Dialogue games as foundations of non-classical logics / Fermüller, C. (2008). Dialogue games as foundations of non-classical logics. Non-classical Logics: from Foundations to Applications, Pisa, EU. http://hdl.handle.net/20.500.12708/84753
• Truth Value Intervals, Bets, and Dialogue Games / Fermüller, C. (2008). Truth Value Intervals, Bets, and Dialogue Games. Logica 2008, Hejnice, EU. http://hdl.handle.net/20.500.12708/84752
• Truth Value Intervals, Bets, and Dialogue Games / Fermüller, C. (2008). Truth Value Intervals, Bets, and Dialogue Games. LOFT 2008, 8th Conference on Logic and the Foundations of Game and Decision Theory, Amsterdam, EU. http://hdl.handle.net/20.500.12708/84751
• On the interpretation of t-norm based fuzzy logics / Fermüller, C. (2008). On the interpretation of t-norm based fuzzy logics. LATD 2008 - Logic, Algebra and Truth Degrees 2008, Siena, EU. http://hdl.handle.net/20.500.12708/84750
• LoMoReVI -- Logical Models of Reasoning with Vague Information / Fermüller, C. (2008). LoMoReVI -- Logical Models of Reasoning with Vague Information. LogICCC Launch Conference of the European Science Foundation, Prag, EU. http://hdl.handle.net/20.500.12708/84749
• Membrane Computing and Brain Modelling / Oswald, M. (2008). Membrane Computing and Brain Modelling. Intern. Symp. on Artificial Life and Robotics (AROB), Beppu, Non-EU. http://hdl.handle.net/20.500.12708/84738
• P Systems Working in the 1-restricted Minimally Parallel Derivation Mode / Freund, R. (2008). P Systems Working in the 1-restricted Minimally Parallel Derivation Mode. Workshop on Language-Theoretic Models of Decentralized and Distributed Systems, Opava, EU. http://hdl.handle.net/20.500.12708/84737
• Variants of Halting in P Systems / Oswald, M. (2008). Variants of Halting in P Systems. Workshop on Language-Theoretic Models of Decentralized and Distributed Systems, Opava, EU. http://hdl.handle.net/20.500.12708/84736
• Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics / Salzer, G., Chepoi, V., Creignou, N., & Hermann, M. (2008). Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. In G. Dueck (Ed.), 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE Computer Society. https://doi.org/10.1109/ismvl.2008.41
• Solving Practical Configuration Problems using UML / Falkner, A., Feinerer, I., Salzer, G., & Schenner, G. (2008). Solving Practical Configuration Problems using UML. In Proceedings of ECAI 2008 Workshop on Configuration Systems (p. 6). http://hdl.handle.net/20.500.12708/52363
• Transformations of Conditional Rewrite Systems Revisited / Gmeiner, K., & Gramlich, B. (2008). Transformations of Conditional Rewrite Systems Revisited. In Prelim. Proc. 19th International Workshop on Algebraic Development Techniques (WADT 2008) (pp. 64–66). http://hdl.handle.net/20.500.12708/52309
• On Operational Termination of Deterministic Conditional Rewrite Systems / Schernhammer, F., & Gramlich, B. (2008). On Operational Termination of Deterministic Conditional Rewrite Systems. In Proc. 20th Nordic Workshop on Programming Theory - NWPT 2008 (Extended Abstracts) (pp. 84–86). Institute of Cybernetics, Tallinn University of Technology. http://hdl.handle.net/20.500.12708/52308
• (Tissue) P systems using non-cooperative rules without halting conditions / Beyreder, M., & Freund, R. (2008). (Tissue) P systems using non-cooperative rules without halting conditions. In P. Frisco, D. W. Corne, & G. Paun (Eds.), Proceedings of the Ninth Workshop on Membrane Computing (pp. 85–94). http://hdl.handle.net/20.500.12708/52550
• Extended Spiking neural P systems - variants for modeling the brain / Binder, A., Freund, R., & Oswald, M. (2008). Extended Spiking neural P systems - variants for modeling the brain. In M. Sugisaka & H. Tanaka (Eds.), Proc.13th International Symposium on Artificial Life and Robotics AROB13th 2008 (pp. 520–524). http://hdl.handle.net/20.500.12708/52549
• (Tissue) P Systems Working in the k-Restricted Minimally Parallel Mode / Freund, R., & Verlan, S. (2008). (Tissue) P Systems Working in the k-Restricted Minimally Parallel Mode. In R. Freund, M. Oswald, E. Csuhaj-Varjú, & K. Salomaa (Eds.), International Workshop on Computing with Biomolecules (pp. 43–53). Oesterreichische Computer Gesellschaft. http://hdl.handle.net/20.500.12708/52400
• (Tissue) P Systems Working in the k-Restricted Minimally Parallel Mode / Freund, R., & Verlan, S. (2008). (Tissue) P Systems Working in the k-Restricted Minimally Parallel Mode. In M. Holzer, M. Kutrib, & A. Malcher (Eds.), 18.Theorietag - Automaten und Formale Sprachen (pp. 49–55). Justus-Liebig Verlag. http://hdl.handle.net/20.500.12708/52399
• Herbrand Sequent Extraction / Leitsch, A., Hetzl, S., Weller, D., & Woltzenlogel-Paleo, B. (2008). Herbrand Sequent Extraction. In S. Autexier (Ed.), AISC/Calculemus/MKM 2008 (pp. 462–477). Springer. http://hdl.handle.net/20.500.12708/52369
• Proof Analysis with HLK, CERES and ProofTool: Current Status and Future Directions / Leitsch, A., Hetzl, S., Weller, D., & Woltzenlogel-Paleo, B. (2008). Proof Analysis with HLK, CERES and ProofTool: Current Status and Future Directions. In G. Sutcliffe, S. Colton, & S. Schulz (Eds.), Proceedings of the CICIM Workshops on ESARM-08 (pp. 23–41). CEUR-WS.org. http://hdl.handle.net/20.500.12708/52368
• Transforming and Analyzing Proofs in the CERES-system / Leitsch, A., Hetzl, S., Weller, D., & Woltzenlogel-Paleo, B. (2008). Transforming and Analyzing Proofs in the CERES-system. In P. Rudnicki & G. Sutcliffe (Eds.), Proceedings of the LPAR 2008 Workshops (pp. 77–91). CEUR-WS.org. http://hdl.handle.net/20.500.12708/52364
• Cut elimination for first order Gödel logic by hyperclause resolution / Baaz, M., Ciabattoni, A., & Fermüller, C. (2008). Cut elimination for first order Gödel logic by hyperclause resolution. In I. Cervesato, H. Veith, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LNAI 5330) (pp. 451–466). Springer. http://hdl.handle.net/20.500.12708/40803
• Unconventional Computing / Unconventional Computing. (2008). In C. S. Calude, J. F. Costa, R. Freund, M. Oswald, & G. Rozenberg (Eds.), Lecture Notes in Computer Science. Springer LNCS. https://doi.org/10.1007/978-3-540-85194-3

2007

• Partial Halting in P Systems Using Membrane Rules with Permitting Contexts / Alhazov, A., Freund, R., Oswald, M., & Verlan, S. (2007). Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. In J. Durand-Lose & M. Margenstern (Eds.), Machines, Computations, and Universality (pp. 110–121). LNCS, Springer. http://hdl.handle.net/20.500.12708/176630
• A Framework for Timed Concurrent Constraint Programming with External Functions / Alpuente, M., Gramlich, B., & Villanueva, A. (2007). A Framework for Timed Concurrent Constraint Programming with External Functions. Electronic Notes in Theoretical Computer Science, 188, 143–155. https://doi.org/10.1016/j.entcs.2007.05.043
• Model Representation over Finite and Infinite Signatures / Fermüller, C., & Pichler, R. (2007). Model Representation over Finite and Infinite Signatures. Journal of Logic and Computation, 17(3), 453–477. https://doi.org/10.1093/logcom/exm008
• Monadic fragments of Gödel logics: decidability and undecidability / Baaz, M., Ciabattoni, A., & Fermüller, C. (2007). Monadic fragments of Gödel logics: decidability and undecidability. Lecture Notes in Computer Science, 4790, 77–91. http://hdl.handle.net/20.500.12708/168724
• Refining the Nonterminal Complexity of Graph-controlled, Programmed and Matrix Grammars / Fernau, H., Freund, R., Oswald, M., & Reinhardt, K. (2007). Refining the Nonterminal Complexity of Graph-controlled, Programmed and Matrix Grammars. Journal of Automata, Languages and Combinatorics, 12(1/2), 117–138. http://hdl.handle.net/20.500.12708/170715
• Cellular Automata and Parallel Array Systems / Freund, R., & Tafill, F. (2007). Cellular Automata and Parallel Array Systems. Fundamenta Informaticae, 78(3), 311–327. http://hdl.handle.net/20.500.12708/169696
• Tissue P Systems and (MEM) Brane Systems with Mate and Drip Operations Working on Strings / Freund, R., & Oswald, M. (2007). Tissue P Systems and (MEM) Brane Systems with Mate and Drip Operations Working on Strings. Electronic Notes in Theoretical Computer Science (ENTCS), 171, 105–115. http://hdl.handle.net/20.500.12708/169695
• Multiset random context grammars, checkers, and transducers / Cavaliere, M., Freund, R., Oswald, M., & Sburlan, D. (2007). Multiset random context grammars, checkers, and transducers. Theoretical Computer Science, 372, 136–151. http://hdl.handle.net/20.500.12708/169694
• Partial Halting in P Systems / Freund, R., & Oswald, M. (2007). Partial Halting in P Systems. International Journal of Foundations of Computer Science, 18(6), 1215–1225. http://hdl.handle.net/20.500.12708/169693
• Independent agents in a globalized world modelled by tissue P systems / Oswald, M. (2007). Independent agents in a globalized world modelled by tissue P systems. Artificial Life and Robotics, 11(2), 171–174. http://hdl.handle.net/20.500.12708/169690
• Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode / Freund, R., & Oswald, M. (2007). Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. Fundamenta Informaticae, 76(3), 305–323. http://hdl.handle.net/20.500.12708/169689
• Monadic Fragments of Gödel Logics: Decidability and Undecidability Results / Baaz, M., Ciabattoni, A., & Fermüller, C. (2007). Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. In N. Dershowitz & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LNAI 4790) (pp. 77–91). Springer. https://doi.org/10.1007/978-3-540-75560-9_8
• Monadic fragments of Gödel logics: decidability and undecability results / Baaz, M., Ciabattoni, A., & Fermüller, C. (2007). Monadic fragments of Gödel logics: decidability and undecability results. 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning 2007, Erivan, Armenia, Non-EU. http://hdl.handle.net/20.500.12708/118584
• CERES: An analysis of Fürstenberg's proof of the infinity of primes / Leitsch, A. (2007). CERES: An analysis of Fürstenberg’s proof of the infinity of primes. Moscow-Vienna Workshop on Logic and Computation, Moscow, Austria. http://hdl.handle.net/20.500.12708/84650
• Logische Dialogspiele als formale Semantik / Fermüller, C. (2007). Logische Dialogspiele als formale Semantik. Institute Vienna Circle, Wien, Austria. http://hdl.handle.net/20.500.12708/84623
• Games in logic and logic in games / Fermüller, C. (2007). Games in logic and logic in games. Institute Vienna Circle, Wien, Austria. http://hdl.handle.net/20.500.12708/84622
• Some Remarks on Imprecise Truth Values / Fermüller, C. (2007). Some Remarks on Imprecise Truth Values. “Two and beyond”, KGS Workshop on Fuzzy Logic and Proof Theory, Barcelona, Spain, EU. http://hdl.handle.net/20.500.12708/84621
• Interpreting interval based fuzzy logics / Fermüller, C. (2007). Interpreting interval based fuzzy logics. Analytic Proof Systems 3, 3rd International Workshop on Analytic Proof Systems, Yerevan, Armenia, Non-EU. http://hdl.handle.net/20.500.12708/84620
• Fuzzy Logic and Theories of Vagueness / Fermüller, C. (2007). Fuzzy Logic and Theories of Vagueness. Fuzzy Logic Seminar of the CAS, Institute of Computer Science, Prague, Czech Republic, EU. http://hdl.handle.net/20.500.12708/84619
• Dialogue games as foundations of fuzzy logics / Fermüller, C. (2007). Dialogue games as foundations of fuzzy logics. 3rd Moscow-Vienna Workshop on Logic and Computation, Moskow, Austria. http://hdl.handle.net/20.500.12708/84618
• Vagueness as semantic indeterminacy: three bridges between probability and fuzzy logic / Fermüller, C. (2007). Vagueness as semantic indeterminacy: three bridges between probability and fuzzy logic. Fuzzy Sets, Probability, and Statistics -- Gaps and Bridges, 28th Linz Seminar on Fuzzy Sets, Linz, Austria. http://hdl.handle.net/20.500.12708/84611
• On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems / Schernhammer, F., & Gramlich, B. (2007). On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems. In D. Hofbauer & A. Serebrenik (Eds.), Proc. 9th International Workshop on Termination (pp. 82–85). http://hdl.handle.net/20.500.12708/51994
• Termination of Lazy Rewriting Revisited / Schernhammer, F., & Gramlich, B. (2007). Termination of Lazy Rewriting Revisited. In J. Giesl (Ed.), Proc. 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007) (pp. 28–42). http://hdl.handle.net/20.500.12708/51993
• Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints / Salzer, G., & Feinerer, I. (2007). Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints. In J. He & J. Sanders (Eds.), Proceedings 1st IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering (pp. 411–420). http://hdl.handle.net/20.500.12708/52120
• Symport/Antiport Systems with Partial Halting / Freund, R., & Oswald, M. (2007). Symport/Antiport Systems with Partial Halting. In M. Droste & M. Lohrey (Eds.), 17.Theorietag Automaten und Formale Sprachen (pp. 50–54). http://hdl.handle.net/20.500.12708/52095
• Extended spiking neural P systems with spikes of limited lifetime / Freund, R., Ionescu, M., & Oswald, M. (2007). Extended spiking neural P systems with spikes of limited lifetime. In M. Droste & M. Lohrey (Eds.), 17.Theorietag Automaten und Formale Sprachen (pp. 45–49). http://hdl.handle.net/20.500.12708/52094
• Modelling Logical Gates with ESNPA Systems / Binder, A., Freund, R., Oswald, M., & Vock, L. (2007). Modelling Logical Gates with ESNPA Systems. In M. Droste & M. Lohrey (Eds.), 17.Theorietag Automaten und Formale Sprachen (pp. 28–32). http://hdl.handle.net/20.500.12708/52092
• Spiking neural P systems with inhibitory axons / Freund, R., & Oswald, M. (2007). Spiking neural P systems with inhibitory axons. In M. Sugisaka & H. Tamaka (Eds.), Proceedings of the 12th Interantional Symbosium on Artificial Life and Robotics (pp. 509–512). ISAROB 2007. http://hdl.handle.net/20.500.12708/52057
• Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode / Freund, R., Paun, G., & Pérez-Jiménez, M. (2007). Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode. In S. Akl & C. S. Calude (Eds.), Unconventional Computation (pp. 62–76). LNCS, Springer. http://hdl.handle.net/20.500.12708/52056
• CD Grammar Systems with Regular Start Conditions / Freund, R., & Oswald, M. (2007). CD Grammar Systems with Regular Start Conditions. In V. Geffert & G. Pighizzini (Eds.), Descriptional Complexity of Formal Systems (pp. 69–80). http://hdl.handle.net/20.500.12708/52046
• Extended spiking neural P systems with decaying spikes and/or total spiking / Freund, R., Ionescu, M., & Oswald, M. (2007). Extended spiking neural P systems with decaying spikes and/or total spiking. In G. Vaszil (Ed.), Proceedings of the International Workshop Automata for Cellular and Molecular Computing (pp. 64–75). MTA Sztaki. http://hdl.handle.net/20.500.12708/52042
• A formal framework for P systems / Freund, R., & Verlan, S. (2007). A formal framework for P systems. In G. Eleftherakis, P. Kefalas, & G. Paun (Eds.), Eighth Workshop on Membane Computing (WMC8) (pp. 317–330). South-East European Research Centre. http://hdl.handle.net/20.500.12708/52026
• Fuzzy Logic as a Theory of Vagueness / Bradley, J. (2007). Fuzzy Logic as a Theory of Vagueness. In M. Stepnicka, V. Novak, & U. Bodenhofer (Eds.), New Dimensions in Fuzzy Logic and Related Technologies (pp. 417–424). http://hdl.handle.net/20.500.12708/51904
• Exploring Dialogue Games as Foundation of Fuzzy Logic / Fermüller, C. (2007). Exploring Dialogue Games as Foundation of Fuzzy Logic. In M. Stepnicka, V. Novak, & U. Bodenhofer (Eds.), New Dimensions in Fuzzy Logic and Related Technologies (pp. 437–444). http://hdl.handle.net/20.500.12708/51903
• Fuzzy Logic and Theories of Vagueness / Fermüller, C. (2007). Fuzzy Logic and Theories of Vagueness. In New Dimensions in Fuzzy Logic and Related Technologies (p. 17). http://hdl.handle.net/20.500.12708/51893
• On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems / Schernhammer, F., & Gramlich, B. (2007). On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems. http://hdl.handle.net/20.500.12708/33102
• Termination of Lazy Rewriting Revisited / Schernhammer, F., & Gramlich, B. (2007). Termination of Lazy Rewriting Revisited (No. E1852-2007–01). http://hdl.handle.net/20.500.12708/33101
• Proof Transformations and Structural Invariance / Leitsch, A., & Hetzl, S. (2007). Proof Transformations and Structural Invariance. In S. Aguzzoli (Ed.), LNAI 4460: Algebraic and Proof-theoretic Aspects (pp. 201–230). Springer, LNAI 4460. http://hdl.handle.net/20.500.12708/25413

2006

• 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
• 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
• 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
• (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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• (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
• 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
• 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
• 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
• 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
• 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

• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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

2004

• P Systems with Conditional Communication Rules Assigned to Membranes / Freund, R., & Oswald, M. (2004). P Systems with Conditional Communication Rules Assigned to Membranes. Journal of Automata, Languages and Combinatorics, 9(4), 387–397. http://hdl.handle.net/20.500.12708/174840
• Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains / Gil, A., Hermann, M., Salzer, G., & Zanuttini, B. (2004). Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains (D. Basin & M. Rusinowitch, Eds.). http://hdl.handle.net/20.500.12708/84666
• Proving Properties of Term Rewrite Systems via Logic Programs / Salzer, G., & Limet, S. (2004). Proving Properties of Term Rewrite Systems via Logic Programs (V. Oostrom van, Ed.). http://hdl.handle.net/20.500.12708/84651
• Strategien in Computationaler Logik / Gramlich, B. (2004). Strategien in Computationaler Logik. Eingeladener Vortrag an Universitaet, Universitaet Utrecht, Niederlande, Austria. http://hdl.handle.net/20.500.12708/84389
• CERES: Cut-Elimination by Resolution / Leitsch, A. (2004). CERES: Cut-Elimination by Resolution. Eingeladener Vortrag an Universitaet, Universitaet Utrecht, Niederlande, Austria. http://hdl.handle.net/20.500.12708/84384
• Cut-Elimination by Resolution / Leitsch, A. (2004). Cut-Elimination by Resolution. First Vienna-Florence Workshop on Logic and Computation, Florence, Austria. http://hdl.handle.net/20.500.12708/84382
• CERES: Cut-elimination by Resolution / Leitsch, A. (2004). CERES: Cut-elimination by Resolution. Paris-Vienna Workshop 2004 on Proof Systems, Paris, Austria. http://hdl.handle.net/20.500.12708/84383
• An Overview on Countable Gödel Logics / Preining, N. (2004). An Overview on Countable Gödel Logics. First Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/84380
• Dialogue games as foundation of fuzzy logics / Fermüller, C. (2004). Dialogue games as foundation of fuzzy logics. 3rd Moscow-Vienna Workshop on Logic and Computation, Moskow, Austria. http://hdl.handle.net/20.500.12708/84378
• Countable orderings and continuous embeddability / Preining, N. (2004). Countable orderings and continuous embeddability. 3rd Moscow-Vienna Workshop on Logic and Computation, Moskow, Austria. http://hdl.handle.net/20.500.12708/84379
• Revisiting Giles: On Bets, Dialogue Games, Fuzzy logics, and Hypersequents / Fermüller, C. (2004). Revisiting Giles: On Bets, Dialogue Games, Fuzzy logics, and Hypersequents. COS - ESF Exploratory Workshop ``The Challenge of Semantics’, Vienna, Austria. http://hdl.handle.net/20.500.12708/84377
• Fuzzy Logics from First Principles / Fermüller, C. (2004). Fuzzy Logics from First Principles. Paris-Vienna Workshop 2004 on Proof Systems, Paris, Austria. http://hdl.handle.net/20.500.12708/84376
• Viewing proofs in bounded arithmetic as programs / Beckmann, A. (2004). Viewing proofs in bounded arithmetic as programs. Paris-Vienna Workshop 2004 on Proof Systems, Paris, Austria. http://hdl.handle.net/20.500.12708/84374
• On a connection between Gdel logics and linearly ordered Kripke frames / Beckmann, A. (2004). On a connection between Gdel logics and linearly ordered Kripke frames. COS - ESF Exploratory Workshop ``The Challenge of Semantics’, Vienna, Austria. http://hdl.handle.net/20.500.12708/84375
• Abstract measures for low level complexity / Beckmann, A. (2004). Abstract measures for low level complexity. 3rd Moscow-Vienna Workshop on Logic and Computation, Moskow, Austria. http://hdl.handle.net/20.500.12708/84373
• Revisiting Giles: Connecting Bets, Dialogue Games, and Fuzzy Logics / Fermüller, C. (2004). Revisiting Giles: Connecting Bets, Dialogue Games, and Fuzzy Logics. Logic, Games and Philosophy - Foundational Perspectives, Prague, Czech Republic, Austria. http://hdl.handle.net/20.500.12708/84372
• P Systems with Antiport Rules for Evolution Rules / Freund, R., & Oswald, M. (2004). P Systems with Antiport Rules for Evolution Rules. WSEAS Internation Conference on Evolutionary Computation, Udine, Italy, Austria. http://hdl.handle.net/20.500.12708/84299
• Computations with 1-deterministic P Systems Using Antiport/Symport Rules for Evolution Rules / Oswald, M. (2004). Computations with 1-deterministic P Systems Using Antiport/Symport Rules for Evolution Rules. WSEAS International Conference on Mathematical Biology and Ecology, Corfu, Greece, Austria. http://hdl.handle.net/20.500.12708/84298
• Asynchronous P Systems on Arrays and Strings / Freund, R. (2004). Asynchronous P Systems on Arrays and Strings. International Conference on  Developments in Language Theory (DLT), Palermo, Italy, EU. http://hdl.handle.net/20.500.12708/84278
• P Systems Working in the Asynchronous and the Sequential Mode / Freund, R. (2004). P Systems Working in the Asynchronous and the Sequential Mode. Molecular Computing, Leiden, the Netherlands, Austria. http://hdl.handle.net/20.500.12708/84277
• Tissue P Systems Simulating Grammar Systems / Freund, R., & Oswald, M. (2004). Tissue P Systems Simulating Grammar Systems. Molecular Computing, Leiden, the Netherlands, Austria. http://hdl.handle.net/20.500.12708/84276
• Sequential P Systems with Unit Rules and Energy Assigned to Membranes / Freund, R., Leporati, A., Oswald, M., & Zandron, C. (2004). Sequential P Systems with Unit Rules and Energy Assigned to Membranes. MCU (International Conference Machines, Computations and Universality), Orleans, EU. http://hdl.handle.net/20.500.12708/84275
• Computational Completeness of P Systems with Active Membranes and Two Polarizations / Alhazov, A., Freund, R., & Paun, G. (2004). Computational Completeness of P Systems with Active Membranes and Two Polarizations. MCU (International Conference Machines, Computations and Universality), Orleans, EU. http://hdl.handle.net/20.500.12708/84274
• A Dialogue Game for Intuitionistic Fuzzy Logic Based on Comparisons of Degrees of Truth / Fermüller, C. (2004). A Dialogue Game for Intuitionistic Fuzzy Logic Based on Comparisons of Degrees of Truth. First Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/84234
• P Systems Working in the Sequential Mode on Arrays and Strings / Freund, R. (2004). P Systems Working in the Sequential Mode on Arrays and Strings. In C. S. Calude, E. Calude, & M. J. Dinneen (Eds.), Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings (pp. 188–199). Springer LNCS 3340. http://hdl.handle.net/20.500.12708/50970

2003

• Characterization of Gödel logics with countable truth value sets / Preining, N. (2003). Characterization of Gödel logics with countable truth value sets. LOGSOFCOM’03, Siena, Italy, Austria. http://hdl.handle.net/20.500.12708/84262
• Clause Evaluation over Herbrand Interpretations / Leitsch, A. (2003). Clause Evaluation over Herbrand Interpretations. Seminar on Deduction and Infinite-state Model Checking, Dagstuhl, Germany, Austria. http://hdl.handle.net/20.500.12708/84261
• Complexity of P Automata with Catalysts / Freund, R., & Oswald, M. (2003). Complexity of P Automata with Catalysts. Annual Meeting of Project MolCoNet, Budapest, Austria. http://hdl.handle.net/20.500.12708/84256
• P Systems with Elementary Graph Productions / Freund, R., & Oswald, M. (2003). P Systems with Elementary Graph Productions. EMCC Spring Meeting, Turku, Finland, Austria. http://hdl.handle.net/20.500.12708/84255
• On Modularity in Context-Sensitive Rewriting / Gramlich, B. (2003). On Modularity in Context-Sensitive Rewriting. LORIA/INRIA, Nancy, France, Nancy, France, Austria. http://hdl.handle.net/20.500.12708/84254
• On Interreduction of Semi-Complete Term Rewrite Systems / Gramlich, B. (2003). On Interreduction of Semi-Complete Term Rewrite Systems. DSIC Seminars, UPV, Valencia, Spain, Austria. http://hdl.handle.net/20.500.12708/84253
• Progress Report on Term Rewriting / Gramlich, B. (2003). Progress Report on Term Rewriting. Annual Meeting of the IFIP-WG 1.6 - Term Rewriting, Valencia, Spain, Austria. http://hdl.handle.net/20.500.12708/84252

2002

• Excursions of a computer scientist into the realm of logic / Salzer, G. (2002). Excursions of a computer scientist into the realm of logic. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84120
• Parallel Dialogue Games for Gödel Logic / Fermüller, C. (2002). Parallel Dialogue Games for Gödel Logic. Amadee-Meeting, Universite Paris VII, Paris, France, Austria. http://hdl.handle.net/20.500.12708/84119
• Characterizing Gödel logic by parallellizing Lorenzen's dialogue semantics / Fermüller, C. (2002). Characterizing Gödel logic by parallellizing Lorenzen’s dialogue semantics. Accion Integrada Meeting, Bellaterra, Spain, Austria. http://hdl.handle.net/20.500.12708/84118
• A Natural Deduction System for Intuitionistic Fuzzy Logic / Fermüller, C. (2002). A Natural Deduction System for Intuitionistic Fuzzy Logic. Moscow-Vienna Workshop on Logic and Computation, Moscow, Austria. http://hdl.handle.net/20.500.12708/84117
• Parallel Dialogue Games for Intermediate Logics / Fermüller, C. (2002). Parallel Dialogue Games for Intermediate Logics. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), Phnom Penh, Cambodia, Non-EU. http://hdl.handle.net/20.500.12708/84116
• Simplifying Termination Proofs by Program Transformation / Gramlich, B. (2002). Simplifying Termination Proofs by Program Transformation. DISC Seminars, Valencia, Spain, Austria. http://hdl.handle.net/20.500.12708/84115
• On Modular Aspects of Context-Sensitive Rewriting / Gramlich, B. (2002). On Modular Aspects of Context-Sensitive Rewriting. Accion Integrada Project Meeting, Wien, Austria. http://hdl.handle.net/20.500.12708/84114
• On Modularity in Context-Sensitive Rewriting / Gramlich, B. (2002). On Modularity in Context-Sensitive Rewriting. 4th Annual Meeting of the IFIP Working Group 1.6 - Term Rewriting, Copenhagen, Denmark, Austria. http://hdl.handle.net/20.500.12708/84113
• P systems with activated/prohibited membrane channels / Oswald, M. (2002). P systems with activated/prohibited membrane channels. Workshop on Membrane Computing, Wien, Austria. http://hdl.handle.net/20.500.12708/84112
• P automata on finite and infinite words / Freund, R. (2002). P automata on finite and infinite words. Annual Meeting of Project MolCoNet, Budapest, Austria. http://hdl.handle.net/20.500.12708/84111
• Some comments on P systems with communication / Freund, R. (2002). Some comments on P systems with communication. Workshop on Membrane Computing, Wien, Austria. http://hdl.handle.net/20.500.12708/84110
• P systems versus register machines: two universality proofs / Freund, R. (2002). P systems versus register machines: two universality proofs. Workshop on Membrane Computing, Wien, Austria. http://hdl.handle.net/20.500.12708/84109

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

2023

• Norm Compliance for Reinforcement Learning Agents / Neufeld, E. A. (2023). Norm Compliance for Reinforcement Learning Agents [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.112881
• Erkennung von Mustern in EVM-Bytecode durch XQuery-Abfragen auf Ausführungspfaden im Kontrollflussgraphen / Sack, C. (2023). Erkennung von Mustern in EVM-Bytecode durch XQuery-Abfragen auf Ausführungspfaden im Kontrollflussgraphen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98507
• Unpacking The Argument - A Claim-Centric View On Abstract Argumentation / Rapberger, A. (2023). Unpacking The Argument - A Claim-Centric View On Abstract Argumentation [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.112445
• A Logical Analysis of Normative Reasoning: Agency, Action, and Argumentation / Van Berkel, C. L. J. (2023). A Logical Analysis of Normative Reasoning: Agency, Action, and Argumentation [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.111854
• Fuzzy Logic Based Judgment Aggretation / Uhl, S. (2023). Fuzzy Logic Based Judgment Aggretation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.101246

2022

• Identifying related smart contracts by their bytecode / Yücel, T. (2022). Identifying related smart contracts by their bytecode [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.96144
• Game semantics - The full abstraction problem for PCF / Ruiss, M. (2022). Game semantics - The full abstraction problem for PCF [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.82700
• Stereoscopic panorama stitching / Sippl, T. (2022). Stereoscopic panorama stitching [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.71965
• Analysis, design and prototypical implementation of an early recognition of strokes in serious games / Frenzel, M. (2022). Analysis, design and prototypical implementation of an early recognition of strokes in serious games [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.47246
• Representing normative reasoning in answer set programming using weak constraints / Hatschka, C. (2022). Representing normative reasoning in answer set programming using weak constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99420
• Extensionality for obligations in Åqvist’s system F / Pichler, D. (2022). Extensionality for obligations in Åqvist’s system F [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.95067
• Analysis, Design and Implementation of a Serious Game in the Field of Bone Fractures Rehabilitation for Arm Injuries / Rabinowitsch, A. (2022). Analysis, Design and Implementation of a Serious Game in the Field of Bone Fractures Rehabilitation for Arm Injuries [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78229

2021

• Games, modalities and analytic proofs in nonclassical logics / Lang, T. A. (2021). Games, modalities and analytic proofs in nonclassical logics [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.92047
• Argumentation theory and alternative semantics for non-classical logics / Corsi, E. A. (2021). Argumentation theory and alternative semantics for non-classical logics [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99022
• Refining labelled systems for modal and constructive logics with applications / Lyon, T. (2021). Refining labelled systems for modal and constructive logics with applications [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.97064
• A comprehensive Survey of the actual causality literature / Kueffner, K. R. (2021). A comprehensive Survey of the actual causality literature [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.90003
• Systematic review of ethereum smart contract security vulnerabilities, analysis methods and tools / Rameder, H. (2021). Systematic review of ethereum smart contract security vulnerabilities, analysis methods and tools [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.86784
• Identifying administrators of smart contracts from transaction data / Gorgoris, P. (2021). Identifying administrators of smart contracts from transaction data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.77989
• Axiomatic truth theories and reflection principles / De Coster, A. (2021). Axiomatic truth theories and reflection principles [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.67441

2020

• Privacy enhancing technologies for distributed ledgers / Wolf, M. (2020). Privacy enhancing technologies for distributed ledgers [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.74343
• Grammatical complexity of finite languages
• Decompilation of EVM bytecode / Kurzmann, M. (2020). Decompilation of EVM bytecode [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.66186
• Automated proof analysis by CERES / Lolić, A. (2020). Automated proof analysis by CERES [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.47184
• Erhebung und Evaluierung von möglichen Potentialen der elektronischen Patientenakte in Österreich aus Sicht der Seniorinnen und Senioren / Schein, M. (2020). Erhebung und Evaluierung von möglichen Potentialen der elektronischen Patientenakte in Österreich aus Sicht der Seniorinnen und Senioren [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.74260
• Nonclassical approaches to judgement aggregation / Reitgruber, M. (2020). Nonclassical approaches to judgement aggregation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.66522
• Smart contracts in a DAG ledger : Blockchain 5.0 / Hetzenecker, L. (2020). Smart contracts in a DAG ledger : Blockchain 5.0 [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.62445
• Comparison and analysis of constructive set theories / Freiman, R. (2020). Comparison and analysis of constructive set theories [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.66523
• Language properties for smart contracts / Rizvanović, A. (2020). Language properties for smart contracts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.55148
• Requirements engineering and case studies of campus management systems for midsize private Universities / Fida, A. (2020). Requirements engineering and case studies of campus management systems for midsize private Universities [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78831
• Analyse, Entwurf und Evaluierung eines Vorschlags für einen internationalen Standard in der Telemedizin für elektronische Gesundheitsakten, im Speziellen für das Anwendungsszenario der ELGA / Tanjga, N. (2020). Analyse, Entwurf und Evaluierung eines Vorschlags für einen internationalen Standard in der Telemedizin für elektronische Gesundheitsakten, im Speziellen für das Anwendungsszenario der ELGA [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.55500

2019

• Modellierung vager natürlichsprachlicher Quantoren über Dialogspiele und Fuzzy Logik / Hofer, M. F. J. (2019). Modellierung vager natürlichsprachlicher Quantoren über Dialogspiele und Fuzzy Logik [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.66687
• Concept of a web-based application for cooperative teamwork in the field of teaching of software techniques / Mészárosné Csuta, E. (2019). Concept of a web-based application for cooperative teamwork in the field of teaching of software techniques [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.69940
• Deduction of a technical modernization process for the software architecture of Core Banking Systems / Gruber, A. (2019). Deduction of a technical modernization process for the software architecture of Core Banking Systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.71420
• Intermediate logics and concurrent λ-calculi: a proof-theoretical approach / Genco, F. A. (2019). Intermediate logics and concurrent λ-calculi: a proof-theoretical approach [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.66600

2018

• Algorithmic introduction of π2-cuts / Lettmann, M. P. (2018). Algorithmic introduction of π2-cuts [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.60480
• Formal reasoning about fuzzy evaluation games / Ivanov, S. (2018). Formal reasoning about fuzzy evaluation games [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.54982
• Implementierung und Vergleich von Quantoren-Fuzzifikationsmechanismen / Okulmus, C. (2018). Implementierung und Vergleich von Quantoren-Fuzzifikationsmechanismen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.52030
• Zyklische Superposition und Induktion / Vierling, J. T. (2018). Zyklische Superposition und Induktion [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.51282
• Fine-grained access control in an animal health record / Romar, A. (2018). Fine-grained access control in an animal health record [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78893
• Rätselhafte Ignoranz : ein Rundgang durch epistemische Logik : a modal epistemic tour / Oliveira da Costa, A. A. (2018). Rätselhafte Ignoranz : ein Rundgang durch epistemische Logik : a modal epistemic tour [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.51200
• Ein generisches Framework für entscheidungsunterstützende Systeme im medizinischen Bereich / Gepp, D. (2018). Ein generisches Framework für entscheidungsunterstützende Systeme im medizinischen Bereich [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.56238
• Proof theory for modal logics : embedding between hypersequent calculi and systems of rules / Pavlovi, S. (2018). Proof theory for modal logics : embedding between hypersequent calculi and systems of rules [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.58584
• Extracting programs from proofs : using Friedman's A-translation and realizability / Rietdijk, M. (2018). Extracting programs from proofs : using Friedman’s A-translation and realizability [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.52485
• Analyse, Design und prototypische Umsetzung einer mobilen Applikation zur Gesundheitsförderung unterstützt durch Wearables / Schlossarek, S. (2018). Analyse, Design und prototypische Umsetzung einer mobilen Applikation  zur Gesundheitsförderung unterstützt durch Wearables [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/80022
• Analyse, Design und Implementierung von Serious Gaming zur Förderung eines gesunden Lebensstils / Dobler, L. (2018). Analyse, Design und Implementierung von Serious Gaming  zur Förderung eines gesunden Lebensstils [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79303

2017

• Preprocessing in higher-order reasoning : learning from QBF solving / Schurr, H. J. (2017). Preprocessing in higher-order reasoning : learning from QBF solving [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.36282

2016

• Schnittelimination in funktionaler Logik höherer Stufe / Pona, N. (2016). Schnittelimination in funktionaler Logik höherer Stufe [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.37392
• Formal ontology-based quantum security requirements engineering by Petri nets / Dissauer, G. (2016). Formal ontology-based quantum security requirements engineering by Petri nets [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.37110
• Design and evaluation of stereo matching techniques for silicon retina cameras / Kogler, J. (2016). Design and evaluation of stereo matching techniques for silicon retina cameras [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.36281

2015

• Agile software development principles as means of teaching for students projects / Görlich, G. (2015). Agile software development principles as means of teaching for students projects [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/80176
• Entwicklung einer E-Partizipations-Plattform für Jugendliche innerhalb des sozialen Netzwerks Facebook / Oberhumer, D. (2015). Entwicklung einer E-Partizipations-Plattform für Jugendliche innerhalb des sozialen Netzwerks Facebook [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78681
• 'Gehirnmonopole' als Risiko des Wissensmanagements bei wissensgestützten Unternehmen / Banke, M.-S. (2015). “Gehirnmonopole” als Risiko des Wissensmanagements bei wissensgestützten Unternehmen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78358
• Vorgehensmodelle für die Software-Entwicklung im Game Development: Erarbeitung eines Best Practice-Konzepts / Komarek, A. (2015). Vorgehensmodelle für die Software-Entwicklung im Game Development: Erarbeitung eines Best Practice-Konzepts [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158724
• Identification and handling of typical implementation problems of hospital information systems in large-scale hospitals / Wunderer, T. (2015). Identification and handling of typical implementation problems of hospital information systems in large-scale hospitals [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158756
• Evaluation of equity models for tournament poker / Melcher, H. (2015). Evaluation of equity models for tournament poker [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79991
• Didaktik der theoretischen Informatik / Kogler, M. (2015). Didaktik der theoretischen Informatik [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79153
• Engineering eines Cockpits für die dynamische und interaktive Visualisierung des Betriebes eines landesweiten NFC-Bezahlsystems / Hengl, A. (2015). Engineering eines Cockpits für die dynamische und interaktive Visualisierung des Betriebes eines landesweiten NFC-Bezahlsystems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78759
• Realizing negative introspection into justification logic : proof-theoretic approach / Borg, A. (2015). Realizing negative introspection into justification logic : proof-theoretic approach [Diploma Thesis]. reposiTUm. https://doi.org/10.34726/hss.2015.29804
• Structural analysis of cut-elimination / Wolfsteiner, S. P. (2015). Structural analysis of cut-elimination [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.25878

2014

• Analysis and framework for the civil register of an emergent north-african country / El Kebir, S. (2014). Analysis and framework for the civil register of an emergent north-african country [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158763
• Evaluierung und Optimierung eines Studiensystems zur objektiven Bewertung von Hautrötungen im Umfeld klinischer Studien am Beispiel einer Medikamentenstudie im Bereich der Brustkrebstherapie / Ratzinger, M. (2014). Evaluierung und Optimierung eines Studiensystems zur objektiven Bewertung von Hautrötungen im Umfeld klinischer Studien am Beispiel einer Medikamentenstudie im Bereich der Brustkrebstherapie [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79462
• Konzepte, Rahmen-Architektur und Organisationsszenarien für die mobile Operation von geldwertigen Transaktionen / Schamberger, R. (2014). Konzepte, Rahmen-Architektur und Organisationsszenarien für die mobile Operation von geldwertigen Transaktionen [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79242
• Analyse der Navigation und Steuerung von 3D-Bewegungen via Brain-Computer-Interface / Lachner, C. M. (2014). Analyse der Navigation und Steuerung von 3D-Bewegungen via Brain-Computer-Interface [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158510
• Space & congruence compression of proofs / Fellner, A. (2014). Space & congruence compression of proofs [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24717
• Prototypical implementation of an Animal Health Record (AHR) for livestock management / Aigner, C. (2014). Prototypical implementation of an Animal Health Record (AHR) for livestock management [Diploma Thesis]. reposiTUm. https://doi.org/10.34726/hss.2014.23541
• Visualization of quality of life on a digital urban map / Benkö, P. (2014). Visualization of quality of life on a digital urban map [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23995

2013

• A framework for Giles-style evaluation games / Kausl, M. (2013). A framework for Giles-style evaluation games [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159735
• Scope and depth efficient testing approach and framework for enhancing the detection of IT security bugs / Schanes, C. (2013). Scope and depth efficient testing approach and framework for enhancing the detection of IT security bugs [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159694

2012

• Models of hypercomputation / Acar, E. (2012). Models of hypercomputation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-52279
• Unification in higher-order resolution / Líbal, T. (2012). Unification in higher-order resolution [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-57326
• CoMetO : a cognitive design methodology for enhancing the alignment potential of ontologies / Mazak-Huemer, A. (2012). CoMetO : a cognitive design methodology for enhancing the alignment potential of ontologies [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-46923
• An open schema database for distributed biomedical research projects / Wiesinger, M. (2012). An open schema database for distributed biomedical research projects [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160036
• Securing IPv6 by quantum key distribution for wide area networks / Dißauer, G. (2012). Securing IPv6 by quantum key distribution for wide area networks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-57727

2011

• Logics for coalitional games of imperfect information / Seitz, G. (2011). Logics for coalitional games of imperfect information [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-43434
• Integrating theories into inference systems / Riener, M. (2011). Integrating theories into inference systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159961
• Requirementsanalyse und Prototyp einer klinischen Plattform zur aktiven Patientenpartizipation / Eder, M. (2011). Requirementsanalyse und Prototyp einer klinischen Plattform zur aktiven Patientenpartizipation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-54349
• Strukturen und Optionen des Mediums Mobile Phone im sekundären Bildungsbereich / Schmiedl, G. (2011). Strukturen und Optionen des Mediums Mobile Phone im sekundären Bildungsbereich [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-55659

2010

• A numeric semantics for UML class diagrams : semantics and tools / Niederbrucker, G. (2010). A numeric semantics for UML class diagrams : semantics and tools [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160860

2009

• A general analysis of cut-elimination by CERes / Woltzenlogel-Paleo, B. (2009). A general analysis of cut-elimination by CERes [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32321
• Measurement-based timing analysis of applications written in ANSI-C / Rieder, B. (2009). Measurement-based timing analysis of applications written in ANSI-C [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-17000

2008

• Cut elimination in inductive proofs of weakly quantified theorems / Libal, T. (2008). Cut elimination in inductive proofs of weakly quantified theorems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26492

2007

• Herbrand sequent extraction / Woltzenlogel-Paleo, B. (2007). Herbrand sequent extraction [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-18086

2006

• Proof transformations by resolution : computational methods of cut-elimination / Richter, C. (2006). Proof transformations by resolution : computational methods of cut-elimination [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-19752

2005

• Supervised learning of wrappers from structured data sources / Ceresna, M. (2005). Supervised learning of wrappers from structured data sources [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-16619

2004

• Projection-based cut-elimination and normalization / Hetzl, S. (2004). Projection-based cut-elimination and normalization [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-10645

• 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 .