#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1986

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nadia Creignou, Miki Hermann
- Inf. Comput.
- 1996

The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the complexity of satisfiability problems with special conditions. The complexity of each decision and counting problem in this class depends on the involved logical relations. In 1979, Valiant defined the class *P, the class of functions… (More)

- Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
- MFCS
- 2000

We introduce and investigate a new type of reductions between counting problems, which we call subtractive reductions. We show that the main counting complexity classes #P, #NP, as well as all higher counting complexity classes # · kP, k 2, are closed under subtractive reductions. We then pursue problems that are complete for these classes via subtractive… (More)

- Miki Hermann, Roman Galbavý
- Theor. Comput. Sci.
- 1997

Innnite sets of terms appear frequently at diierent places in computer science. On the other hand, several practically oriented parts of logic and computer science require the manipulated objects to be nite or nitely representable. Schematizations present a suitable formalism to manipulate nitely innnite sets of terms. Since schematizations provide a… (More)

- Miki Hermann, Reinhard Pichler
- IJCAI
- 2007

Abduction is an important method of non-monotonic reasoning with many applications in AI and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. Decision problems of great interest are the existence and the relevance problems. The complexity of these decision problems… (More)

- Miki Hermann
- Formal Aspects of Computing
- 1989

This article introduces a generalisation of the crossed rule approach to the detection of Knuth-Bendix completion procedure divergence. It introduces closure chains, which are special rule closures constructed by means of particular substitution operations and operators, as a suitable formalism for progress in this direction. Supporting substitution algebra… (More)

- Manuel Bodirsky, Miki Hermann, Florian Richoux
- CiE
- 2009

Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE or complete for the class CSP(Γ )NP under deterministic polynomial-time many-one reductions. Here, CSP(Γ )NP is the class of problems that can be reduced to the constraint… (More)

- M. HERMANN, F. STRATMANN, M. WILCK, A. WIEDENSOHLER

When sampling aerosol particles from aircraft, the inlet system is the most critical item because it can strongly modify the number concentration, size distribution, and chemical composition of the particles. In this investigation, the authors describe a new aircraft-borne aerosol inlet and its sampling characteristics for submicrometer particle… (More)

- Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
- ISAAC
- 2012

- Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
- LPNMR
- 2007

Reiter’s default logic formalizes nonmonotonic reasoning using default assumptions. The semantics of a given instance of default logic is based on a fixpoint equation defining an extension. Three different reasoning problems arise in the context of default logic, namely the existence of an extension, the presence of a given formula in an extension, and the… (More)

- Miki Hermann, Reinhard Pichler
- JELIA
- 2008

Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. We have recently started to study the counting complexity of propositional abduction. However, several… (More)