WorldCat Identities

Max-Planck-Institut für Informatik

Overview
Works: 432 works in 494 publications in 2 languages and 1,800 library holdings
Genres: Periodicals  Conference papers and proceedings 
Classifications: QA76.6, 511.3
Publication Timeline
.
Most widely held works by Max-Planck-Institut für Informatik
Journal of the IGPL by Interest Group in Pure and Applied Logics( )

in English and held by 235 WorldCat member libraries worldwide

Bulletin of the IGPL by Interest Group in Pure and Applied Logics( )

in English and held by 36 WorldCat member libraries worldwide

Classical vs non-classical logics : the universality of classical logic by Dov M Gabbay( Book )

3 editions published in 1993 in English and held by 12 WorldCat member libraries worldwide

Abstract: "This report investigates the question of the universality of classical logic. The approach is to show that an almost arbitrary logical system can be translated reasonably intuitively and almost automatically into classical logic. The path leading to this result goes through the analysis of what is reasonable logic, how to find semantics for it, how to build a labelled deductive system (LDS) for it, how to translate a LDS into classical logic and how to automate the process using SCAN. This report relies on other papers, published and/or to be published as explained in the acknowledgements."
Temporal logic : first international conference, ICTL '94, Bonn, Germany, July 11-14, 1994 : proceedings by Dov M Gabbay( Book )

3 editions published in 1992 in English and held by 11 WorldCat member libraries worldwide

In chapter 7, by looking at some specific examples of axiomatisation and expressive completeness of two and three dimensional logics, we illustrate some of the technical issues involved with many- dimensional logics. Chapter 8 introduces the idea of propositional quantifiers in temporal logic and examines the properties of a very useful fixed point language. In chapter 9 we show how the property of separation is related to expressive completeness so that in chapter 10 we can infer the expressive completeness of languages with until and since over various classes of flows of time. In chapter 11 we use separation to prove the expressive completeness of the Stavi connectives over the class of linear flows. Chapter 12 contains a direct proof of the same result and also considers languages appropriate to flows with 'gaps' in them
Genetic algorithms within the framework of evolutionary computation : proceedings of the KI-94 workshop( Book )

2 editions published in 1994 in English and held by 9 WorldCat member libraries worldwide

Exact ground states of ising spin glasses: new experimental results with a branch and cut algorithm by C De Simone( Book )

4 editions published between 1994 and 1995 in English and German and held by 9 WorldCat member libraries worldwide

Abstract: "In this paper we study 2-dimensional Ising spin glasses on a grid with nearest neighbor and periodic boundary interactions, based on a Gaussian bond distribution, and an exterior magnetic field. We show how using a technique called branch and cut, the exact ground states of grids of sizes up to 100 x 100 can be determined in a moderate amount of computation time, and we report on extensive computational tests. With our method we produce results based on more than 20000 experiments on the properties of spin glasses whose errors depend only on the assumptions on the model and not on the computational process. This feature is a clear advantage of the method over other more popular ways to compute the ground state, like Monte Carlo simulation including simulated annealing, evolutionary, and genetic algorithms, that provide only approximate ground states with a degree of accuracy that cannot be determined a priori. Our ground state energy estimation at zero field is -1.317."
A Lower bound for area-universal graphs by Max-Planck-Institut für Informatik( Book )

3 editions published in 1993 in English and German and held by 8 WorldCat member libraries worldwide

Abstract: "We establish a lower bound on the efficiency of area- universal circuits. The area A[subscript u] of every graph H that can host any graph G of area (at most) A with dilation d, and congestion c [<or =] [square root of A]/log log A satisfies the tradeoff A[subscript u] = [omega](A log A/(c²log(2d))). In particular, if A[subscript u] = O(A) then max (c, d) = [omega]([square root of log A]/log log A)."
Searching, sorting and randomised algorithms for central elements and ideal counting in posets by Max-Planck-Institut für Informatik( Book )

3 editions published in 1993 in English and German and held by 8 WorldCat member libraries worldwide

Abstract: "By the Central Element Theorem of Linial and Saks, it follows that for the problem of (generalised) searching in posets, the information-theoretic lower bound of log N comparisons (where N is the number of order-ideals in the poset) is tight asymptotically. We observe that this implies that the problem of (generalised) sorting in posets has complexity [theta](n * log N) (where n is the number of elements in the poset). We present schemes for (efficiently) transforming a randomised generation procedure for central elements (which often exists for some classes of posets) into randomised procedures for approximately counting ideals in the poset and for testing if an arbitrary element is central."
Basic paramodulation by Leo Bachmair( Book )

3 editions published in 1993 in English and German and held by 8 WorldCat member libraries worldwide

We prove refutational completeness in the context of deletion rules, such as simplification by rewriting (demodulation) and subsumption, and of techniques for eliminating redundant inferences."
Static and dynamic algorithms for k-point clustering problems by Max-Planck-Institut für Informatik( Book )

3 editions published in 1993 in English and German and held by 8 WorldCat member libraries worldwide

Abstract: "Let S be a set of n points in d-space and let 1 [<or =] k [<or =] n be an integer. A unified approach is given for solving the problem of finding a subset of S of size K that minimizes some closeness measure, such as the diameter, perimeter or the circumradius. Morover, data structures are given that maintain such a subset under insertions and deletions of points."
A multi-dimensional terminological knowledge representation language by Franz Baader( Book )

2 editions published between 1993 and 1995 in English and held by 8 WorldCat member libraries worldwide

Abstract: "An extension of the concept description language ALC used in KL-ONE-like terminological reasoning is presented. The extension includes multi-modal operators that can either stand for the usual role quantifications or for modalities such as belief, time etc. The modal operators can be used at all levels of the concept terms, and they can be used to modify both concepts and roles. This is an instance of a new kind of combination of modal logics where the modal operators of one logic may operate directly on the operators of the other logic. Different versions of this logic are investigated and various results about decidability and undecidability are presented. The main problem, however, decidability of the basic version of the logic, remains open."
Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems by Max-Planck-Institut für Informatik( Book )

3 editions published in 1994 in English and German and held by 8 WorldCat member libraries worldwide

Abstract: "We show how to decompose efficiently in parallel any graph into a number, [̃gamma], of outerplanar subgraphs (called hammocks) satisfying certain separator properties. Our work combines and extends the sequential hammock decomposition technique introduced by G. Frederickson and the parallel ear decomposition technique, thus we call it the hammock- on-ears decomposition. We mention that hammock-on-ears decomposition also draws from techniques in computational geometry and that an embedding of the graph does not need to be provided with the input. We achieve this decomposition in O(log n log log n) time using O(n + m) CREW PRAM processors, for an n-vertex, m-edge graph or digraph. The hammock-on-ears decomposition implies a general framework for solving graph problems efficiently. Its value is demonstrated by a variety of applications on a significant class of (di)graphs, namely that of sparse (di)graphs. This class consists of all (di)graphs which have a [̃gamma] between 1 and [theta](n), and includes planar graphs and graphs with genus o(n). We improve previous bounds for certain instances of shortest paths and related problems, in this class of graphs. These problems include all pairs shortest paths, all pairs reachability, and detection of a negative cycle."
Workshop on theorem proving with analytic tableaux and related methods : Marseille, France, April 28-30, 1993 by 1993, Marseille> Workshop on Theorem Proving with Analytic Tableaux and Related Methods <2( Book )

2 editions published in 1993 in German and English and held by 8 WorldCat member libraries worldwide

Lower bounds for set intersection queries by P Dietz( Book )

2 editions published in 1992 in German and English and held by 8 WorldCat member libraries worldwide

Abstract: "We consider the following set intersection reporting problem. We have a collection of initially empty sets and would like to process an intermixed sequence of n updates (insertions into and deletions from individual sets) and q queries (reporting the intersection of two sets). We cast this problem in the arithmetic model of computation of Fredman [Fre81] and Yao [Yao85] and show that any algorithm that fits in this model must take time [omega](q + n[square root of]q) to process a sequence of n updates and q queries, ignoring factors that are polynomial in log n. We show that this bound is tight in this model of computation, again to within a polynomial in log n factor, improving upon a result of Yellin [Yel92]
A framework for program development based on schematic proof by D Basin( Book )

2 editions published in 1993 in English and held by 7 WorldCat member libraries worldwide

Abstract: "Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. The difference involves often only a slight shift of perspective: admitting metavariables into proofs. We propose that such calculi should be implemented in logical frameworks that support this kind of proof construction and that such an implementation can unify program verification and synthesis. Our proposal is illustrated with a worked example developed in Paulson's Isabelle system. We also give examples of existent calculi that are closely related to the methodology we are proposing and others that can be profitably recast using our approach."
The thickness of a minor excluded class of graphs by M Jünger( Book )

2 editions published in 1995 in English and held by 7 WorldCat member libraries worldwide

Abstract: "The thickness problem on graphs is NP-hard and only few results concerning this graph invariant are known. Using a decomposition theorem of Truemper, we show that the thickness of the class of graphs without G₁₂-minors is less than or equal to two (and therefore, the same is true for the more well-known class of the graphs without k₅- minors). Consequently, the thickness of this class of graphs can be determined with a planarity testing algorithm in linear time."
Max Planck Center for visual computing and communication : 01.07.2003 - 30.06.2009 ; Abschlussbericht ; BMBF-Fördervorhaben: MPII-VCC( )

2 editions published in 2010 in German and held by 7 WorldCat member libraries worldwide

Approximate and exact deterministic parallel selection by Shiva Chaudhuri( Book )

2 editions published in 1993 in English and held by 7 WorldCat member libraries worldwide

Abstract: "The selection problem of size n is, given a set of n elements drawn from an ordered universe and an integer r with 1 [<or =] r [<or =] n, to identify the rth smallest element in the set. We study approximate and exact selection on deterministic concurrent-read concurrent-write parallel RAMs, where approximate selection with relative accuracy [lambda]> 0 asks for any element whese true rank differs from r by at most [lambda]n. Our main results are: (1) For all t [> or =] (log log n)⁴, approximate selection problems of size n can be solved in O(t) time with optimal speedup with relative accuracy 2[superscript -t/(log log n)⁴]; no deterministic PRAM algorithm for approximate selection with a running time below [theta](log n/log log n) was previously known
Labelled superposition for PLTL by M Suda( )

1 edition published in 2012 in English and held by 0 WorldCat member libraries worldwide

Finding Images of Rare and Ambiguous Entities by Bilyana Taneva( )

1 edition published in 2011 in English and held by 0 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.65 (from 0.51 for Journal of ... to 0.95 for Finding Im ...)

Alternative Names
Institut Max-Planck d'informatique

Instytut Informatyki im. Maxa Plancka

Max Planck Bilişim Enstitüsü

Max-Planck-Institut für Informatik

Max-Planck-Institut Informatik

Max-Planck-Institut Informatik Saarbrücken

Max Planck Institute for Computer Science

MPI-I

MPI Informatik

MPI Informatik Saarbrücken

MPII

Planck-Institut für Informatik

Planck-Institut für Informatik Saarbrücken

Институт информатики общества Макса Планка

马克斯·普朗克计算机科学研究所

Languages
English (38)

German (10)