Miki Hermann

62 papers A* 4A 8B 13C 2Misc 2Journal 25Unranked 8
YearRankTypeTitle / Venue / Authors
2025 — conf
Efficient Learning of Horn Formulas over Finite Totally Ordered Domains.
MIWAI (2)
Miki Hermann, Gernot Salzer
2024 — conf
Efficient Implementation of 2SAT Formula Learning over Finite Totally Ordered Domains.
MIWAI (1)
Miki Hermann, Gernot Salzer
2024 A* conf
Primal Grammars Driven Automated Induction.
IJCAI
Adel Bouhoula, Miki Hermann
2021 B conf
How to Find the Exit from a 3-Dimensional Maze.
SEA
Miki Hermann
2021 A conf
MCP: Capturing Big Data by Satisfiability (Tool Description).
SAT
Miki Hermann, Gernot Salzer
2019 J jnl
Minimal Distance of Propositional Models.
Theory Comput. Syst.
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
2018 J jnl
On the complexity of generalized chromatic polynomials.
Adv. Appl. Math.
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
2017 J jnl
On the complexity of generalized chromatic polynomials.
CoRR
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
2016 B conf
As Close as It Gets.
WALCOM
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
2016 Misc conf
The Next Whisky Bar.
CSR
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
2015 B conf
Give Me Another One!
ISAAC
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
2015 J jnl
Minimal Distance of Propositional Models.
CoRR
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
2013 J jnl
Complexity of existential positive first-order logic.
J. Log. Comput.
Manuel Bodirsky, Miki Hermann, Florian Richoux
2012 B conf
Counting Partitions of Graphs.
ISAAC
Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
2012 J jnl
Trichotomies in the Complexity of Minimal Inference.
Theory Comput. Syst.
Arnaud Durand, Miki Hermann, Gustav Nordh
2010 J jnl
Complexity of Existential Positive First-Order Logic
CoRR
Manuel Bodirsky, Miki Hermann, Florian Richoux
2010 J jnl
Counting complexity of propositional abduction.
J. Comput. Syst. Sci.
Miki Hermann, Reinhard Pichler
2010 J jnl
The Helly property and satisfiability of Boolean formulas defined on set families.
Eur. J. Comb.
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
2009 C conf
Complexity of Existential Positive First-Order Logic.
CiE
Manuel Bodirsky, Miki Hermann, Florian Richoux
2009 J jnl
Complexity of counting the optimal solutions.
Theor. Comput. Sci.
Miki Hermann, Reinhard Pichler
2009 B conf
On the Computational Complexity of Monotone Constraint Satisfaction Problems.
WALCOM
Miki Hermann, Florian Richoux
2009 A* conf
Trichotomy in the Complexity of Minimal Inference.
LICS
Arnaud Durand, Miki Hermann, Gustav Nordh
2008 J jnl
Complexity of Clausal Constraints Over Chains.
Theory Comput. Syst.
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer
2008 Misc conf
Complexity of Counting the Optimal Solutions.
COCOON
Miki Hermann, Reinhard Pichler
2008 J jnl
Complexity of Counting the Optimal Solutions.
Electron. Colloquium Comput. Complex.
Miki Hermann, Reinhard Pichler
2008 B conf
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction.
JELIA
Miki Hermann, Reinhard Pichler
2008 — conf
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.
ISMVL
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
2008 J jnl
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains.
SIAM J. Comput.
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
2008 J jnl
On Boolean primitive positive clones.
Discret. Math.
Miki Hermann
2008 C conf
On the Complexity of Computing Generators of Closed Sets.
ICFCA
Miki Hermann, Baris Sertkaya
2008 J jnl
On the counting complexity of propositional circumscription.
Inf. Process. Lett.
Arnaud Durand, Miki Hermann
2007 B conf
Complexity of Default Logic on Generalized Conjunctive Queries.
LPNMR
Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
2007 A* conf
Counting Complexity of Propositional Abduction.
IJCAI
Miki Hermann, Reinhard Pichler
2006 B ed.
Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings
LPAR
Miki Hermann, Andrei Voronkov
2005 J jnl
Subtractive reductions and complete problems for counting complexity classes.
Theor. Comput. Sci.
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
2004 J jnl
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.
Theory Comput. Syst.
Georg Gottlob, Miki Hermann, Michaël Rusinowitch
2004 A conf
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004 — conf
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT (Selected Papers
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004 A conf
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.
IJCAR
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
2003 A conf
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.
STACS
Arnaud Durand, Miki Hermann
2002 J jnl
On the complexity of recognizing the Hilbert basis of a linear diophantine system.
Theor. Comput. Sci.
Arnaud Durand, Miki Hermann, Laurent Juban
2000 B conf
Subtractive Reductions and Complete Problems for Counting Complexity Classes.
MFCS
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
2000 J jnl
Unification Algorithms Cannot Be Combined in Polynomial Time.
Inf. Comput.
Miki Hermann, Phokion G. Kolaitis
1999 J jnl
Computational Complexity of Simultaneous Elementary Matching Problems.
J. Autom. Reason.
Miki Hermann, Phokion G. Kolaitis
1999 B conf
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System.
LPAR
Miki Hermann, Laurent Juban, Phokion G. Kolaitis
1999 B conf
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.
MFCS
Arnaud Durand, Miki Hermann, Laurent Juban
1998 B conf
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations.
MFCS
Miki Hermann, Gernot Salzer
1997 A conf
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups.
CP
Miki Hermann, Phokion G. Kolaitis
1997 — conf
Set Operations for Recurrent Term Schematizations.
TAPSOFT
Ali Amaniss, Miki Hermann, Denis Lugiez
1997 J jnl
Unification of Infinite Sets of Terms Schematized by Primal Grammars.
Theor. Comput. Sci.
Miki Hermann, Roman Galbavý
1996 J jnl
Complexity of Generalized Satisfiability Counting Problems.
Inf. Comput.
Nadia Creignou, Miki Hermann
1996 A conf
Unification Algorithms Cannot be Combined in Polynomial Time.
CADE
Miki Hermann, Phokion G. Kolaitis
1995 B conf
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract).
MFCS
Miki Hermann, Phokion G. Kolaitis
1995 J jnl
The Complexity of Counting Problems in Equational Matching.
J. Symb. Comput.
Miki Hermann, Phokion G. Kolaitis
1994 A conf
The Complexity of Counting Problems in Equational Matching.
CADE
Miki Hermann, Phokion G. Kolaitis
1992 — conf
On the Relation Between Primitive Recursion, Schematization and Divergence.
ALP
Miki Hermann
1991 J jnl
Implementations of Term Rewriting Systems.
Comput. J.
Miki Hermann, Claude Kirchner, Hélène Kirchner
1991 — conf
On Proving Properties of Completion Strategies.
RTA
Miki Hermann
1990 J jnl
Chain Properties of Rule Closures.
Formal Aspects Comput.
Miki Hermann
1990 — conf
Meta-rule Synthesis from Crossed Rewrite Systems.
CTRS
Hélène Kirchner, Miki Hermann
1989 A conf
Chain Properties of Rule Closures.
STACS
Miki Hermann
1986 A* conf
On Nontermination of Knuth-Bendix Algorithm.
ICALP
Miki Hermann, Igor Prívara