MaxPlanckInstitut für Informatik
Overview
Works:  425 works in 485 publications in 2 languages and 1,702 library holdings 

Genres:  Periodicals 
Classifications:  BC1, 511.305 
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 201 WorldCat member libraries worldwide
in English and held by 201 WorldCat member libraries worldwide
Bulletin of the IGPL by
Interest Group in Pure and Applied Logics(
)
in English and held by 45 WorldCat member libraries worldwide
in English and held by 45 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."
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."
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 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."
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."
Genetic algorithms within the framework of evolutionary computation : proceedings of the KI94 workshop(
Book
)
2 editions published in 1994 in English and held by 9 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 9 WorldCat member libraries worldwide
A multidimensional 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 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. 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."
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. 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."
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
2 editions published in 1993 in German and English and held by 8 WorldCat member libraries worldwide
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."
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."
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."
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."
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
Furthermore we consider the case q = O(n) with an additional space restriction. We only allow to use m memory locations, where m [<or =] n[superscript 3/2]. We show a tight bound of [theta](n²m[superscript 1/3]) for a sequence of O(n) operations, again ignoring polynomial in log n factors."
2 editions published in 1992 in German and English and held by 8 WorldCat member libraries worldwide
Furthermore we consider the case q = O(n) with an additional space restriction. We only allow to use m memory locations, where m [<or =] n[superscript 3/2]. We show a tight bound of [theta](n²m[superscript 1/3]) for a sequence of O(n) operations, again ignoring polynomial in log n factors."
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."
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."
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."
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."
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)."
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)."
A framework for program development based on schematic proof by D Basin(
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."
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."
On embeddings in cycles by
Juraj Hromkovič(
Book
)
3 editions published in 1991 in English and German and held by 7 WorldCat member libraries worldwide
Abstract: "We prove exact results on dilations in cycles for important parallel computer interconnection networks as complete trees, hypercubes and 2 and 3dimensional meshes. Moreover we show that trees, Xtrees, ndimensional meshes, pyramides [sic] and trees of meshes have the same dilations both in the path and the cycle."
3 editions published in 1991 in English and German and held by 7 WorldCat member libraries worldwide
Abstract: "We prove exact results on dilations in cycles for important parallel computer interconnection networks as complete trees, hypercubes and 2 and 3dimensional meshes. Moreover we show that trees, Xtrees, ndimensional meshes, pyramides [sic] and trees of meshes have the same dilations both in the path and the cycle."
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 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."
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."
Simple randomized algorithms for closest pair problems by Mordecai Golin(
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."
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."
Temporal logic : mathematical foundations by
Dov M Gabbay(
Book
)
2 editions published in 1992 in English and held by 7 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
2 editions published in 1992 in English and held by 7 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
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
(2) Exact selection problems of size n can be solved in O(log n/log log n) time with O(n log log n/log n) processors. This running time is the best possible (using only a polynomial number of processors), and the number of processors is optimal for the given running time (optimal speedup); the best previous algorithm achieves optimal speedup with a running time of O(log n log [superscript *]n/log log n)."
2 editions published in 1993 in English and held by 7 WorldCat member libraries worldwide
(2) Exact selection problems of size n can be solved in O(log n/log log n) time with O(n log log n/log n) processors. This running time is the best possible (using only a polynomial number of processors), and the number of processors is optimal for the given running time (optimal speedup); the best previous algorithm achieves optimal speedup with a running time of O(log n log [superscript *]n/log log n)."
Optimal embedding of a toroidal mesh in a path by
M Paterson(
Book
)
3 editions published in 1991 in English and German and held by 6 WorldCat member libraries worldwide
Abstract: "We prove that the dilation of an m X n toroidal mesh in an mnvertex path equals 2 min[m, n], if m [does not equal] n and 2n  1, if m = n."
3 editions published in 1991 in English and German and held by 6 WorldCat member libraries worldwide
Abstract: "We prove that the dilation of an m X n toroidal mesh in an mnvertex path equals 2 min[m, n], if m [does not equal] n and 2n  1, if m = n."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Interest Group in Pure and Applied Logics
 Imperial College of Science, Technology and Medicine
 Smid, Michiel Author
 Mehlhorn, Kurt 1949 Author Editor Creator
 Basin, David A. Author
 Hagerup, Torben Author
 Ohlbach, Hans Jürgen Author Editor
 Bachmair, Leo Author Creator
 Gabbay, Dov M. 1945 Author
 Ganzinger, H. (Harald) 1950 Author
Useful Links
Associated Subjects
Automatic theorem proving Branch and bound algorithms Cluster analysis Combinatorial optimization Computer architecture Computer software 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
Institut MaxPlanck d'informatique
Instytut Informatyki im. Maxa Plancka
Max Planck Bilişim Enstits
MaxPlanckInstitut Informatik
MaxPlanckInstitut Informatik Saarbrcken
Max Planck Institute for Computer Science
MPII
MPI Informatik
MPI Informatik Saarbrcken
MPII
PlanckInstitut fr Informatik
PlanckInstitut fr Informatik Saarbrcken
Институт информатики общества Макса Планка
马克斯普朗克计算机科学研究所
Languages