Felix Weiss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Felix Weiss has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Martin Mundhenk
Friedrich-Schiller-Universität Jena
3 shared publications - Arne Meier
Institut für Theoretische Informatik, Leibniz Universität Hannover, Hannover, Germany
1 shared publication - Michael Thomas
Institut für Theoretische Informatik Gottfried Wilhelm Leibniz Universität Appelstr. 4 30167 Hannover Germany
1 shared publication - Thomas Schneider
University of Manchester UK
1 shared publication Volker Weber
Fakultät für Informatik Technische Universität Dortmund Germany
1 shared publication
Latest Publications
- 16 March 2013
- Published by Springer Nature in computational complexity
- Vol. 23 (4) , 637-669
An AC 1-complete model checking problem for intuitionistic logic
- 16 March 2013
- Published by Springer Nature in computational complexity
- Vol. 23 (4) , 637-669
An AC 1-complete model checking problem for intuitionistic logic
- Open Access
The model checking problem for intuitionistic propositional logic with one variable is AC1-complete
We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC1. As basic tool we use the connection between intuitionistic logic and Heyting algebra, and investigate its complexity theoretical aspects. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem.
Open AccessThe model checking problem for intuitionistic propositional logic with one variable is AC1-complete
We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC1. As basic tool we use the connection between intuitionistic logic and Heyting algebra, and investigate its complexity theoretical aspects. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem.
- Open Access
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments including negation. For the monotone fragments, we are able to distinguish the easy from the hard cases, depending on the allowed set of operators.
Open AccessThe Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments including negation. For the monotone fragments, we are able to distinguish the easy from the hard cases, depending on the allowed set of operators.