MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Miki Hermann – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

21 documents found, showing 1 through 10. Next 10 →

ATOM

On the Complexity of Computing Generators of Closed Sets
by Miki Hermann
…On the Complexity of Computing Generators of Closed Sets Miki Hermann 1 and Barı¸s Sertkaya 2 1…
Add To MetaCart

Chain Properties of Rule Closures
by Miki Hermann — 1990 — Formal Aspects of Computing
…Chain Properties of Rule Closures Miki HERMANN Centre de Recherche en Informatique de Nancy CNRS…
Cited by 5 (2 self) – Add To MetaCart

Overview of Existing Recurrent Schematizations
by Miki Hermann — 1996 — Proc. of the CADE-13 Workshop on Term Schematization and their Applications
…Overview of Existing Recurrent Schematizations Miki Hermann CRIN (CNRS) and INRIA-Lorraine Campus…
Cited by 1 (0 self) – Add To MetaCart

On the Relation Between Primitive Recursion, Schematization, and Divergence
by Miki Hermann — 1992 — Proceeding 3rd Conference on Algebraic and Logic Programming, Volterra (Italy), volume 632 of Lecture Notes in Computer Science
…On the Relation Between Primitive Recursion, Schematization, and Divergence Miki HERMANN CRIN…
Cited by 4 (2 self) – Add To MetaCart

Vademecum of Divergent Term Rewriting Systems
by Miki Hermann — 1990 — CRIN, Research Report
…Vademecum of Divergent Term Rewriting Systems Miki HERMANN Centre de Recherche en Informatique…
Cited by 4 (1 self) – Add To MetaCart

Complexity of default logic on generalized conjunctive queries
by Miki Hermann, Ilka Schnoor — 2007 — In Proc. 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’07
…The Complexity of Default Logic on Generalized Conjunctive Queries ⋆ Philippe Chapdelaine 1 , Miki…
Cited by 1 (0 self) – Add To MetaCart

Counting complexity of propositional abduction
by Miki Hermann, École Polytechnique — 2007 — In Proc. 20th International Joint Conference on Artificial Intelligence (IJCAI’07
…Counting Complexity of Propositional Abduction Miki Hermann LIX (CNRS, UMR 7161) École…
Cited by 1 (0 self) – Add To MetaCart

On the Word, Subsumption, and Complement Problems for Recurrent Term Schematizations
by Miki Hermann, Gernot Salzer — 1998 — In
…On the Word, Subsumption, and Complement Problems for Recurrent Term Schematizations Miki Hermann…
Cited by 2 (0 self) – Add To MetaCart

On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations
by Extend Ed, Miki Hermann, Gernot Salzer — 1998 — In
… Abstract) Miki Hermann 1 and Gernot Salzer 2 1 LORIA (CNRS), BP 239, 54506 Vandoeuvre…
Add To MetaCart

Second International Workshop on Complexity in Automated Deduction
by Georg Gottlob, Miki Hermann, Michael Rusinowitch — 2002
…This paper determines the complexity of a constraint model-based proof of the envelope of a tendency in the dynamics of a Multi-Agent-based simulation model. The proof is performed via a constraint model-based exploration of simulation trajectories using forward inference, by means of which a whole …
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB