Miki Hermann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 55 from 55

2024

Primal Grammars Driven Automated InductionAdel Bouhoula, Miki Hermann. IJCAI 2024: 3259-3269 [doi]

2021

How to Find the Exit from a 3-Dimensional MazeMiki Hermann. wea 2021: [doi]

MCP: Capturing Big Data by Satisfiability (Tool Description)Miki Hermann, Gernot Salzer. sat 2021: 207-215 [doi]

2019

Minimal Distance of Propositional ModelsMike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. mst, 63(6):1131-1184, 2019. [doi]

2016

The Next Whisky BarMike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. csr 2016: 41-56 [doi]

As Close as It GetsMike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. walcom 2016: 222-235 [doi]

2015

Give Me Another One!Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. isaac 2015: 664-676 [doi]

2013

Complexity of existential positive first-order logicManuel Bodirsky, Miki Hermann, Florian Richoux. logcom, 23(4):753-760, 2013. [doi]

2012

Trichotomies in the Complexity of Minimal InferenceArnaud Durand, Miki Hermann, Gustav Nordh. mst, 50(3):446-491, 2012. [doi]

Counting Partitions of GraphsPavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi. isaac 2012: 227-236 [doi]

2010

The Helly property and satisfiability of Boolean formulas defined on set familiesVictor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer. ejc, 31(2):502-516, 2010. [doi]

Counting complexity of propositional abductionMiki Hermann, Reinhard Pichler. jcss, 76(7):634-649, 2010. [doi]

2009

2008

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed LogicsVictor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer. ismvl 2008: 100-105 [doi]

Complexity of Clausal Constraints Over ChainsNadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer. mst, 42(2):239-255, 2008. [doi]

On the counting complexity of propositional circumscriptionArnaud Durand, Miki Hermann. ipl, 106(4):164-170, 2008. [doi]

On Boolean primitive positive clonesMiki Hermann. DM, 308(15):3151-3162, 2008. [doi]

On the Complexity of Computing Generators of Closed SetsMiki Hermann, Baris Sertkaya. icfca 2008: 158-168 [doi]

Complexity of Counting the Optimal SolutionsMiki Hermann, Reinhard Pichler. cocoon 2008: 149-159 [doi]

Counting Complexity of Minimal Cardinality and Minimal Weight AbductionMiki Hermann, Reinhard Pichler. jelia 2008: 206-218 [doi]

Complexity of Counting the Optimal SolutionsMiki Hermann, Reinhard Pichler. eccc, 15(044), 2008. [doi]

Efficient Algorithms for Description Problems over Finite Totally Ordered DomainsÀngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini. SICOMP, 38(3):922-945, 2008. [doi]

2007

Complexity of Default Logic on Generalized Conjunctive QueriesPhilippe Chapdelaine, Miki Hermann, Ilka Schnoor. lpnmr 2007: 58-70 [doi]

Counting Complexity of Propositional AbductionMiki Hermann, Reinhard Pichler. IJCAI 2007: 417-422 [doi]

2005

Subtractive reductions and complete problems for counting complexity classesArnaud Durand, Miki Hermann, Phokion G. Kolaitis. TCS, 340(3):496-513, 2005. [doi]

2004

2003

The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-CompleteArnaud Durand, Miki Hermann. STACS 2003: 451-462 [doi]

2002

On the complexity of recognizing the Hilbert basis of a linear diophantine systemArnaud Durand, Miki Hermann, Laurent Juban. TCS, 270(1-2):625-642, 2002. [doi]

2000

Subtractive Reductions and Complete Problems for Counting Complexity ClassesArnaud Durand, Miki Hermann, Phokion G. Kolaitis. mfcs 2000: 323-332 [doi]

Unification Algorithms Cannot Be Combined in Polynomial TimeMiki Hermann, Phokion G. Kolaitis. iandc, 162(1-2):24-42, 2000.

1999

On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine SystemArnaud Durand, Miki Hermann, Laurent Juban. mfcs 1999: 92-102

Computational Complexity of Simultaneous Elementary Matching ProblemsMiki Hermann, Phokion G. Kolaitis. JAR, 23(2):107-136, 1999.

On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine SystemMiki Hermann, Laurent Juban, Phokion G. Kolaitis. lpar 1999: 13-32

1998

On the Word, Subsumption, and Complement Problem for Recurrent Term SchematizationsMiki Hermann, Gernot Salzer. mfcs 1998: 257-266 [doi]

1997

Set Operations for Recurrent Term SchematizationsAli Amaniss, Miki Hermann, Denis Lugiez. tapsoft 1997: 333-344

Unification of Infinite Sets of Terms Schematized by Primal GrammarsMiki Hermann, Roman Galbavý. TCS, 176(1-2):111-158, 1997. [doi]

On the Complexity of Unification and Disunification in Commutative Idempotent SemigroupsMiki Hermann, Phokion G. Kolaitis. cp 1997: 282-296

1996

Complexity of Generalized Satisfiability Counting ProblemsNadia Creignou, Miki Hermann. iandc, 125(1):1-12, 1996.

Unification Algorithms Cannot be Combined in Polynomial TimeMiki Hermann, Phokion G. Kolaitis. cade 1996: 246-260

1995

The Complexity of Counting Problems in Equational MatchingMiki Hermann, Phokion G. Kolaitis. JSC, 20(3):343-362, 1995.

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)Miki Hermann, Phokion G. Kolaitis. mfcs 1995: 359-370

1994

The Complexity of Counting Problems in Equational MatchingMiki Hermann, Phokion G. Kolaitis. cade 1994: 560-574

1992

On the Relation Between Primitive Recursion, Schematization and DivergenceMiki Hermann. icalp 1992: 115-127

1991

Implementations of Term Rewriting SystemsMiki Hermann, Claude Kirchner, Hélène Kirchner. cj, 34(1):20-33, 1991.

On Proving Properties of Completion StrategiesMiki Hermann. RTA 1991: 398-410

1990

Chain Properties of Rule ClosuresMiki Hermann. fac, 2(3):207-225, 1990.

Meta-rule Synthesis from Crossed Rewrite SystemsHélène Kirchner, Miki Hermann. ctrs 1991: 143-154

1989

Chain Properties of Rule ClosuresMiki Hermann. STACS 1989: 339-347

1986

On Nontermination of Knuth-Bendix AlgorithmMiki Hermann, Igor Prívara. icalp 1986: 146-156

Sign in or sign up to see more results.

runs on WebDSL

翻译：