scispace - formally typeset
Search or ask a question

Showing papers presented at "Web Reasoning and Rule Systems in 2014"


Book ChapterDOI
15 Sep 2014
TL;DR: This work develops a practical approach to querying the SQL:2011-based temporal data model via the semantic layer of OWL 2 QL via the direct reuse of the standard rewriting techniques for conjunctive queries under OWL2 QL.
Abstract: SQL:2011, the most recently adopted version of the SQL query language, has unprecedentedly standardized the representation of temporal data in relational databases. Following the successful paradigm of ontology-based data access, we develop a practical approach to querying the SQL:2011-based temporal data model via the semantic layer of OWL 2 QL. The interval-based temporal query language (TQL), which we propose for this task, is based on naturally characterizable combinations of temporal logic with conjunctive queries. As the central contribution, we present rules for sound and complete rewriting of TQL queries into two-sorted first-order logic, and consequently, into corresponding SQL queries, which can be evaluated in any existing relational database management system compliant with the SQL:2011 temporal data model. Importantly, the proposed rewriting is based on the direct reuse of the standard rewriting techniques for conjunctive queries under OWL 2 QL. This renders our approach modular and easily implementable. As a notable corollary, we show that the data complexity of TQL query answering remains in AC0, i.e., as in the usual, non-temporal case.

28 citations


Book ChapterDOI
15 Sep 2014
TL;DR: This work proposes the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog, and proposes a second class of \(\mathcal{SHI}\) ontologies that admits exponential datalog rewriting via resolution.
Abstract: We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog. Markability naturally extends to \(\mathcal{SHI}\) ontologies, and markable ontologies admit (possibly exponential) datalog rewritings. We then turn our attention to resolution-based rewriting techniques. We devise an enhanced rewriting procedure for disjunctive datalog, and propose a second class of \(\mathcal{SHI}\) ontologies that admits exponential datalog rewritings via resolution. Finally, we focus on conjunctive query answering over disjunctive datalog programs. We identify classes of queries and programs that admit datalog rewritings and study the complexity of query answering in this setting. We evaluate the feasibility of our techniques over a large corpus of ontologies, with encouraging results.

25 citations


Book ChapterDOI
15 Sep 2014
TL;DR: The Ontop system is implemented, evaluated and implemented, and results in the first system supporting all of the following W3C standards: the OWL 2 QL ontology language, R2RML mappings, SWRL rules with linear recursion, and SPARQL queries.
Abstract: In OBDA an ontology defines a high level global vocabulary for user queries, and such vocabulary is mapped to (typically relational) databases. Extending this paradigm with rules, e.g., expressed in SWRL or RIF, boosts the expressivity of the model and the reasoning ability to take into account features such as recursion and n-ary predicates. We consider evaluation of SPARQL queries under rules with linear recursion, which in principle is carried out by a 2-phase translation to SQL: (1) The SPARQL query, together with the RIF/SWRL rules, and the mappings is translated to a Datalog program, possibly with linear recursion; (2) The Datalog program is converted to SQL by using recursive common table expressions. Since a naive implementation of this translation generates inefficient SQL code, we propose several optimisations to make the approach scalable. We implement and evaluate the techniques presented here in the Ontop system. To the best of our knowledge, this results in the first system supporting all of the following W3C standards: the OWL 2 QL ontology language, R2RML mappings, SWRL rules with linear recursion, and SPARQL queries. The preliminary but encouraging experimental results on the NPD benchmark show that our approach is scalable, provided optimisations are applied.

15 citations


Book ChapterDOI
15 Sep 2014
TL;DR: This work proposes a framework for reasoning about dynamic Web data, based on probabilistic Answer Set Programming (ASP), which allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities, and for learning of such weights from examples (parameter estimation).
Abstract: We propose a framework for reasoning about dynamic Web data, based on probabilistic Answer Set Programming (ASP). Our approach, which is prototypically implemented, allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities, and for learning of such weights from examples (parameter estimation). Knowledge as well as examples can be provided incrementally in the form of RDF data streams. Optionally, stream data can be configured to decay over time. With its hybrid combination of various contemporary AI techniques, our framework aims at prevalent challenges in relation to data streams and Linked Data, such as inconsistencies, noisy data, and probabilistic processing rules.

15 citations


Book ChapterDOI
15 Sep 2014
TL;DR: This paper develops an extended theory of AFT that treats consistent as well as inconsistent pairs on a bilattice, and applies the extended theory to FOL-programs and explores various possibilities on semantics, leading to novel formulations of approximating operators, and new well-founded semantics and characterizations of answer sets for FOL -programs.
Abstract: The approximation fixpoint theory (AFT) provides an algebraic framework for the study of fixpoints of operators on bilattices, and has been useful in dealing with semantics issues for various types of logic programs. The theory in the current form, however, only deals with consistent pairs on a bilattice, and it thus does not apply to situations where inconsistency may be part of a fixpoint construction. This is the case for FOL-programs, where a rule set and a first-order theory are tightly integrated. In this paper, we develop an extended theory of AFT that treats consistent as well as inconsistent pairs on a bilattice. We then apply the extended theory to FOL-programs and explore various possibilities on semantics. This leads to novel formulations of approximating operators, and new well-founded semantics and characterizations of answer sets for FOL-programs. The work reported here shows how consistent approximations may be extended to capture wider classes of logic programs whose semantics can be treated uniformly.

14 citations


Book ChapterDOI
15 Sep 2014
TL;DR: The authors study mapping analysis in ontology-based data access (OBDA), providing an initial set of foundational results for this problem and define general, language-independent notions of mapping inconsistency, mapping subsumption, and mapping redundancy in OBDA.
Abstract: In this paper we study mapping analysis in ontology-based data access (OBDA), providing an initial set of foundational results for this problem We start by defining general, language-independent notions of mapping inconsistency, mapping subsumption, and mapping redundancy in OBDA Then, we focus on specific mapping languages for OBDA and illustrate techniques for verifying the above properties of mappings

14 citations


Book ChapterDOI
15 Sep 2014
TL;DR: This paper argues that Transaction Logic is a natural specification language for planning algorithms, which enables one to see further afield and thus discover better and more general solutions than using one-of-a-kind formalisms.
Abstract: Automated planning has been the subject of intensive research and is at the core of several areas of AI, including intelligent agents and robotics. In this paper, we argue that Transaction Logic is a natural specification language for planning algorithms, which enables one to see further afield and thus discover better and more general solutions than using one-of-a-kind formalisms. Specifically, we take the well-known \({\textit{STRIPS}}\) planning strategy and show that Transaction Logic lets one specify the \({\textit{STRIPS}}\) planning algorithm easily and concisely, and to prove its completeness. Moreover, extensions to allow indirect effects and to support action ramifications come almost for free. Finally, the compact and clear logical formulation of the algorithm made possible by this logic is conducive to fruitful experimentation. To illustrate this, we show that a rather simple modification of the \({\textit{STRIPS}}\) planning strategy is also complete and yields speedups of orders of magnitude.

11 citations


Book ChapterDOI
15 Sep 2014
TL;DR: It is shown that a simple adaptation of the proof for \(\Mathcal{SH}\) proves that query answering is 2ExpTime-hard already for \(\mathcal{ALC}\) if the authors consider more expressive query languages such as positive existential queries and (restricted classes of) conjunctive regular path queries.
Abstract: Answering conjunctive queries over Description Logic (DL) knowledge bases is known to be 2ExpTime-hard for the DLs \(\mathcal{ALCI}\), \(\mathcal{SH}\), and their extensions. In this technical note, we revisit these results to identify other equally hard settings. In particular, we show that a simple adaptation of the proof for \(\mathcal{SH}\) proves that query answering is 2ExpTime-hard already for \(\mathcal{ALC}\) if we consider more expressive query languages such as positive existential queries and (restricted classes of) conjunctive regular path queries.

8 citations


Book ChapterDOI
15 Sep 2014
TL;DR: This paper gives reductions for Godel, and Łukasiewicz variants of fuzzy Open image in new window and two kinds of fuzzy CQs to solve conjunctive query answering problems for fuzzy DLs.
Abstract: Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Godel, and Łukasiewicz variants of fuzzy Open image in new window and two kinds of fuzzy CQs. The correctness of the proposed reduction is proved and its complexity is studied for different fuzzy variants of Open image in new window .

8 citations


Book ChapterDOI
15 Sep 2014
TL;DR: In this article, the notion of exchange-repairs is introduced and explored for data exchange with target constraints, where the semantics of target queries trivialize, because the certain answers of every target query over the given source instance evaluate to true.
Abstract: In a data exchange setting with target constraints, it is often the case that a given source instance has no solutions. Intuitively, this happens when data sources contain inconsistent or conflicting information that is exposed by the target constraints at hand. In such cases, the semantics of target queries trivialize, because the certain answers of every target query over the given source instance evaluate to “true”. The aim of this paper is to introduce and explore a new framework that gives meaningful semantics in such cases by using the notion of exchange-repairs. Informally, an exchange-repair of a source instance is another source instance that differs minimally from the first, but has a solution. In turn, exchange-repairs give rise to a natural notion of exchange-repair certain answers (in short, XR-certain answers) for target queries in the context of data exchange with target constraints.

8 citations


Book ChapterDOI
15 Sep 2014
TL;DR: It turns out the query answering over quad-systems is undecidable, in general, so a decidable class of quad-Systems is derived, namely context-acyclic quad- systems, for which query answering can be done using forward chaining.
Abstract: The recent outburst of context-dependent knowledge on the Semantic Web (SW) has led to the realization of the importance of the quads in the SW community. Quads, which extend a standard RDF triple, by adding a new parameter of the ‘context’ of an RDF triple, thus informs a reasoner to distinguish between the knowledge in various contexts. Although this distinction separates the triples in an RDF graph into various contexts, and allows the reasoning to be decoupled across various contexts, bridge rules need to be provided for inter-operating the knowledge across these contexts. We call a set of quads together with the bridge rules, a quad-system. In this paper, we discuss the problem of query answering over quad-systems with expressive forall-existential bridge rules. It turns out the query answering over quad-systems is undecidable, in general. We derive a decidable class of quad-systems, namely context-acyclic quad-systems, for which query answering can be done using forward chaining. Tight bounds for data and combined complexity of query entailment has been established for the derived class.

Book ChapterDOI
15 Sep 2014
TL;DR: This system description paper introduces the OWL 2 query answering system Hydrowl, based on novel hybrid techniques which in order to compute the query answers combine at run-time a reasoner ans 1 supporting a (tractable) fragment of OWL2 with a fully-fledged OWL 1 DL reasoner Ans 2.
Abstract: This system description paper introduces the OWL 2 query answering system Hydrowl. Hydrowl is based on novel hybrid techniques which in order to compute the query answers combine at run-time a reasoner ans 1 supporting a (tractable) fragment of OWL 2 (e.g., OWL 2 QL and OWL 2 RL) with a fully-fledged OWL 2 DL reasoner ans 2. The motivation is that if most of the (query answering) work is delegated to the (usually) very scalable system ans 1 while the interaction with ans 2 is kept to a bare minimum, then we can possibly provide with scalable query answering even over expressive fragments of OWL 2 DL. We discuss the system’s architecture and we present an overview of the techniques used. Finally, we present some first encouraging experimental results.

Journal ArticleDOI
01 Jul 2014
TL;DR: In this article, the authors discuss the asunto de manera muy breve desde tres puntos de vista: the teologia, the Biblia, and the impacto of los Derechos Humanos and las luchas de los movimientos LGTBI hoy.
Abstract: Los temas relativos a la homosexualidad parecen ser hoy problemas cruciales para la mayoria de las iglesias. La sexualidad en general y en especial la cuestion de la orientacion sexual ocupa grandes espacios en los diversos pronunciamientos teologicos y pastorales de la Iglesia Catolica Romana, las iglesias protestantes y las evangelicas en casi todo el mundo. La tematica divide a las y los cristianos entre posiciones ultraconservadoras excluyentes y posturas mas heterodoxas e inclusivas. En este escrito vamos a abordar el asunto de manera muy breve desde tres puntos de vista: la teologia, la Biblia y el impacto de los Derechos Humanos y las luchas de los movimientos LGTBI hoy.

Book ChapterDOI
15 Sep 2014
TL;DR: Information Diffusion is a classical problem in Social Network Analysis, where it has been deeply investigated for single social networks, but this paper begins to study it in a multi-social-network scenario, where many social networks coexist and are strictly connected to each other.
Abstract: Information Diffusion is a classical problem in Social Network Analysis, where it has been deeply investigated for single social networks. In this paper, we begin to study it in a multi-social-network scenario, where many social networks coexist and are strictly connected to each other, thanks to those users who join more social networks. In this activity, Answer Set Programming provided us with a powerful and flexible tool for an easy set-up and implementation of our investigations.

Book ChapterDOI
15 Sep 2014
TL;DR: This paper presents an alternative approach for efficient federated debugging that relies on the generation of so called clash queries that are evaluated over all integrated data sources and can be used for pinpointing those assertions that cause inconsistencies.
Abstract: In the last years ontologies have been applied increasingly as a conceptual view facilitating the federation of numerous data sources using different access methods and data schemes. Approaches such as ontology-based data integration (OBDI) are aimed at this purpose. According to these approaches, queries formulated in an ontology describing the knowledge domain as a whole are translated into queries formulated in vocabularies of integrated data sources. In such integrative environments the increasing number of heterogeneous data sources increases the risk of inconsistencies. These inconsistencies become a serious obstacle for leveraging the full potential of approaches like OBDI since inconsistencies can be hardly identified by existing reasoning algorithms, which mostly have been developed for processing of locally available knowledge bases. In this paper we present an alternative approach for efficient federated debugging. Our solution relies on the generation of so called clash queries that are evaluated over all integrated data sources. We further explain how these queries can be used for pinpointing those assertions that cause inconsistencies and discuss finally some experimental evaluation results of our implementation.

Book ChapterDOI
15 Sep 2014
TL;DR: The Prod-Trees platform is presented, a semantically-enabled search engine for EO products enhanced with EO-netCDF, a new standard for accessing Earth Observation products.
Abstract: Access to Earth Observation products remains difficult for end users in most domains. Although various search engines have been developed, they neither satisfy the needs of scientific communities for advanced search of EO products, nor do they use standardized vocabularies reusable from other organizations. To address this, we present the Prod-Trees platform, a semantically-enabled search engine for EO products enhanced with EO-netCDF, a new standard for accessing Earth Observation products.

Book ChapterDOI
15 Sep 2014
TL;DR: In the process of aggregating heterogeneous resources and publishing them for retrieval and creative reuse, networks such as Europeana and DPLA invest in technologies that achieve semantic data integration.
Abstract: Cultural Heritage is the focus of a great and continually increasing number of R&D initiatives, aiming at efficiently managing and disseminating cultural resources on the Web. As more institutions make their collections available online and proceed to aggregate them in domain repositories, knowledge-based management and retrieval becomes a necessary evolution from simple syntactic data exchange. In the process of aggregating heterogeneous resources and publishing them for retrieval and creative reuse, networks such as Europeana and DPLA invest in technologies that achieve semantic data integration. The resulting repositories join the Linked Open Data cloud, allowing to link cultural heritage domain knowledge to existing datasets. Integration of diverse information is achieved through the use of formal ontologies, enabling reasoning services to offer powerful semantic search and navigation mechanisms.

Book ChapterDOI
15 Sep 2014
TL;DR: This paper shows how repository metadata can be exposed as Linked Data, thus enhancing their machine understandability and contributing to the LOD cloud.
Abstract: Linked Data seem to play a seminal role in the establishment of the Semantic Web as the next-generation Web. This is even more important for digital object collections and educational institutions that aim not only to promote and disseminate their content but also to aid its discoverability and contextualization. Having already ‘semantified’ a popular digital repository system, DSpace, in this paper we show how repository metadata can be exposed as Linked Data, thus enhancing their machine understandability and contributing to the LOD cloud. Our effort comes complete with an updated UI that allows for reasoning-based search and navigation between linked resources within and outside the scope of the digital repository.

Proceedings Article
01 Sep 2014

Proceedings Article
01 Jan 2014
TL;DR: This paper reformulates computational problems as query answering problems, and then asks how powerful a query language is needed to solve these problems, to distinguish problems in a more-fine grained manner than computational complexity without being specific to a particular algorithm.
Abstract: Knowledge representation and reasoning leads to a wide range of computational problems, and it is of great interest to understand the difficulty of these problems. Today this question is mainly studied using computational complexity theory and algorithmic complexity analysis. For example, entailment in propositional Horn logic is P-complete and a specific algorithm is known that runs in linear time. Unfortunately, tight algorithmic complexity bounds are rare and often based on impractical algorithms (e.g., O(n2.373) for transitive closure by matrix multiplication), whereas computational complexity results abound but are very coarse-grained (e.g., many P-complete problems cannot be solved in linear time). In this invited paper, we therefore advocate another approach to gauging the difficulty of a computation: we reformulate computational problems as query answering problems, and then ask how powerful a query language is needed to solve these problems. This reduces reasoning problems to a computational model – query answering – that is supported by many efficient implementations. It is of immediate practical interest to know if a problem can be reduced to query answering in an existing database system. On the theoretical side, it allows us to distinguish problems in a more-fine grained manner than computational complexity without being specific to a particular algorithm. We provide several examples of this approach and discuss its merits and limitations.


Journal ArticleDOI
22 Jul 2014
TL;DR: Pensamentos sobre as possibilidades reflexivas da desmontagem em experimento de (re) criacao discursiva, numa proposta pedagogica processual em pesquisas de mestrado e doutorado no PPGArtes/UFU.
Abstract: Este artigo dialoga com Ileana Dieguez quando apresenta a demonstracao de Julia Varley; a desmontagem nas praticas de Lorena Wolffer, ativista cultural e performer; e a teoria da despersonificacion com Gabriel Weisz, poeta e academico. Traz tambem pensamentos sobre as possibilidades reflexivas da desmontagem em experimento de (re) criacao discursiva, numa proposta pedagogica processual em pesquisas de mestrado e doutorado no PPGArtes/UFU.

Proceedings ArticleDOI
21 Jul 2014
TL;DR: A desconstrucao de Derrida serve de operador for a desmontagem do espetaculo transposta para uma escrita performatica que reune o material arquivado pela autora-diretora em seus cadernos e em registros fotograficos.
Abstract: O texto fala sobre o processo de criacao do espetaculo SILENCIO, montado em 1997 e remontado em 2011. O espetaculo e uma adaptacao do texto Self-Accusation, do escritor austriaco Peter Handke, com direcao de Beth Lopes, a autora desse artigo, e dos atores Yedda Chaves e Matteo Bonfitto, tambem co-tradutor da peca. A desconstrucao de Derrida serve de operador para a desmontagem do espetaculo transposta para uma escrita performatica que reune o material arquivado pela autora-diretora em seus cadernos e em registros fotograficos.

Journal ArticleDOI
01 Dec 2014
TL;DR: The conceitos sobre memoria apresentada por Leal (2011) a partir das ideias de Stanislavski e de Halbwachs, aproximam os alunos de seus proprios contextos e os estimulam a experienciar essa memoria pelo uso dos conceito dos viewpoints as mentioned in this paper.
Abstract: O texto traca um parâmetro sobre as modificacoes que a sociedade contemporânea vem sofrendo, e questiona como isso reverbera nas praticas teatrais que sao inseridas nas escolas de educacao basica. Os viewpoints conceitualizados pela pesquisadora norte - americana Anne Bogart sao apontados enquanto uma possibilidade artistico-pedagogica, cuja investigacao potencializa a teatralidade ja presente nos espacos escolares. Os conceitos sobre memoria apresentada por Leal (2011) a partir das ideias de Stanislavski e de Halbwachs, aproximam os alunos de seus proprios contextos e os estimulam a experienciar essa memoria pelo uso dos conceitos dos viewpoints. E num processo de afetacao, memorias sao re-significadas pelas novas experiencias e as experiencias atuais passam a ser re-elaboradas pelas memorias.

Book ChapterDOI
15 Sep 2014
TL;DR: Airports today can constitute a perfect environment for developing novel digital marketplaces offering location-specific and semantically rich context-aware services, such as personalized marketing campaigns, last minute, discounted airline tickets while helping users access the airport and speed through the airport process.
Abstract: Airports today can constitute a perfect environment for developing novel digital marketplaces offering location-specific and semantically rich context-aware services, such as personalized marketing campaigns, last minute, discounted airline tickets while helping users access the airport and speed through the airport process.

Journal ArticleDOI
01 Dec 2014
TL;DR: Neste texto serao estabelecidas relacoes entre o conceito de treinamento, como uma pratica especifica that diz respeito ao trabalho de ator/atriz, e o discurso de Anne Bogart para a arte da direcao teatral na SITI Company, o intuito consiste em analisar a articulacao de Bogart.
Abstract: Neste texto serao estabelecidas relacoes entre o conceito de treinamento, como uma pratica especifica que diz respeito ao trabalho de ator/atriz, e o discurso de Anne Bogart para a arte da direcao teatral na SITI Company Nosso intuito consiste em analisar a articulacao do discurso de Bogart para a arte da direcao teatral, a partir de uma especifica combinacao de tres distintas tecnicas de treinamento, tal como estabelecido na SITI Company Levantamos, ainda, uma reflexao relacionada a possibilidade de haver, nessa combinacao de treinamentos, uma pratica especifica que compreenda procedimentos proprios de direcao teatral

Journal ArticleDOI
01 Jul 2014
TL;DR: In this article, a clasificación de los imaginarios de la población costarricense respecto de la Politica and la Democracia is presented.
Abstract: El articulo propone una clasificacion de los imaginarios de la poblacion costarricense respecto de la Politica y la Democracia. Para ello se aplica una encuesta de opinion publica y se identifican percepciones y actitudes de la poblacion al respecto. Posteriormente, por medio de un analisis cluster (k-medias) se desarrolla una tipologia de sujetos, con el proposito de comprender los distintos comportamientos de la poblacion en relacion con el ambito politico.

BookDOI
01 Sep 2014
TL;DR: This talk will give an insight into selected projects where semantic technology has been successfully applied in innovative technology fields, to illustrate that research on reasoning, rule-based systems and ontologies does have an impact in areas like power generation, industrial automation or health care.
Abstract: Semantic technology around knowledge representation and reasoning offers promising methods and tools for industrial applications. This talk will give an insight into selected projects where semantic technology has been successfully applied in innovative technology fields. It will illustrate that research on reasoning, rule-based systems and ontologies does have an impact in areas like power generation, industrial automation or health care, to name just a few. Siemens is a leading industrial player in various innovative technology areas, such as power generation, industrial automation, traffic control or health care applications, to name just a few. The R&D department Corporate Technology is layered across the Siemens business units and is organized in various technology fields with the mission of transferring the latest research results into in-house business innovations. Within the technology field of Business Analytics and Monitoring also semantic technologies are being researched on. They cover methods for the processing of highly structured data like ontologies, rule-based systems and deductive as well as abductive and inductive inference mechanisms, but also methods for data-driven interpretation, such as natural language processing and machine learning techniques. All those aspects of semantic technologies find an application in many innovative technology areas, the following being an incomplete list of examples drawn from past and ongoing research activities. – Reasoning about ontologies in the light-weight description logic OWL EL is applied to the diagnosing of turbine sensor data in order to detect operational faults and to find their root causes, as reported in [6]. – Rule-based inference and complex event processing are applied in combination with ontologies for monitoring the operation of industrial manufacturing plants, as described in [2]. – A technology stack for CEP-style reasoning with the ETALIS framework [4] on the Gumstix embedded controller is sketched in [5] for condition monitoring and diagnostics of technical devices.

Journal ArticleDOI
01 Dec 2014
TL;DR: Two praticas de improvisacao extremamente relevantes para o trabalho de ator foram aplicadas simultaneamente como estrategias de desenvolvimento da capacidade oferecida de um grupo de atores-em-treinamento.
Abstract: Viewpoints e Impro sao duas praticas de improvisacao extremamente relevantes para o trabalho de ator. No contexto deste estudo, foram aplicadas simultaneamente como estrategias de desenvolvimento da capacidade de improvisacao de um grupo de atores-em-treinamento. Entende-se que essas praticas contribuem, respectivamente, com a expressividade corporal e as habilidades narrativas dos atores envolvidos. Foram examinadas as implicacoes desse confronto de duas metodologias diversas aplicadas em um mesmo treinamento. Tratando-se de pesquisa essencialmente pratica, a base teorica que lhe da fundamento e a bibliografia oferecida pelos proprios criadores das citadas praticas: Viewpoints por Anne Bogart e Tina Landau e Impro por Keith Johnstone.

Book ChapterDOI
15 Sep 2014
TL;DR: The desctop ontology is a semantic-based representation of the main functions of a container terminal in order to formally represent the operational flows which the terminal operators should be supported in.
Abstract: In this paper we describe the desctop ontology for container terminal operations. It is a semantic-based representation of the main functions of a container terminal, in order to formally represent the operational flows which the terminal operators should be supported in.