Agents as multi-threaded logical objects

In this paper we describe a distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program. The key features of the language, such as static and dynamic object methods and multiple inheritance, are illustrated through a series of small examples. We show how we can implement object servers, allowing remote spawning of objects, which we can use as staging posts for mobile agents. We give as an example an information gathering mobile agent that can be queried about the information it has so far gathered whilst it is gathering new information. Finally we define a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic, handling multiple queries and information updates concurrently. We believe that the combination of the concurrent OO and the LP programming paradigms produces a powerful tool for quickly implementing rational multi-agent applications on the internet.

iMap : um mecanismo de inferência para mapas conceituais

Mapas Conceituais são representações gráficas do conhecimento de uma pessoa num dado momento e área de conhecimento. Por sua natureza investigativa, são utilizados como ferramentas de apoio em abordagens pedagógicas que objetivam promover a aprendizagem significativa. No entanto, o processo de avaliação de um mapa tende a ser custoso pois acarreta uma pesada carga de processamento cognitivo por parte do avaliador, já que este precisa mapear os conceitos e relações em busca de nuances de conhecimento alí presentes. Essa pesquisa tem por objetivo aumentar o nível de abstração nas interações entre o avaliador e os mapas conceituais fornecendo uma camada intermediária de inteligência computacional que favoreça a comunicação por meio de perguntas e respostas em linguagem natural, fornecendo ao avaliador ferramentas que lhe permita examinar o conteúdo do mapa conceitual sem exigir deste o mapeamento visual dos conceitos e relações presentes nos mapas avaliados. Uma ferramenta é prototipada e uma prova de conceito apresentada. A análise da arquitetura proposta permitiu definir uma arquitetura final com características que permitem potencializar o uso de mapas conceituais e facilitar diversas operações pedagógicas com estes. Essa pesquisa situa-se na área de investigação de sistemas de perguntas e resposta, aplicando técnicas de processamento de linguagem natural para análise da pergunta e interpretação do mapa conceitual e aplica técnica de inteligência artificial para inferir respostas às perguntas.

Multi-agent based electricity market simulator with VPP: Conceptual and implementation issues

This paper presents a new architecture for the MASCEM, a multi-agent electricity market simulator. This is implemented in a Prolog which is integrated in the JAVA program by using the LPA Win-Prolog Intelligence Server (IS) provides a DLL interface between Win-Prolog and other applications. This paper mainly focus on the MASCEM ability to provide the means to model and simulate Virtual Power Producers (VPP). VPPs are represented as a coalition of agents, with specific characteristics and goals. VPPs can reinforce the importance of these generation technologies making them valuable in electricity markets.

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

Mecanismos de suporte à execução concorrente de programas em lógica

Dissertacção apresentada para a obtenção do Grau de Mestre em Engenharia Informática pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia.

Using perspective schema and a reference model to design the ETL process

Dissertação apresentada para a obtenção do Grau de Doutor em Informática

Sistema pericial para auditoria de registos clínicos

O registo clinico é um documento hospitalar confidencial, nele é registado todo o percurso clinico de um determinado paciente. Esse percurso é registado através da atribuição de códigos descritos num sistema de classificação, também denominados de dados da codificação. Os dados da codificação são armazenados electronicamente numa Base de Dados, e é a partir dela que certas medidas, tais como facturação hospitalar, financiamentos hospitalares anuais, tratamentos médicos, ou até mesmo dados epidemiológicos, são adotadas. Portanto torna-se fundamental a garantia da qualidade na área da codificação clinica, para isso é necessário recorrer a processos de auditorias aos registos clínicos. O processo de auditoria é uma atividade independente de avaliação, cujo objetivo visa acrescentar valor e melhorar os objetos e processos da auditoria. Atualmente uma ferramenta denominada de Programa Auditor é utilizada, contudo essa ferramenta demonstra uma tecnologia já ultrapassada. A Tese que se pretende defender é a de que, através de Sistemas Periciais, é possível realizar auditorias internas aos registos clínicos. Pretende-se ainda demonstrar que dos Sistemas Periciais e um benefício para os peritos na área, pois diminui a probabilidade de erros e torna o processo de verificação menos moroso. Neste contexto, o objetivo desta Dissertação prende-se em definir e implementar um Sistema Pericial que permita a auditoria de registos clínicos hospitalares. O Sistema Pericial dever a ainda ser capaz de traduzir o raciocínio do perito, detectando assim diversos tipos de erros que traduzem num registo clínico não conforme. Por sua vez, foi desenvolvido um protótipo de um Sistema Pericial para auditoria de registos clínicos em linguagem PROLOG. Este mesmo protótipo serviu de base à realização de uma experiência que permitiu comparar com o programa Auditor e verificar a sua aplicabilidade no dia-a-dia hospitalar.

Every normal logic program has a 2-valued semantics: theory, extensions, applications, implementations

Trabalho apresentado no âmbito do Doutoramento em Informática, como requisito parcial para obtenção do grau de Doutor em Informática

Generador d'horaris d'un centre docent

El projecte intenta resoldre el problema que suposa organitzar l'horari escolar en els centres docents. S'usa el Visual Bàsic per aconseguir, omplir i mostrar el contingut d’una base de dades feta amb Microsoft Access. Per generar el resultat, s'utilitza el llenguatge de programació lògica Prolog, el qual en ser un llenguatge declaratiu i utilitzant una llibreria de restriccions que permet fer modificacions d’una forma molt versàtil, aconsegueix un entorn de programació ideal per atacar aquest tipus de problema. Amb una interacció del Visual Bàsic amb el Prolog es pot mostrar d’una manera elegant i fàcil d’entendre el resultat obtingut

Komik, Ernst und Mise en page. Zum Problem der Farblinien in Heinrich Wittenwilers "Der Ring"

Der Aufsatz nähert sich dem Interpretationsproblem des ,Ring', eines seit Forschungsbeginn ausserordentlich konträr diskutierten Textes, aus wissenschaftsanalytischer Perspektive. Er führt die Zersplitterung und die Extremisierung der Deutungsansätze, die die breite Forschung zu Wittenwilers Werk kennzeichnet, auf einen vergleichsweise simplen Befund zurück: die ungeklärte Frage nach dem Verhältnis von Komik und Didaktik und der Ernsthaftigkeit des lehrhaften Angebots im ,Ring'. Die so auf grundlegendster Ebene offen gebliebene Erfassung des Textes führt in einen interpretatorischen Leerraum, in dem die widersprüchlichsten, oft wissenschaftsideologisch begründeten Positionen Platz finden. Ihre Analyse zeigt, dass sie sich in wiederkehrende Gruppierungen ordnen. Als Schlüsselglied sowohl der Befunddaten als auch der konträren Vernetzungen von Befund und Deutung wird die wechselnd rote und grüne Initialenlinie der Münchner Handschrift identifiziert. Als im Prolog eingeführte Markierung von Ernst auf der einen und Komik auf der anderen Seite ist sie nicht nur visueller Ausdruck des Deutungsproblems des ,Ring', sondern sie hat es wegen der scheinbaren Unstimmigkeit ihrer Zuweisungen auch wesentlich bedingt. Der Aufsatz zeigt ihren bisher übersehenen Aufschluss für das Verständnis des Werks. Nimmt man die Linie als graphisches Verfahren ernst, stellt sie sich als strukturelle Markierung zum Auffinden von Text im diskontinuierlichen Zugriff dar - nicht aber, wie man sie bisher ausnahmslos verstand, als semantische Kommentierung eines laufenden, kontinuierlich zu lesenden Textes. Die strukturierende Funktion des Farbwechsels ist auf zwei Ebenen nachzuweisen: Auf Makroebene trennen seine Zuweisungen vorwiegend narrative und vorwiegend wissensvermittelnde Grosspartien des ,Ring' durch eine jeweilige Grundfarbe. Auf Mikroebene wird diese Grundfarbe durch die jeweils andere Farbe durchbrochen, um formale Einschnitte wie etwa Sprecherwechsel, Ortswechsel, Handlungsneueinsätze, Beginn und Ende eines eingeschalteten Binnentextes oder einer Sentenz anzuzeigen. Dem Benutzer der autornahen Handschrift sollte so in einem ersten Schritt (makrostrukturell) ermöglicht werden, gezielt auf gewünschte Stellen des Textes zuzugreifen und ihn in einem zweiten Schritt (mikrostrukturell) schneller zu erfassen. Nicht in seiner Umsetzung, sehr wohl aber in seiner Funktion steht dieses ungewöhnliche Layout zeitgenössischen Techniken der Buchgliederung durchaus nahe. Auch im Profil der Zusammenstellung seiner Binnentexte rückt der ,Ring' damit in die Nähe der im Spätmittelalter beliebten Sammelhandschriften mit Ziel einer Wissenssumme, die hier narrativ verbundenen wird. Es scheint, als möchte der ,Ring' in einem ungewöhnlichen Experiment beides sein: Kompilation und Werkganzes, Wissenssammlung und Erzählwerk - Texte und Text. Als Ergebnis einer Neuuntersuchung des Münchner codex unicus des ,Ring' weist der Beitrag schliesslich darauf hin, dass auch zahlreiche Markierungszeichen am Spaltenrand formale und strukturelle Texteinschnitte anzeigen und somit die gleiche Funktion haben wie der Farbwechsel auf Mikroebene. Ein kausaler, produktionstechnischer Zusammenhang zwischen diesen Zeichen und der Verteilung des Farbwechsels ist nicht auszuschliessen, zumal beide Verfahren etwa im letzten Fünftel des Textes zunehmend zusammenfallen. Möglicherweise war nur die makrostrukturelle Funktion des Farbwechsel ursprünglich indendiert und mit der Erläuterung im Prolog bezeichnet, während seine mikrostrukturelle Funktion erst Resultat des Abschreibprozesses ist.

A Virtual Machine for a Type-omega Denotational Proof Language

In this thesis, I designed and implemented a virtual machine (VM) for a monomorphic variant of Athena, a type-omega denotational proof language (DPL). This machine attempts to maintain the minimum state required to evaluate Athena phrases. This thesis also includes the design and implementation of a compiler for monomorphic Athena that compiles to the VM. Finally, it includes details on my implementation of a read-eval-print loop that glues together the VM core and the compiler to provide a full, user-accessible interface to monomorphic Athena. The Athena VM provides the same basis for DPLs that the SECD machine does for pure, functional programming and the Warren Abstract Machine does for Prolog.

El problema P-S de McCarthy y otros acertijos.

Resumen de los autores

Generador d'horaris d'un centre docent

El projecte intenta resoldre el problema que suposa organitzar l'horari escolar en els centres docents. S'usa el Visual Bàsic per aconseguir, omplir i mostrar el contingut d’una base de dades feta amb Microsoft Access. Per generar el resultat, s'utilitza el llenguatge de programació lògica Prolog, el qual en ser un llenguatge declaratiu i utilitzant una llibreria de restriccions que permet fer modificacions d’una forma molt versàtil, aconsegueix un entorn de programació ideal per atacar aquest tipus de problema. Amb una interacció del Visual Bàsic amb el Prolog es pot mostrar d’una manera elegant i fàcil d’entendre el resultat obtingut

Robust abandoned object detection integrating wide area visual surveillance and social context

This paper presents a video surveillance framework that robustly and efficiently detects abandoned objects in surveillance scenes. The framework is based on a novel threat assessment algorithm which combines the concept of ownership with automatic understanding of social relations in order to infer abandonment of objects. Implementation is achieved through development of a logic-based inference engine based on Prolog. Threat detection performance is conducted by testing against a range of datasets describing realistic situations and demonstrates a reduction in the number of false alarms generated. The proposed system represents the approach employed in the EU SUBITO project (Surveillance of Unattended Baggage and the Identification and Tracking of the Owner).

An extended query-the-user tool for expert systems

An extended version of HIER, a query-the-user facility for expert systems is presented. HIER was developed to run over Prolog programs, and has been incorporated to systems that support the design of large and complex applications. The framework of the extended version is described,; as well as the major features of the implementation. An example is included to illustrate the use of the tool, involving the design of a specific database application.