Stefan Mengel

From MaRDI portal
(Redirected from Person:269341)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Bounds on BDD-based bucket elimination2024-11-26Paper
An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
Annals of Mathematics and Artificial Intelligence
2024-10-31Paper
Changing partitions in rectangle decision lists2024-07-12Paper
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
Journal of Artificial Intelligence Research
2023-03-13Paper
scientific article; zbMATH DE number 7561480 (Why is no real title available?)2022-07-21Paper
scientific article; zbMATH DE number 7561482 (Why is no real title available?)
(available as arXiv preprint)
2022-07-21Paper
scientific article; zbMATH DE number 7559127 (Why is no real title available?)2022-07-18Paper
No Efficient Disjunction or Conjunction of Switch-Lists
Journal on Satisfiability, Boolean Modeling and Computation
2022-06-01Paper
Proof complexity of symbolic QBF reasoning
(available as arXiv preprint)
2022-03-22Paper
Characterizing Tseitin-formulas with short regular resolution refutations
(available as arXiv preprint)
2022-03-22Paper
Characterizing tractability of simple well-designed pattern trees with projection
Theory of Computing Systems
2021-06-24Paper
The logic of counting query answers2021-01-19Paper
The logic of counting query answers
(available as arXiv preprint)
2021-01-19Paper
Enumeration on trees under relabelings
(available as arXiv preprint)
2020-08-06Paper
scientific article; zbMATH DE number 7204563 (Why is no real title available?)
(available as arXiv preprint)
2020-05-27Paper
Revisiting graph width measures for CNF-encodings2020-05-20Paper
Graph width measures for CNF-encodings with auxiliary variables
Journal of Artificial Intelligence Research
2020-05-14Paper
Minimal distance of propositional models
Theory of Computing Systems
2019-09-05Paper
Lower bounds on the mim-width of some graph classes
Discrete Applied Mathematics
2018-09-17Paper
QBF as an alternative to Courcelle's theorem
(available as arXiv preprint)
2018-08-10Paper
On the relative power of reduction notions in arithmetic circuit complexity
Information Processing Letters
2017-11-22Paper
A trichotomy in the complexity of counting answers to conjunctive queries
(available as arXiv preprint)
2017-06-13Paper
The arithmetic complexity of tensor contractions
(available as arXiv preprint)
2017-01-30Paper
Understanding model counting for \(\beta\)-acyclic CNF-formulas
(available as arXiv preprint)
2017-01-24Paper
Parameterized compilation lower bounds for restricted CNF-formulas
Theory and Applications of Satisfiability Testing – SAT 2016
2016-09-05Paper
The next whisky bar
Computer Science – Theory and Applications
2016-07-25Paper
The arithmetic complexity of tensor contraction
Theory of Computing Systems
2016-06-03Paper
As Close as It Gets
WALCOM: Algorithms and Computation
2016-05-03Paper
Structural tractability of counting of solutions to conjunctive queries
Theory of Computing Systems
2016-04-18Paper
Give me another one!
Algorithms and Computation
2016-01-11Paper
On compiling CNFs into structured deterministic DNNFs
Lecture Notes in Computer Science
2015-11-20Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy
Computational Complexity
2015-07-08Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy
Computational Complexity
2015-07-08Paper
Hypergraph acyclicity and propositional model counting
Lecture Notes in Computer Science
2014-09-26Paper
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
2014-01-28Paper
Arithmetic branching programs with memory
Mathematical Foundations of Computer Science 2013
2013-09-20Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy2012-08-23Paper
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
Automata, Languages and Programming
2011-07-06Paper


Research outcomes over time


This page was built for person: Stefan Mengel