Bockmayr, Alexander
Overview
Works: | 43 works in 87 publications in 2 languages and 254 library holdings |
---|---|
Genres: | Academic theses |
Roles: | Author, Contributor, Other, Editor, Opponent, Thesis advisor |
Publication Timeline
.
Most widely held works by
Alexander Bockmayr
Beiträge zur Theorie des logisch-funktionalen Programmierens by
Alexander M Bockmayr(
Book
)
5 editions published in 1990 in German and Undetermined and held by 28 WorldCat member libraries worldwide
5 editions published in 1990 in German and Undetermined and held by 28 WorldCat member libraries worldwide
Narrowing strategies for arbitrary canonical rewrite systems by
A Bockmayr(
Book
)
6 editions published in 1993 in English and German and held by 26 WorldCat member libraries worldwide
Abstract: "Narrowing is a universal unification procedure for equational theories defined by a canonical term rewriting system. In its original form it is extremely inefficient. Therefore, many optimizations have been proposed during the last years. In this paper, we present the narrowing strategies for abitrary canonical systems in a uniform framework and introduce the new narrowing strategy LSE narrowing. LSE narrowing is complete and improves all other strategies which are complete for arbitrary canonical systems. It is optimal in the sense that two different LSE narrowing derivations cannot generate the same narrowing substitution. Moreover, LSE narrowing computes only normalized narrowing substitutions."
6 editions published in 1993 in English and German and held by 26 WorldCat member libraries worldwide
Abstract: "Narrowing is a universal unification procedure for equational theories defined by a canonical term rewriting system. In its original form it is extremely inefficient. Therefore, many optimizations have been proposed during the last years. In this paper, we present the narrowing strategies for abitrary canonical systems in a uniform framework and introduce the new narrowing strategy LSE narrowing. LSE narrowing is complete and improves all other strategies which are complete for arbitrary canonical systems. It is optimal in the sense that two different LSE narrowing derivations cannot generate the same narrowing substitution. Moreover, LSE narrowing computes only normalized narrowing substitutions."
KA-Prolog: Sprachdefinition by
Nannette Lindenberg(
Book
)
4 editions published between 1987 and 1991 in German and held by 18 WorldCat member libraries worldwide
4 editions published between 1987 and 1991 in German and held by 18 WorldCat member libraries worldwide
How to realize LSE narrowing by Andreas Werner(
Book
)
4 editions published between 1993 and 1998 in English and German and held by 18 WorldCat member libraries worldwide
4 editions published between 1993 and 1998 in English and German and held by 18 WorldCat member libraries worldwide
Extended Prolog with Boolean unification by
A Bockmayr(
Book
)
3 editions published in 1989 in German and English and held by 13 WorldCat member libraries worldwide
3 editions published in 1989 in German and English and held by 13 WorldCat member libraries worldwide
Conditional rewriting and narrowing as a theoretical framework for logic-functional programming a survey by
Alexander Bockmayr(
Book
)
5 editions published in 1986 in English and German and held by 11 WorldCat member libraries worldwide
5 editions published in 1986 in English and German and held by 11 WorldCat member libraries worldwide
ERASysApp2 - Verbundprojekt: Robustyeast - Optimierung der Stoffwechselregulation in Hefestämmen für dynamische Produktionsbedingungen
- Deutsches Teilprojekt B Schlussbericht : Laufzeit des Vorhabens: 01.12.2015-31.03.2019 by
Alexander Bockmayr(
)
1 edition published in 2019 in German and held by 11 WorldCat member libraries worldwide
1 edition published in 2019 in German and held by 11 WorldCat member libraries worldwide
On the Chvátal rank of polytopes in the 0/1 cube by
Alexander Bockmayr(
Book
)
3 editions published in 1997 in English and held by 10 WorldCat member libraries worldwide
Abstract: "Given a polytope P [subset] R[superscript n], the Chvátal-Gomory procedure computes iteratively the integer hull P[subscript I] of P. The Chvátal rank of P is the minimal number of iterations needed to obtain P[subscript I]. It is always finite, but already the Chvátal rank of polytopes in R² can be arbitrarily large. In this paper, we study polytopes in the 0/1 cube, which are of particular interest in combinatorial optimization. We show that the Chvátal rank of a polytope P [subset] [0,1][superscript n] in the 0/1 cube is at most 6n³log n and prove the linear upper and lower bound n for the case P [subset] Z[superscript n] = 0."
3 editions published in 1997 in English and held by 10 WorldCat member libraries worldwide
Abstract: "Given a polytope P [subset] R[superscript n], the Chvátal-Gomory procedure computes iteratively the integer hull P[subscript I] of P. The Chvátal rank of P is the minimal number of iterations needed to obtain P[subscript I]. It is always finite, but already the Chvátal rank of polytopes in R² can be arbitrarily large. In this paper, we study polytopes in the 0/1 cube, which are of particular interest in combinatorial optimization. We show that the Chvátal rank of a polytope P [subset] [0,1][superscript n] in the 0/1 cube is at most 6n³log n and prove the linear upper and lower bound n for the case P [subset] Z[superscript n] = 0."
Narrowing with inductively defined functions by
Alexander Bockmayr(
Book
)
4 editions published in 1986 in German and English and held by 10 WorldCat member libraries worldwide
4 editions published in 1986 in German and English and held by 10 WorldCat member libraries worldwide
Cutting planes in constraint logic programming by
A Bockmayr(
Book
)
4 editions published in 1994 in English and German and held by 10 WorldCat member libraries worldwide
Abstract: "In this paper we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our appraoch is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing constraint logic programming systems."
4 editions published in 1994 in English and German and held by 10 WorldCat member libraries worldwide
Abstract: "In this paper we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our appraoch is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing constraint logic programming systems."
Künstliche Intelligenz und Operations-Research Workshop, Berlin, 13. - 14. September 1993 ; extended abstracts by
A Bockmayr(
Book
)
3 editions published in 1993 in German and English and held by 9 WorldCat member libraries worldwide
3 editions published in 1993 in German and English and held by 9 WorldCat member libraries worldwide
A unifying framework for integer and finite domain constraint programming by
Alexander Bockmayr(
Book
)
3 editions published in 1997 in English and held by 9 WorldCat member libraries worldwide
Abstract: "We present a unifying framework for integer linear programming and finite domain constraint programming, which is based on a distinction of primitive and non-primitive constraints and a general notion of branch-and-infer. We compare the two approaches with respect to their modeling and solving capabilities. We introduce symbolic constraint abstractions into integer programming. Finally, we discuss possible combinations of the two approaches."
3 editions published in 1997 in English and held by 9 WorldCat member libraries worldwide
Abstract: "We present a unifying framework for integer linear programming and finite domain constraint programming, which is based on a distinction of primitive and non-primitive constraints and a general notion of branch-and-infer. We compare the two approaches with respect to their modeling and solving capabilities. We introduce symbolic constraint abstractions into integer programming. Finally, we discuss possible combinations of the two approaches."
Logic programming with pseudo-Boolean constraints by
A Bockmayr(
Book
)
3 editions published in 1991 in English and German and held by 7 WorldCat member libraries worldwide
In this paper we define a new constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. The language is an instance of the general constraint logic programming language scheme CLP(X) and inherits all the typical semantic properties. We show that any pseudo-Boolean constraint has a most general solution and give variable elimination algorithms for pseudo-Boolean unification and unconstrained pseudo-Boolean optimization. Both algorithms subsume the well-known Boolean unification algorithm of Büttner and Simonis."
3 editions published in 1991 in English and German and held by 7 WorldCat member libraries worldwide
In this paper we define a new constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. The language is an instance of the general constraint logic programming language scheme CLP(X) and inherits all the typical semantic properties. We show that any pseudo-Boolean constraint has a most general solution and give variable elimination algorithms for pseudo-Boolean unification and unconstrained pseudo-Boolean optimization. Both algorithms subsume the well-known Boolean unification algorithm of Büttner and Simonis."
Finite domains and cutting plane techniques in CLP (PB) by
Peter Barth(
Book
)
2 editions published in 1994 in German and English and held by 6 WorldCat member libraries worldwide
2 editions published in 1994 in German and English and held by 6 WorldCat member libraries worldwide
Cutting planes and the elementary closure in fixed dimension by
Alexander Bockmayr(
Book
)
1 edition published in 1999 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1999 in English and held by 6 WorldCat member libraries worldwide
Modelling mixed integer optimisation problems in constraint logic programming by
Peter Barth(
Book
)
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Modelling mixed-integer optimisation problems in constraint logic programming by
Peter Barth(
Book
)
3 editions published in 1995 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Abstract: "Constraint logic programming (CLP) has become a promising new technology for solving complex combinatorial problems. In this paper, we investigate how (constraint) logic programming can support the modelling part in solving mixed-integer optimisation problems. First we show that the basic fuctionality of algebraic modelling languages can be realised very easily in a pure logic programming system like PROLOG and that, even without using constraints, various additional features are available. Then we focus on the constraint solving facilities offered by CLP systems. In particular, we explain how the constraint solver of the constraint logic programming language CLP(PB) can be used in modelling 0-1 problems."
3 editions published in 1995 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Abstract: "Constraint logic programming (CLP) has become a promising new technology for solving complex combinatorial problems. In this paper, we investigate how (constraint) logic programming can support the modelling part in solving mixed-integer optimisation problems. First we show that the basic fuctionality of algebraic modelling languages can be realised very easily in a pure logic programming system like PROLOG and that, even without using constraints, various additional features are available. Then we focus on the constraint solving facilities offered by CLP systems. In particular, we explain how the constraint solver of the constraint logic programming language CLP(PB) can be used in modelling 0-1 problems."
Narrowing strategies for arbitrary canonical rewrite systems by
Alexander Bockmayr(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
On unions and dominants of polytopes by
Egon Balas(
Book
)
3 editions published in 2002 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 2002 in English and held by 4 WorldCat member libraries worldwide
Cellular trade-offs and resource allocation during photoautotrophic growth by
Marjan Faizi(
)
1 edition published in 2020 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 2020 in English and held by 3 WorldCat member libraries worldwide
more

fewer

Audience Level
0 |
![]() |
1 | ||
General | Special |
