Negotiating with a logical-linguistic protocol in a dialogical framework

This book is the result of years of reflection. Some time ago, while working in commodities, the author felt how difficult it was to decide the order in which to use arguments during a negotiation process. What would happen if we translated the arguments into cards and played them according to the rules of the Bridge game? The results were impressive. There was potential for improvement in the negotiation process. The investigation went deeper, exploring players, cards, deals and the information concealed in the players´ announcements, in the cards and in the deals. This new angle brought the research to NeuroLinguistic Patterns and cryptic languages, such as Russian Cards. In the following pages, the author shares her discovery of a new application for Logical Dialogues: Negotiations, tackled from basic linguistic structures placed under a dialogue form as a cognitive system which ‘understands’ natural language, with the aim to solve conflicts and even to serve peace

Logico-linguistic semantic representation of documents

The knowledge behind the gigantic pool of data remains largely unextracted. Techniques such as ontology design, RDF representations, hpernym extraction, etc. have been used to represent the knowledge. However, the area of logic (FOPL) and linguistics (Semantics) has not been explored in depth for this purpose. Search engines suffer in extraction of specific answers to queries because of the absence of structured domain knowledge. The current paper deals with the design of formalism to extract and represent knowledge from the data in a consistent format. The application of logic and linguistics combined greatly eases and increases the precision of knowledge translation from natural language. The results clearly indicate the effectiveness of the knowledge extraction and representation methodology developed providing intelligence to machines for efficient analysis of data. The methodology helps machines to precise results in an efficient manner

Training of Crisis Mappers and Map Production from Multi-sensor Data: Vernazza Case Study (Cinque Terre National Park, Italy)

This aim of paper is to presents the development of a multidisciplinary project carried out by the cooperation between Politecnico di Torino and ITHACA (Information Technology for Humanitarian Assistance, Cooperation and Action). The goal of the project was the training in geospatial data acquiring and processing for students attending Architecture and Engineering Courses, in order to start up a team of "volunteer mappers". Indeed, the project is aimed to document the environmental and built heritage subject to disaster; the purpose is to improve the capabilities of the actors involved in the activities connected in geospatial data collection, integration and sharing. The proposed area for testing the training activities is the Cinque Terre National Park, registered in the World Heritage List since 1997. The area was affected by flood on the 25th of October 2011. According to other international experiences, the group is expected to be active after emergencies in order to upgrade maps, using data acquired by typical geomatic methods and techniques such as terrestrial and aerial Lidar, close-range and aerial photogrammetry, topographic and GNSS instruments etc.; or by non conventional systems and instruments such us UAV, mobile mapping etc. The ultimate goal is to implement a WebGIS platform to share all the data collected with local authorities and the Civil Protectio

Uniform Strategies

We consider turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve bundles of plays, that arise from some semantical motive. Typically, we can represent constraints on allowed strategies, such as being observation-based. We propose a formal language to specify uniformity properties and demonstrate its relevance by rephrasing various known problems from the literature. Note that the ability to correlate different plays cannot be achieved by any branching-time logic if not equipped with an additional modality, so-called R in this contribution. We also study an automated procedure to synthesize strategies subject to a uniformity property, which strictly extends existing results based on, say standard temporal logics. We exhibit a generic solution for the synthesis problem provided the bundles of plays rely on any binary relation definable by a finite state transducer. This solution yields a non-elementary procedure.Comment: (2012