A logic-based approach for processing design standards

Author(s):  
William J. Rasdorf ◽  
Sivand Lakmazaheri

A logic-based approach for automating the processing of design standards is illustrated. This approach is composed of three steps: conceptualization, formalization and implementation. Conceptualization is referred to as the representation of the knowledge necessary for solving the problem of interest in terms of objects and relations. Formalization is referred to as the representation of the objects and relations of interest as axioms using the language of predicate calculus. And, Implementation is referred to as the representation of the axioms of interest and the strategy for manipulating axioms using the constructs of a programming language.The paper illustrates the logic-based approach to engineering problem-solving automation by considering the portion of the AISC Specification that governs the design of axially loaded members. First, the relations of interest are identified (Conceptualization). Then, predicate calculus is used to formally represent the relations (Formalization) as axioms and to mechanically manipulate them. The checking and designing of structural components via mechanical manipulation of the axioms are illustrated in the paper. Finally, a constraint logic programming language is used to develop a computer program for automatic processing of the specification (Implementation). This program is composed of a set of rules that closely resemble the formulated axioms.

2003 ◽  
Vol 10 (25) ◽  
Author(s):  
Dariusz Biernacki ◽  
Olivier Danvy

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds's defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink in previous work (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.<br /><br />Superseded by BRICS-RS-04-5.


Sign in / Sign up

Export Citation Format

Share Document