Este volume descreve o trabalho multi e interdisciplinar de pesquisa realizado na área de Inteligência Artificial aplicada à Educação, tendo como objetivo principal à proposta de uma metodologia de trabalho suportada por um ambiente na Web como recurso de apoio à aprendizagem almejada pela subárea de Programação Computacional, nos cursos de graduação em Informática. O trabalho investigativo e experimental foi desenvolvido com base na teoria proposta por Ausubel e o ambiente desenvolvido possui arquitetura baseada nos Sistemas Tutores Inteligentes, onde se buscou criar um Assistente Virtual de Ensino Inteligente, cujo comportamento é modelado a partir de um conjunto de regras oriundas da Lógica Fuzzy. Esta base de regras busca estabelecer uma nova forma de análise e assistência no acompanhamento da evolução de aprendizagem do aluno, tendo por base os pressupostos da teoria ausubeliana. A organização dos conteúdos na base de domínio utiliza uma estrutura organizada na forma de Mapas Conceituais, os quais possuem relação com as funções de pertinência associadas aos objetivos destes conteúdos. O trabalho experimental foi realizado na universidade onde o autor trabalha como docente, permitindo que fossem realizadas as análises e entrevistas de forma facilitada. O protótipo, criado para validar alguns aspectos da tese, obteve sucesso e constatou um aproveitamento médio melhor na aprendizagem em Programação Computacional. / This volume describe the multi and interdisciplinary work of made research in the Artificial Intelligence area applied to Education, with the main objective to the purpose of one methodology of work that has the support by Web environment as a way of support for the expected learning by the Computational Programming sub area in the graduation courses of Informatics. The investigative and experimental work was developed based in the theory proposed by Ausubel and the developed environment has the architecture based in the Intelligent Tutoring Systems, looking for a creation of one Intelligent Teaching Assistant, which the behavior is model from the rule group with origin in Fuzzy Logic. This base of rules search to establish one new form of analysis and assistance to go along with evolution of student knowledge, basing in the presuppositions of Subsumption Theory. The organization of contents in the base of dominion use one organized structure in Conceptual Maps form, that have the relation with functions of associated relevant to the objectives of these contents. The experimental work was realized in university where the author works as a teacher, giving the permission to realize the analysis and interviews in the easy way. The prototype, created for some aspect validation of the thesis it was obtained success and it was consisted a medium development better than the learning in the Computacional Programming.

O objetivo deste trabalho é analisar criticamente as transformações pelas quais o sistema capi-talista vem passando nas relações de produção com a emergência das novas tecnologias de informação e comunicação. A apresentação leva em consideração o fato de que hoje o capital subordina a produção com uma intensidade nova e de um modo novíssimo ligado à emergên-cia do conhecimento-capital. Apoiado na tese da desmedida do valor de Prado (2005), este trabalho retoma as formas de subsunção do trabalho ao capital (formal, material e real) deriva-das d\'O Capital de Karl Marx, procurando delinear uma sequência lógica e histórica para a gênese de uma nova forma, qual seja, a subsunção intelectual do trabalho ao capital, que seria típica de um período de produção pós-grande industrial. Para explicitar mais esses processos de mudança, toma como objeto de estudo a indústria fonográfica. Esta, por depender em última instância do trabalho criativo (uma vez que é intensiva em conhecimento e inovações), vem sofrendo os efeitos da emergência das novas tecnologias de uma forma bastante negativa do ponto de vista do capital e de uma forma, talvez, muito positiva no que tange à produção e à distribuição de mercadorias de forma autônoma e independente do capital. Através de estu-dos de caso e evidências empíricas, procura demonstrar como as descontinuidades que estão presentes na indústria fonográfica, principalmente as que emergiram no século XXI, mudaram de uma vez por todas os modelos de negócios tradicionais desta indústria. Ao final demostra que, apesar de hoje em dia existir cada vez mais a possibilidade da criação de música de forma autônoma e independente, a produção de música ainda é realizada por trabalhadores que, no limite, estão subsumidos intelectualmente à relação de capital. / The aim of this work is to critically analyze the transformations that the capitalist system has experienced in the relations of production with the emergence of the new information and communication technologies. The presentation will take into account the fact that capital now subordinates production with a new intensity and in a brand new way that is linked to the emergence of knowledge-capital. Supported by Prado\'s (2005) thesis of the desmeasure of value, this work reapproaches the forms of subsumption of labor to capital (formal, material and real) derived from Karl Marx\'s Capital, trying to delineate a logical and historical sequence to the genesis of a new form, namely, the intellectual subsumption of labor to capital, which would be typical of a period of post-large-scale industry. Looking to further explain these processes of change, the recording industry is taken as object of study. As it depends mostly on the creative work (because it is knowledge- and innovation-intensive) it has been suffering the effects of the emergence of new technologies in a very negative perspective from capital\'s point of view, and in a way, perhaps, very positive regarding the production and distribution of goods in an autonomous and independent way. Through case studies and empirical evidence, it strives to show how the discontinuities that are present in the music industry, especially those that emerged in the twenty-first century, changed once and for all the recording industry\'s traditional business models. At the end it demonstrates that, although today there is an increasing possibility of creating music in an autonomous and independent way, music production is still undertaken by workers who, ultimately, are intellectually subsumed to the capital\'s relations.

Este volume descreve o trabalho multi e interdisciplinar de pesquisa realizado na área de Inteligência Artificial aplicada à Educação, tendo como objetivo principal à proposta de uma metodologia de trabalho suportada por um ambiente na Web como recurso de apoio à aprendizagem almejada pela subárea de Programação Computacional, nos cursos de graduação em Informática. O trabalho investigativo e experimental foi desenvolvido com base na teoria proposta por Ausubel e o ambiente desenvolvido possui arquitetura baseada nos Sistemas Tutores Inteligentes, onde se buscou criar um Assistente Virtual de Ensino Inteligente, cujo comportamento é modelado a partir de um conjunto de regras oriundas da Lógica Fuzzy. Esta base de regras busca estabelecer uma nova forma de análise e assistência no acompanhamento da evolução de aprendizagem do aluno, tendo por base os pressupostos da teoria ausubeliana. A organização dos conteúdos na base de domínio utiliza uma estrutura organizada na forma de Mapas Conceituais, os quais possuem relação com as funções de pertinência associadas aos objetivos destes conteúdos. O trabalho experimental foi realizado na universidade onde o autor trabalha como docente, permitindo que fossem realizadas as análises e entrevistas de forma facilitada. O protótipo, criado para validar alguns aspectos da tese, obteve sucesso e constatou um aproveitamento médio melhor na aprendizagem em Programação Computacional. / This volume describe the multi and interdisciplinary work of made research in the Artificial Intelligence area applied to Education, with the main objective to the purpose of one methodology of work that has the support by Web environment as a way of support for the expected learning by the Computational Programming sub area in the graduation courses of Informatics. The investigative and experimental work was developed based in the theory proposed by Ausubel and the developed environment has the architecture based in the Intelligent Tutoring Systems, looking for a creation of one Intelligent Teaching Assistant, which the behavior is model from the rule group with origin in Fuzzy Logic. This base of rules search to establish one new form of analysis and assistance to go along with evolution of student knowledge, basing in the presuppositions of Subsumption Theory. The organization of contents in the base of dominion use one organized structure in Conceptual Maps form, that have the relation with functions of associated relevant to the objectives of these contents. The experimental work was realized in university where the author works as a teacher, giving the permission to realize the analysis and interviews in the easy way. The prototype, created for some aspect validation of the thesis it was obtained success and it was consisted a medium development better than the learning in the Computacional Programming.

The problem of rewriting a concept given terminology can informally be stated as follows: given a terminology T (i.e., a set of concept definitions) and a concept description C that does not contain concept names defined in T, can this description be rewritten into a 'related better' description E by using (some of) the names defined in T? In this paper, we first introduce a general framework for the rewriting problem in description logics, and then concentrate on one specific instance of the framework, namely the minimal rewriting problem (where 'better' means shorter, and 'related' means equivalent). We investigate the complexity of the decision problem induced by the minimal rewriting problem for the languages FL₀, ALN, ALE and ALC, and then introduce an algorithm for computing (minimal) rewritings for the languages ALE and ALN. Finally, we sketch other interesting instances of the framework. Our interest for the minimal rewriting problem stems from the fact that algorithms for non-standard inferences, such as computing least common subsumers and matchers, usually produce concept descriptions not containing defined names. Consequently, these descriptions are rather large and hard to read and comprehend. First experiments in a chemical process engineering application show that rewriting can reduce the size of concept descriptions optained as least common subsumers by almost two orders of magnitude. / This is a revised version of LTCS-Report 99-12 containing revised proofs of the technical results. / An abridged version of the original report appeared in the Procedings of the International Conference on Knowledge Representation and Reasoning (KR'2000).

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableau algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. In this paper, we address the problem of how to compute this basis efficiently, by adapting methods from formal concept analysis.

Action formalisms based on description logics (DLs) have recently been introduced as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent Calculus. However, existing DL action formalisms fail to include general TBoxes, which are the standard tool for formalising ontologies in modern description logics. We define a DL action formalism that admits general TBoxes, propose an approach to addressing the ramification problem that is introduced in this way, and perform a detailed investigation of the decidability and computational complexity of reasoning in our formalism.

We identify a general property of concrete domains that is sufficient for proving decidability of DLs equipped with them and GCIs. We show that some useful concrete domains, such as temporal one based on the Allen relations and a spatial one based on the RCC-8 relations, have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with such concrete domains.

Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems remain tractable even when admitting general concept inclusion axioms and simple role inclusion axioms.

Recently, it has been shown that the small DL EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL₀, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL₀ becomes already intractable in the presence of aclyc TBoxes, it remains tractable in EL even w.r.t. general concept inclusion axioms (GCIs). On the one hand, we will extend the positive result for EL by identifying a set of expressive means that can be added to EL without sacrificing tractability. On the other hand, we will show that basically all other additions of typical DL constructors to EL with GCIs make subsumption intractable, and in most cases even EXPTIME-complete. In addition, we will show that subsumption in FL₀ with GCIs is EXPTIME-complete.