Automatic Composition of Rough Solution Possibilities in the Target Planning of Factory Planning Projects by Means of Combinatory Logic

In this paper we consider combinators as tree transducers: this approach is based on the one-to-one correspondence between terms of Combinatory Logic and trees, and on the fact that combinators may be considered as transformers of terms. Since combinators are terms themselves, we will deal with trees as objects to be transformed and tree transformers as well. Methods for defining and studying tree rewriting systems inside Combinatory Weak Reduction Systems and Weak Combinatory Logic are also analyzed and particular attention is devoted to the problem of finiteness and infinity of the generated tree languages (here defined). This implies the study of the termination of the rewriting process (i.e. reduction) for combinators.

Download Full-text

On the likelihood of normalization in combinatory logic

Journal of Logic and Computation ◽

10.1093/logcom/exx005 ◽

2017 ◽

Vol 27 (7) ◽

pp. 2251-2269 ◽

Cited By ~ 1

Author(s):

Maciej Bendkowski ◽

Katarzyna Grygiel ◽

Marek Zaionc

Keyword(s):

Combinatory Logic

Download Full-text

Integrating sustainability within the factory planning process

CIRP Annals ◽

10.1016/j.cirp.2012.03.067 ◽

2012 ◽

Vol 61 (1) ◽

pp. 463-466 ◽

Cited By ~ 9

Author(s):

Danfang Chen ◽

Steffen Heyer ◽

Günther Seliger ◽

Torsten Kjellberg

Keyword(s):

Planning Process ◽

Factory Planning

Download Full-text

Collaborative Factory Planning in Virtual Reality

Procedia CIRP ◽

10.1016/j.procir.2012.07.055 ◽

2012 ◽

Vol 3 ◽

pp. 317-322 ◽

Cited By ~ 22

Author(s):

N. Menck ◽

X. Yang ◽

C. Weidig ◽

P. Winkes ◽

C. Lauer ◽

...

Keyword(s):

Virtual Reality ◽

Factory Planning

Download Full-text

Optimization of Engineering Processes in Factory Planning

IFAC Proceedings Volumes ◽

10.3182/20130619-3-ru-3018.00406 ◽

2013 ◽

Vol 46 (9) ◽

pp. 353-358

Author(s):

D. Oehme ◽

U. Wagner ◽

R. Riedel ◽

E. Müller

Keyword(s):

Factory Planning

Download Full-text

Towards Automated Evaluation of Vehicle Dynamics in System-Level Designs

Volume 2: 32nd Computers and Information in Engineering Conference, Parts A and B ◽

10.1115/detc2012-71378 ◽

2012 ◽

Cited By ~ 10

Author(s):

Zsolt Lattmann ◽

Adam Nagel ◽

Jason Scott ◽

Kevin Smyth ◽

Chris vanBuskirk ◽

...

Keyword(s):

Design Space Exploration ◽

Design Space ◽

Test Bench ◽

Simulation Models ◽

Mobility Model ◽

System Level ◽

Bond Graphs ◽

Automated Evaluation ◽

Design Alternatives ◽

Automatic Composition

We describe the use of the Cyber-Physical Modeling Language (CyPhyML) to support trade studies and integration activities in system-level vehicle designs. CyPhyML captures parameterized component behavior using acausal models (i.e. hybrid bond graphs and Modelica) to enable automatic composition and synthesis of simulation models for significant vehicle subsystems. Generated simulations allow us to compare performance between different design alternatives. System behavior and evaluation are specified independently from specifications for design-space alternatives. Test bench models in CyPhyML are given in terms of generic assemblies over the entire design space, so performance can be evaluated for any selected design instance once automated design space exploration is complete. Generated Simulink models are also integrated into a mobility model for interactive 3-D simulation.

Download Full-text

Set Theory based on Combinatory Logic.

Journal of Symbolic Logic ◽

10.2307/2271198 ◽

1970 ◽

Vol 35 (1) ◽

pp. 147

Author(s):

Jonathan P. Seldin ◽

Maarten Wicher Visser Bunder

Keyword(s):

Set Theory ◽

Combinatory Logic

Download Full-text

TERMINATION OF ABSTRACT REDUCTION SYSTEMS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054109006450 ◽

2009 ◽

Vol 20 (01) ◽

pp. 57-82

Author(s):

JEREMY E. DAWSON ◽

RAJEEV GORÉ

Keyword(s):

General Theorem ◽

Combinatory Logic ◽

Rewrite Systems ◽

Path Ordering

We present a general theorem capturing conditions required for the termination of abstract reduction systems. We show that our theorem generalises another similar general theorem about termination of such systems. We apply our theorem to give interesting proofs of termination for typed combinatory logic. Thus, our method can handle most path-orderings in the literature as well as the reducibility method typically used for typed combinators. Finally we show how our theorem can be used to prove termination for incrementally defined rewrite systems, including an incremental general path ordering. All proofs have been formally machine-checked in Isabelle/HOL.

Download Full-text