MaxPlanckInstitut für InformatikOverview
Publication Timeline
Most widely held works by
MaxPlanckInstitut für Informatik
Journal of the IGPL
by Interest Group in Pure and Applied Logics
(
)
in English and held by 187 WorldCat member libraries worldwide
Bulletin of the IGPL
by Interest Group in Pure and Applied Logics
(
)
in English and held by 35 WorldCat member libraries worldwide
Classical vs nonclassical 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."
Genetic algorithms within the framework of evolutionary computation : proceedings of the KI94 workshop
(
Book
)
3 editions published in 1994 in English and German and held by 9 WorldCat member libraries worldwide
Exact ground states of Ising spin glasses : new experimental results with a branch and cut algorithm
(
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 2dimensional 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 areauniversal graphs
by MaxPlanckInstitut 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)."
Hammockonears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
by MaxPlanckInstitut 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 onears decomposition. We mention that hammockonears 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 nvertex, medge graph or digraph. The hammockonears 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."
A framework for program development based on schematic proof
(
Book
)
3 editions published in 1993 in English and German and held by 8 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."
A multidimensional terminological knowledge representation language : preliminary version
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 KLONElike terminological reasoning is presented. The extension includes multimodal 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."
Workshop on theorem proving with analytic tableaux and related methods : Marseille, France, April 2830, 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
(
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]
Basic paramodulation
(
Book
)
3 editions published in 1993 in English and German and held by 8 WorldCat member libraries worldwide Abstract: "We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspired by the basic strategy for narrowing), in which paramodulation inferences are forbidden at terms introduced by substitutions from previous inference steps. In addition we introduce restrictions based on term selection rules and redex orderings, which are general criteria for delimiting the terms which are available for inferences. These refinements are compatible with standard ordering restrictions and are complete without paramodulation into variables or using functional reflexivity axioms
Searching, sorting and randomised algorithms for central elements and ideal counting in posets
by MaxPlanckInstitut 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 informationtheoretic lower bound of log N comparisons (where N is the number of orderideals 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."
Fast parallel space allocation, estimation and integer sorting
by Holger Bast
(
Book
)
2 editions published between 1991 and 1993 in English and held by 8 WorldCat member libraries worldwide Abstract: "The following problems are shown to be solvable in O(log*n) time with optimal speedup with high probability on a randomized CRCW PRAM using O(n) space: Space allocation: Given n nonnegative integers x₁ ..., x[subscript n], allocate n nonoverlapping blocks of consecutive memory cells of sizes x₁ ..., x[subscript n] from a base segment of [formula] consecutive memory cells; Estimation: Given n integers in the range 1..n, compute 'good' estimates of the number of occurrences of each value in the range 1..n; Semisorting: Given n integers x₁ ..., x[subscript n] in the range 1..n, store the integers 1 ..., n in an array of O(n) cells such that for all i [element of] [1 ..., n], all elements of [j : 1 [<or =] j [<or =] n and x[subscript j] = i] occur together, separated only by empty cells; Integer chainsorting: Given n integers x₁ ..., x[subscript n] in the range 1..n, construct a linked list containing the integers 1 ..., n such that for all i, j [element of] [1 ... n], if i precedes j in the list, then x[subscript i] [<or =] x[subscript j]. Moreover, given slightly superlinear processor and space bounds, these problems or variations of them can be solved in constant time with high probability. As a corollary of the integer chainsorting result, it follows that n integers in the range 1..n can be sorted in O(log n/log log n) time with optimal speedup with high probability."
Static and dynamic algorithms for kpoint clustering problems
by MaxPlanckInstitut 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 dspace 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."
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 concurrentread concurrentwrite 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
Simple randomized algorithms for closest pair problems
(
Book
)
2 editions published in 1992 in German and English and held by 7 WorldCat member libraries worldwide Abstract: "We present a conceptually simple, randomized incremental algorithm for finding the closest pair in a set of n points in Ddimensional space, where D [> or =] 2 is a fixed constant. Using dynamic perfect hashing, the algorithm runs in O(n) expected time. In addition to being quick on the average, this algorithm is reliable: we show that it runs in O(n log n/log log n) time with high probability."
Computing a largest empty anchored cylinder, and related problems
(
Book
)
3 editions published in 1995 in English and German and held by 7 WorldCat member libraries worldwide
The thickness of a minor excluded class of graphs
(
Book
)
2 editions published in 1995 in English and held by 7 WorldCat member libraries worldwide Abstract: "The thickness problem on graphs is NPhard 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 wellknown 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."
Temporal logic : mathematical foundations
by Dov M Gabbay
(
Book
)
2 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide Abstract: "This is a preliminary version of chapters 713 of volume one of the book 'Temporal Logic: Mathematical Foundations and Computational Aspects' which is an attempt to provide a comprehensive coverage of temporal logic as a topic which generates problems of general mathematical interest, which has many practical applications to computer science and linguistics and which is a source of various complex problems of computation and implementation. The report is the continuation of MPI Report MPII92213 which contains draft versions of chapters 16. Chapter 14 on temporalisation and 15 on decidability as well as perhaps volume two will appear in future reports more
fewer
Audience Level
Related Identities
Associated Subjects
Automatic theorem proving Branch and bound algorithms Cluster analysis Combinatorial optimization Computer software Data structures (Computer science) Decomposition (Mathematics) Genetic algorithms Graph theory Knowledge representation (Information theory) Logic Logic, Symbolic and mathematical Logic programming Parallel processing (Electronic computers) Sorting (Electronic computers)

Alternative Names
MaxPlanckInstitut Informatik
MaxPlanckInstitut Informatik Saarbrücken
MPII
MPII Abkuerzung
MPI Informatik
MPI Informatik Saarbrücken
PlanckInstitut für Informatik
PlanckInstitut für Informatik Saarbrücken
Languages
