Asia
SBVR Business Rules Generation from Natural Language Specification
Bajwa, Imran Sarwar (University of Birmingham) | Lee, Mark G. (University of Birmingham) | Bordbar, Behzad (University of Birmingham)
In this paper, we present a novel approach of translating natural languages specification to SBVR business rules. The business rules constraint business structure or control behaviour of a business process. In modern business modelling, one of the important phases is writing business rules. Typically, a business rule analyst has to manually write hundreds of business rules in a natural language (NL) and then manually translate NL specification of all the rules in a particular rule language such as SBVR, or OCL, as required. However, the manual translation of NL rule specification to formal representation as SBVR rule is not only difficult, complex and time consuming but also can result in erroneous business rules. In this paper, we propose an automated approach that automatically translates the NL (such as English) specification of business rules to SBVR (Semantic Business Vocabulary and Rules) rules. The major challenge in NL to SBVR translation was complex semantic analysis of English language. We have used a rule based algorithm for robust semantic analysis of English and generate SBVR rules. Automated generation of SBVR based Business rules can help in improved and efficient constrained business aspects in a typical business modelling.
Design Decision Support System toward Environmental Sustainability in Reusable Medical Equipment
Kim, Kyoung-Yun (Wayne State University) | Kim, Jihoon ( Wayne State University )
Related to the recent issues on the environmental sustainability, the attention and importance of Reusable Medical Equipment (RME) has increased rapidly. As a part of System Redesign Project funded by Veterans Engineering Resource Center (VERC), “Design Evaluation for Reusable Medical Equipment” project has been conducted. This research project aims to develop new RME design assessment and evaluation framework and Design for Reusability (DFR) and Design for Sustainability (DFS) principles. In this paper, we will present a decision support system for RME design evaluation, based on DFR and DFS principles. To illustrate the proposed new framework, GI endoscope is used in this research. In the proposed system, we apply a Rough Set Theory to identify the relationships among design and reprocessing features. Also we use feature selection technique to select the customized features from the design features and reprocessing features to be used for design evaluation.
Design Patterns and Cross-Domain Analogies in Biologically Inspired Sustainable Design
Goel, Ashok K. (Georgia Institute of Technology) | Bras, Bert (Georgia Institute of Technology) | Helms, Michael (Georgia Institute of Technology) | Rugaber, Spencer (Georgia Institute of Technology) | Tovey, Craig (Georgia Institute of Technology) | Vattam, Swaroop (Georgia Institute of Technology) | Weissburg, Marc (Georgia Institute of Technology) | Wiltgen, Bryan (Georgia Institute of Technology) | Yen, Jeannette (Georgia Institute of Technology)
Sustainable design is as an important movement in design. Biologically inspired design is a major paradigm for sustainable design. In this paper, we analyze a corpus of biologically inspired design projects in terms of sustainability. We then describe a case study of analogical design of a fog harvesting net, and abstract from it the patterns of Hydrophobia and Hydrophilia. We indicate how these two function-mechanism design patterns occur in several design projects in our corpus. This analysis indicates how biologically inspired sustainable design can be analyzed in terms of cross-domain analogical transfer of design patterns.
An Experiment in Formalizing Commitments Using Action Languages
Son, Tran Cao (New Mexico State University) | Pontelli, Enrico (New Mexico State University) | Sakama, Chiaki (Wakayama University)
This paper investigates the use of high-level action languages for representing and reasoning about commitments in mulit-agent domains. The paper introduces the language L mt with features motivates by the problem of representing commitments; in particular, it shows how L mt can handle both simple commitment actions and complex commitment protocols. The semantics of L mt provides a uniform solution to different problems in reasoning about commitments, e.g., the problem of (i) verifying whether an agent fails (or succeeds) to deliver on its commitments; (ii) identifying pending commitments; and (iii) suggesting ways to satisfy pending commitments.
On Moving Objects in Dynamic Domains
In the physical world, an object is a moving object if its position changes over time. In a symbolic dynamic system such as a computer program or a blocks world, what are the moving objects? In this paper, we propose a definition, consider ways to generate moving objects and their "positions." We also introduce the flow graph of a moving object. It depicts the "trajectory" of the object, thus should be useful when planning to achieve a goal that involves moving some objects around.
A Commonsense Theory of Microsociology: Interpersonal Relationships
Hobbs, Jerry R. (University of Southern California Institute for Scientific Information) | Sagae, Alicia (Alelo, Inc., Los Angeles, CA)
We are developing an ontology of microsocial concepts for use in an instructional system for teaching cross-cultural communication. We report here on that part of the ontology relating to interpersonal relationships. We first explicate the key concepts of commitment, shared plans, and good will. Then in terms of these we present a formal account of the host-guest relationship.
The Formalization of Practical Reasoning: An Opinionated Survey
Thomason, Richmond (University of Michigan)
I begin by considering examples of practical reasoning. In the remainder of the paper, I try to say something about what Example 8. Playing soccer. Soccer is like table tennis, but a logical approach that begins to do justice to the subject with the added dimension of teamwork and the need to might be like. This task was selected as a benchmark problem in robotics, and has been extensively Example 1. Ordering a meal at a restaurant. Here, the problem is deciding what to eat and drink. Typing an email message, Even if the only relevant factors are price and preferences composing it as you go along, starts perhaps with a general about food, the number of possible combinations is very idea of what to say.
The Counting Problem in the Light of Role Kinds
Masolo, Claudio (Laboratory for Applied Ontology, ISTC-CNR) | Vieu, Laure (IRIT-CNRS) | Kitamura, Yoshinobu (ISIR, Osaka University) | Kozaki, Kouji (ISIR, Osaka University) | Mizoguchi, Riichiro (ISIR, Osaka University)
Starting from a general characterization of roles, we focus on the ways in which roles are specified, we examine the formal constraints on their definitions, and propose definitional schemas motivating different kinds of roles. This classification, in addition to clarify the notion of role itself, helps us to reconsider the two standard solutions that have been proposed for the famous counting problem, and to suggest that a third mixed approach may be considered.
Causal Theories of Actions Revisited
Lin, Fangzhen (HKUST) | Soutchanski, Mikhail (Ryerson University)
It has been argued that causal rules are necessary for representing both implicit side-effects of actions and action qualifications, and there have been a number different approaches for representing causal rules in the area of formal theories of actions. These different approaches in general agree on rules without cycles. However, they differ on causal rules with mutual cyclic dependencies, both in terms of how these rules are supposed to be represented and their semantics. In this paper we show that by adding one more minimization to Lin's circumscriptive causal theory in the situation calculus, we can have a uniform representation of causal rules including those with cyclic dependencies. We also demonstrate that sometimes causal rules can be compiled into logically equivalent (under a proposed semantics) successor state axioms even in the presence of cyclical dependencies between fluents.
Housekeeping with Multiple Autonomous Robots: Representation, Reasoning and Execution
Aker, Erdi (Sabanci University) | Erdogan, Ahmetcan (Sabanci University) | Erdem, Esra (Sabanci University) | Patoglu, Volkan (Sabanci University)
We formalize actions and change in a housekeeping domain with multiple cleaning robots, and commonsense knowledge about this domain, in the action language C+. Geometric reasoning is lifted to high-level representation by embedding motion planning in the domain description using external predicates. With such a formalization of the domain, a plan can be computed using the causal reasoner CCalc for each robot to tidy some part of the house. We introduce a planning and monitoring algorithm for safe execution of these plans, so that it can recover from plan failures due to collision with movable objects whose presence and location are not known in advance or due to heavy objects that cannot be lifted alone. We illustrate the applicability of this algorithm with a simulation of a housekeeping domain.