Unification in Description Logics has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the Description Logic EL, which is used to define several large biomedical ontologies, unification is NP-complete. An NP unification algorithm for EL based on a translation into propositional satisfiability (SAT) has recently been presented. In this report, we extend this SAT encoding in two directions: on the one hand, we add general concept inclusion axioms, and on the other hand, we add role hierarchies (H) and transitive roles (R+). For the translation to be complete, however, the ontology needs to satisfy a certain cycle restriction. The SAT translation depends on a new rewriting-based characterization of subsumption w.r.t. ELHR+-ontologies.

Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. A goal-oriented NP unification algorithm for EL that uses nondeterministic rules to transform a given unification problem into solved form has recently been presented. In this report, we extend this goal-oriented algorithm in two directions: on the one hand, we add general concept inclusion axioms (GCIs), and on the other hand, we add role hierarchies (H) and transitive roles (R+). For the algorithm to be complete, however, the ontology consisting of the GCIs and role axioms needs to satisfy a certain cycle restriction.

O objeto da discussão é a racionalidade das decisões judiciais em casos em que se constata conflito de princípios ou entre princípios e regras, casos esses considerados difíceis, uma vez que não há no ordenamento jurídico solução predeterminada que permita mera subsunção dos fatos à norma. São examinados métodos alternativos ao de subsunção. O primeiro é o método da ponderação, difundido principalmente por Robert Alexy, com suas variantes. Entretanto, o problema que surge com a aplicação do método da ponderação é da imponderabilidade entre ponderação e vinculação à lei, ou seja, a escolha dos pesos dos princípios e sua potencial desvinculação da lei. O segundo modelo, chamado de coerentista, busca conferir alguma racionalidade e fornecer critérios que poderiam explicar escolhas entre valores conflitantes subjacentes à legislação e mesmo aos pesos do método de ponderação. Dentro do modelo coerentista, examina-se em particular a versão inferencial que explora a coerência entre regras e princípios pela inferência abdutiva dos princípios a partir das regras. A aplicação dos diferentes modelos é feita em duas decisões prolatadas pelo Supremo Tribunal Federal em casos de conflito de princípio, casos Ellwanger e de aborto de anencéfalos. O que não permite generalização, mas oferece ilustrações específicas das virtudes e vícios desses modelos de decisão. / The subject of this study is rationality of judgments when there is collision of principles or conflict between principles and rules, which are hard cases, since there is no predetermined solution in legal system that allows only subsuming facts to the norm. Alternative methods are then examined. The first is the method of weighting and balancing proposed mainly by Robert Alexy, in spite of its variants. However, the difficulty to apply such method is theweightlessness between weighing and law binding, that is, the choice of weight of principles and its untying to the Law. The second model, called coherence model, intends to reach any rationality and provide criteria that could explain choices between conflicting values underlying Law and also the ascription of weights of the weighing and balancing method. In coherence model, it is studied especially its inferential version that explores coherence between rules and principles through abduction of principles from rules. These methods are tested in two decisions by Brazilian Supreme Court in cases of collision of principle, in Ellwanger and anencephalic abortion cases. That does not allow a general approach, but only specific outlines of the virtues and defects of these models of decision.

Perception-action (P-A) learning is an approach to cognitive system building that seeks to reduce the complexity associated with conventional environment-representation/action-planning approaches. Instead, actions are directly mapped onto the perceptual transitions that they bring about, eliminating the need for intermediate representation and significantly reducing training requirements. We here set out a very general learning framework for cognitive systems in which online learning of the P-A mapping may be conducted within a symbolic processing context, so that complex contextual reasoning can influence the P-A mapping. In utilizing a variational calculus approach to define a suitable objective function, the P-A mapping can be treated as an online learning problem via gradient descent using partial derivatives. Our central theoretical result is to demonstrate top-down modulation of low-level perceptual confidences via the Jacobian of the higher levels of a subsumptive P-A hierarchy. Thus, the separation of the Jacobian as a multiplying factor between levels within the objective function naturally enables the integration of abstract symbolic manipulation in the form of fuzzy deductive logic into the P-A mapping learning. We experimentally demonstrate that the resulting framework achieves significantly better accuracy than using P-A learning without top-down modulation. We also demonstrate that it permits novel forms of context-dependent multilevel P-A mapping, applying the mechanism in the context of an intelligent driver assistance system. / DIPLECS / GARNICS / CUAS

The principle of modern production is to combine modern production techniques, new knowledge, combined with increasingly sophisticated computerized development processes to increase production and processing continuous model itself. The Third Industrial Revolution, characterized by extreme specialization of intellectual labor and tendency to erase the borders between manual and rights, must be analyzed from the perspective of automation based microelectronics, its historical implications and consequences over production process. This paper aims to contribute to this discussion studying the codification of intellectual work from the creation of computing artifacts, or more specifically, the establishment of languages and computational methods that allow the broad process codification of knowledge, fruit of development and production of software for this purpose. The text makes the analysis of two separated types of intellectual work s subsumption. The first type, connected the emergence of the programming language, is characterized by the programmer framework to software tools aimed at the programming process. This activity is strongly linked to language programming methodologies and software development, is required to design the computer program in a process of creating software by software. In this type of production, the software assumes the role of design tool and develops a product that is also a software. In other words, the CAD / CAM systems are built from software tools within a development process marked by similar stages as the automated industrial production: design and implementation. The second type of subsumption is due to the product originated from the first type. Software developed for industry, such as CAD / CAM, allow both the planned design of industrial products and the objectified execution operated by automated machines controlled by software. The industrial software designed to run on machines automated are capable of reprogramming on factory floor through simplified interface in Computer Numerical Control - CNC, thereby expanding the activities of machine s operators and thus extending the boundaries of work in subsumption capital. / O princípio da produção moderna é combinar novas técnicas de conhecimento, aliadas a processos de desenvolvimento computadorizados cada vez mais sofisticados para aumento da produção e aperfeiçoamento contínuo do próprio modelo. A Terceira Revolução Industrial, caracterizada pela extrema especialização do trabalho intelectual e a tendência de apagamento das fronteiras entre trabalho manual e intelectual, deve ser analisada sob o prisma da automação com base microeletrônica, suas implicações históricas e conseqüências ao longo do processo produtivo. O objetivo deste texto é contribuir para essa discussão ao estudar a codificação do trabalho intelectual a partir da criação de artefatos computacionais, ou mais especificamente, do estabelecimento das linguagens e métodos computacionais que permitem o amplo processo de codificação do conhecimento, fruto do desenvolvimento e produção de software com esta finalidade. O texto efetua a análise de dois tipos distintos de subsunção do trabalho intelectual. O primeiro tipo, ligado ao surgimento da linguagem de programação, é caracterizado pelo enquadramento do programador às ferramentas de software voltadas à programação. Essa atividade, fortemente atrelada às linguagens de programação e metodologias de desenvolvimento de software, é requerida para a concepção do programa de computador em um processo de criação de softwares por meio de softwares. Nesse tipo de produção, um software assume o papel de ferramenta de concepção e desenvolvimento de um produto que é também um software. Em outros termos, os sistemas CAD/CAM são construídos a partir de ferramentas de software cujo processo de desenvolvimento é marcado por fases similares às da produção industrial automatizada: concepção e execução. O segundo tipo de subsunção é decorrente do produto originado do primeiro tipo. Os softwares desenvolvidos para a indústria, tal como o CAD/CAM, permitem tanto a concepção planejada dos produtos industriais quanto a execução objetivada operada pelas máquinas automatizadas controladas por softwares. Os softwares industriais desenvolvidos para serem executados nas máquinas automatizadas são passíveis de reprogramação no chão de fábrica através de interfaces simplificadas nos Controles Numéricos Computadorizados CNC, expandindo dessa forma as atividades dos operadores das máquinas e consequentemente ampliando os limites de subsunção de trabalho no capital.

O objeto da discussão é a racionalidade das decisões judiciais em casos em que se constata conflito de princípios ou entre princípios e regras, casos esses considerados difíceis, uma vez que não há no ordenamento jurídico solução predeterminada que permita mera subsunção dos fatos à norma. São examinados métodos alternativos ao de subsunção. O primeiro é o método da ponderação, difundido principalmente por Robert Alexy, com suas variantes. Entretanto, o problema que surge com a aplicação do método da ponderação é da imponderabilidade entre ponderação e vinculação à lei, ou seja, a escolha dos pesos dos princípios e sua potencial desvinculação da lei. O segundo modelo, chamado de coerentista, busca conferir alguma racionalidade e fornecer critérios que poderiam explicar escolhas entre valores conflitantes subjacentes à legislação e mesmo aos pesos do método de ponderação. Dentro do modelo coerentista, examina-se em particular a versão inferencial que explora a coerência entre regras e princípios pela inferência abdutiva dos princípios a partir das regras. A aplicação dos diferentes modelos é feita em duas decisões prolatadas pelo Supremo Tribunal Federal em casos de conflito de princípio, casos Ellwanger e de aborto de anencéfalos. O que não permite generalização, mas oferece ilustrações específicas das virtudes e vícios desses modelos de decisão. / The subject of this study is rationality of judgments when there is collision of principles or conflict between principles and rules, which are hard cases, since there is no predetermined solution in legal system that allows only subsuming facts to the norm. Alternative methods are then examined. The first is the method of weighting and balancing proposed mainly by Robert Alexy, in spite of its variants. However, the difficulty to apply such method is theweightlessness between weighing and law binding, that is, the choice of weight of principles and its untying to the Law. The second model, called coherence model, intends to reach any rationality and provide criteria that could explain choices between conflicting values underlying Law and also the ascription of weights of the weighing and balancing method. In coherence model, it is studied especially its inferential version that explores coherence between rules and principles through abduction of principles from rules. These methods are tested in two decisions by Brazilian Supreme Court in cases of collision of principle, in Ellwanger and anencephalic abortion cases. That does not allow a general approach, but only specific outlines of the virtues and defects of these models of decision.

Mutation testing is a powerful, but resource intense technique for asserting software quality. This report investigates two claims about one of the mutation operators on procedural logic, the relation operator replacement (ROR). The constrained ROR mutant operator is a type of constrained mutation, which targets to lower the number of mutants as a “do smarter” approach, making mutation testing more suitable for industrial use. The findings in the report shows that the hypothesis on subsumption is rejected if mutants are to be detected on function return values. The second hypothesis stating that a test case can only detect a single top-level mutant in a subsumption graph is also rejected. The report presents a comprehensive overview on the domain of mutation testing, displays examples of the masking behaviour previously not described in the field of mutation testing, and discusses the importance of the granularity where the mutants should be detected under execution. The contribution is based on literature survey and experiment. The empirical findings as well as the implications are discussed in this master dissertation.

Conceptual graphs (CGs) are an expressive and intuitive formalism, which plays an important role in the area of knowledge representation. Due to their expressiveness, most interesting problems for CGs are inherently undecidable. We identify the syntactically defined guarded fragment of CGs, for which both subsumption and validity is decidable in deterministic exponential time.

This paper compares two approaches for deriving subsumption algorithms for the description logic ALN: structural subsumption and an automata-theoretic characterization of subsumption. It turns out that structural subsumption algorithms can be seen as special implementations of the automata-theoretic characterization.

This work introduces the concept language ALCFM which is an extension of ALC to many-valued logics. ALCFM allows to express vague concepts, e.g. more or less enlarged or very small. To realize this extension to many-valued logics, the classical notions of satisfiability and subsumption had to be modied appropriately. For example, ALCFM-concepts are no longer either satisfiable or unsatisfiable, but they are satisfiable to a certain degree. The main contribution of this paper is a sound and complete method for computing the degree of subsumption between two ALCFM-concepts. / An abridged version of this paper has been published in the Proceedings of the 13th biennial European Conference on Artificial Intelligence (ECAI'98).