Country
Logic Programs and Causal Proofs
Cabalar, Pedro (University of Corunna)
In this work, we present a causal extension of logic programming under the stable models semantics where, for a given stable model, we capture the alternative causes of each true atom. The syntax is extended by the simple addition of an optional reference label per each rule in the program. Then, the obtained causes rely on the concept of a causal proof: an inverted tree of labels that keeps track of the ordered application of rules that has allowed deriving a given true atom.
Propagating Uncertainty in Solar Panel Performance for Life Cycle Modeling in Early Stage Design
Honda, Tomonori (Massachusetts Institute of Technology) | Chen, Heidi Q. (Massachusetts Institute of Technology) | Chan, Kennis Y. (ATAC Corporation) | Yang, Maria C. (Massachusetts Institute of Technology)
One of the challenges in accurately applying metrics for life cycle assessment lies in accounting for both irreducible and inherent uncertainties in how a design will perform under real world conditions. This paper presents a preliminary study that compares two strategies, one simulation-based and one set-based, for propagating uncertainty in a system. These strategies for uncertainty propagation are then aggregated. This work is conducted in the context of an amorphous photovoltaic (PV) panel, using data gathered from the National Solar Radiation Database, as well as realistic data collected from an experimental hardware setup specifically for this study. Results show that the influence of various sources of uncertainty can vary widely, and in particular that solar radiation intensity is a more significant source of uncertainty than the efficiency of a PV panel. This work also shows both set-based and simulation-based approaches have limitations and must be applied thoughtfully to prevent unrealistic results. Finally, it was found that aggregation of the two uncertainty propagation methods provided faster results than either method alone.
Mining of Agile Business Processes
Brander, Simon (University of Applied Sciences Northwestern Switzerland FHNW) | Hinkelmann, Knut (University of Applied Sciences Northwestern Switzerland FHNW) | Martin, Andreas (University of Applied Sciences Northwestern Switzerland FHNW) | Thoenssen, Barbara (University of Applied Sciences Northwestern Switzerland FHNW)
Organizational agility is a key challenge in today's business world. The Knowledge-Intensive Service Support approach tackles agility by combining process modeling and business rules. In the paper at hand, we present five approaches of process mining that could further increase the agility of processes by improving an existing process model.
An Interface for Crowd-Sourcing Spatial Models of Commonsense
Johnston, Benjamin (University of Technology, Sydney)
Commonsense is a challenge not only for representation and reasoning but also for large scale knowledge engineering required to capture the breadth of our "everyday" world. One approach to knowledge engineering is to "outsource" the effort to the public through games that generate structured commonsense knowledge from user play. To date, such games have focused on symbolic and textual knowledge. However, an effective commonsense reasoning system will require spatial and physical reasoning capabilities. In this paper, I propose a tool for gathering commonsense information from ordinary people. It is a user-friendly 3D sculpting tool for modeling and annotating models of physical objects and spaces.
Accessing Structured Health Information through English Queries and Automatic Deduction
Waldinger, Richard (SRI International) | Bobrow, Daniel G. (PARC) | Condoravdi, Cleo (PARC) | Richardson, Kyle (PARC) | Das, Amar (Stanford University)
While much health data is available online, patients who are not technically astute may be unable to access it because they may not know the relevant resources, they may be reluctant to confront an unfamiliar interface, and they may not know how to compose an answer from information provided by multiple heterogeneous resources. We describe ongoing research in using natural English text queries and automated deduction to obtain answers based on multiple structured data sources in a specific subject domain. Each English query is transformed using natural language technology into an unambiguous logical form; this is submitted to a theorem prover that operates over an axiomatic theory of the subject domain. Symbols in the theory are linked to relations in external databases known to the system. An answer is obtained from the proof, along with an English language explanation of how the answer was obtained. Answers need not be present explicitly in any of the databases, but rather may be deduced or computed from the information they provide. Although English is highly ambiguous, the natural language technology is informed by subject domain knowledge, so that readings of the query that are syntactically plausible but semantically impossible are discarded. When a question is still ambiguous, the system can interrogate the patient to determine what meaning was intended. Additional queries can clarify earlier ones or ask questions referring to previously computed answers. We describe a prototype system, Quadri, which answers questions about HIV treatment using the Stanford HIV Drug Resistance Database and other resources. Natural language processing is provided by PARC’s Bridge, and the deductive mechanism is SRI’s SNARK theorem prover. We discuss some of the problems that must be faced to make this approach work, and some of our solutions.
Representing Biological Processes in Modular Action Language ALM
Inclezan, Daniela (Texas Tech University) | Gelfond, Michael (Texas Tech University)
This paper presents the formalization of a biological process, cell division, in modular action language ALM. We show how the features of ALM — modularity, separation between an uninterpreted theory and its interpretation — lead to a simple and elegant solution that can be used in answering questions from biology textbooks.
Combining Data-Driven and Knowledge-Guided Methods to Induce Interpretable Physiological Models
Langley, Pat (Arizona State University / ISLE) | Bridewell, Will (Stanford University)
In this paper, we review the paradigm of inductive process modeling and examine its application to human physiology. This framework represents models as a set of interacting processes, each with associated differential or alegraic equations that express causal relations among variables. Simulating such a quantitative process model produces trajectories for variables over time that one can compare to observations. Background knowledge about candidate processes lets one carry out search through the space of model structures and their associated parameters, and thus identify quantitative models that explain time-series data. We present an initial process model for aspects of human physiology, consider its uses for health monitoring, and discuss the induction of such models. In closing, we discuss related efforts on physiological modeling and our plans for collecting data to evaluate our framework in this domain.
Symbolic Probabilistic Reasoning for Narratives
Hajishirzi, Hannaneh (University of Illinois at Urbana-Champaign) | Mueller, Erik T. (IBM T. J. Watson)
We present a framework to represent and reason about narratives that combines logical and probabilistic representations of commonsense knowledge. Unlike most natural language understanding systems, which merely extract facts or semantic roles, our system builds probabilistic representations of the temporal sequence of world states and actions implied by a narrative. We use probabilistic actions to represent ambiguities and uncertainties in the narrative. We present algorithms that take a representation of a narrative, derive all possible interpretations of the narrative, and answer probabilistic queries by marginalizing over all the interpretations. With a focus on spatial contexts, we demonstrate our framework on an example narrative. To this end, we apply natural language pro- cessing (NLP) tools together with statistical approaches over common sense knowledge bases.
Generation of Energy-Efficient Patio Houses: Combining GENE_ARCH and a Marrakesh Medina Shape Grammar
Caldas, Luisa (Technical University of Lisbon)
GENE_ARCH is a Generative Design System that combines Pareto Genetic Algorithms with an advanced energy simulation engine. This work explores its integration with a Shape Grammar, acting as GENE_ARCH’s shape generation module. The islamic patio house typology is readdressed in a contemporary context, by improving its energy-efficiency, and rethinking its role in the genesis of high-density urban areas, while respecting its specific spatial organization and cultural grounding. Field work was carried out in Marrakesh, surveying a number of patio houses, becoming the Corpus of Design, from where a shape grammar was generated. The computational implementation of the patio house grammar was done within GENE_ARCH. The resulting program was able to generate new, alternative patio houses designs that were more energy efficient, while respecting the traditional rules captured from the analysis of existing houses. After the computational system was fully implemented, it was possible to realise a large number of experiments. The first experiments kept more restrained rules, thus generating new designs that closer resembled the existing ones. The progressive relaxation of rules and constraints allowed for a larger number of variations to emerge. Analysis of energy results provide insight into the main patterns resulting from the GA search processes.
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.