Fernando Zacarias

On Updates of Logic Programs: A Properties-Based Approach

We have studied the update operator ⊕ defined in [4] without tautologies and we have observed that satisfies an interesting property. This property is similar to one postulate proposed by AGM but, in this case for nonmonotonic logic and that we called WIS. Also, we consider other five additional basic properties about update programs and we show that ⊕ satisfies them. So, this work continues the analysis about the AGM postulates with respect to operator ⊕ under the refinated view that includes knowledge and beliefs that we began in a recent previous paper and that satisfies the WIS property for closed programs under tautologies.

High-Level Logic Programming

We introduce the paradigm of High-Level Logic Programming. This paradigm is the consolidation of our recent results on disjunctions, sets, partial-order clauses and aggregation. We show how these concepts are integrated in a natural way into the standard logic programming framework. For this purpose, we present several well known examples from the literature that support this claim. Our approach to define the declarative semantics of HLL (High-Level Logic) programs consists on a translation of them to datalog disjunctive programs and then to use D1-WFS-COMP.

Smart Tourism in 1-Click

Abstract The use and application of technology is the challenge of tourism for the XXI century. Thus, a novel application for mobile devices is deployed. Our application allows you to browse all points of interest to the user such as hotels, restaurants, attractions, etc. Our application incorporates at first instance the city of Mexico, one of the cities most visited by tourists. With respect to Mexico city we added three important features to our application. First, the user can indicate whether traveling by car or walks. Second, user can choose city area to visit, as well as the maximum distance at which he want to move. Third, our application will generate the shortest route to follow. Secondly but no less important, our application incorporates the city of Puebla, a city declared World Heritage. It support the efficiently tourists in planning their stay in Puebla City showing user a set of tourist places and services, both useful for tourists, of which user chooses those who want to know. From this set of selected places our application determines the shortest path using the traveling salesman algorithm. Also, emergency services information about all local points is available. Generation of custom path is integrated, allowing user to have Google maps with all places to visit with a true an accurate location. Finally, our application allows the user to display maps of tourist places in real time without the GPS service, instead we use GPRS via Wireless Application Protocol with the Google Maps API.

Mobile architecture for question answering

Architecture for a mobile Question Answering system based on WAP technologies is deployed. The architecture proposes moves the issue of Question Answering to the context of mobility. This paradigm ensures that QA is seen as an activity that provides entertainment and excitement pleasure. This characteristic gives to QA an added value. Considering that the mobile-phone has had a boom in the last years and that a lot of people already have mobile telephones (approximately 2.5 billions), we propose architecture for a new mobile system that makes QA something natural and effective for work in all fields of development. This obeys to that the new mobile technology can help us to achieve our perspectives of growth. This system provides to user with a permanent communication in anytime, anywhere and any device (PDAs, cell-phone, NDS, etc.).

Search for Answers in Domain Specific Supported by Intelligent Agents

Search for answers in specific domains is a new milestone in question answering. Traditionally, question answering has focused on general domain questions. Thus, the most relevant answers (or passages) are selected according to the type of question and the Named Entities included in the possible answers. In this paper, we present a novel approach on question answering over specific (or technical) domains. This proposal allows us to answer questions such as “What article is appropriate for ... “, “What are the articles related to ... “, these kind of questions cannot be answered by a general question answering system. Our approach is based on a set of laws of a specific domain, which contain a large set of laws regarding the work organized into a hierarchy. We consider generic concepts such as “article” semantic categories. Our results on the corpus of Federal Labor Law show that this approach is effective and highly reliable.

Puebla in the palm of your hands

An interactive tourist tool with integrated maps navigation of Puebla is deployed. Mapping and navigation to all local points of interest such as hotels, restaurants, attractions, etc., are contained in our mobile tool. This is a novel mobile tool that support the efficient tourists in planning their stay in the Puebla City showing user a set of tourist sites and services, both useful for tourists, of which user chooses those who want to know. From this set of selected sites our application determines the shortest path using the traveling salesman algorithm. Besides, emergency services information about all local points is available. Generation of custom path is integrated, allowing user to have a google maps with all places to visit with a true an accurate location. Finally, our application allows the user to display maps of tourist sites in real time without the GPS service, instead we use GPRS via the WAP with the Google Maps API. This dramatically reduces costs benefiting tourism in Puebla.

Knowledge Representation Using High-Level Non-monotonic Reasoning

We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit negation, and partial-order clauses. We show how these concepts are integrated in a natural way into the standard logic programming framework. For this purpose, we present several well known examples from the literature that motivate the need of this new paradigm. Finally, we define a declarative semantics for HLNM reasoning.