Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

In very recent work, we introduced a non-termination preserving transformation from logic programs with cut to definite logic programs. While that approach allows us to prove termination of a large class of logic programs with cut automatically, in several cases the transformation results in a non-terminating definite logic program. In this paper we extend the transformation such that logic programs with cut are no longer transformed into definite logic programs, but into dependency triple problems. By the implementation of our new method and extensive experiments, we empirically evaluate the practical benefit of our contributions

Customer Satisfaction Measurement with Services of a Design Agency

Import 29/09/2010Tato diplomová práce se zabývala analýzou spokojenosti zákazníků designové společnosti. Cílem mé diplomové práce bylo měření spokojenosti zákazníků a vyvození závěrů pro zlepšení vedoucí ke zmírnění slabých stránek, tím k zajištění vyššího uspokojení zákazníků a udržení úrovně rozvoje společnosti. Teoretická část diplomové práce se zabývá výkladem teoretických poznatků, které zachycují spokojenost zákazníka, analýzu marketingového mixu, SWOT analýzu a poziční mapu. V praktické části byl proveden marketingový výzkum, dotazováním zákazníků Eclosion Design. Výsledky získané výzkumem byly použity pro sestavení návrhů a doporučení pro Eclosion Design, jejichž případná realizace by mohla přispět ke zlepšení spokojenosti zákazníků a udržení rozvoje. Z výzkumu bylo zjištěno, že zákazníci jsou s poskytovanými službami společnosti Eclosion Design spokojeni, ale společnost má nedostatky v oblasti nedodržování termínu a doby dodání. Důležité je najmout nové pracovníky, zajistit lepší přerozdělení práce v organizaci a začít propagovat své služby pomocí cílené reklamy.This diploma thesis analyses customers satisfaction with Design Agency services. The main goal was to target, measure and analyse Customers satisfaction and to evaluate any outcomes from such a research in order to increase the quality of the services and to maintain constant development. The theoretical part of this diploma thesis aims on theoretical explanations of the facts describing customer satisfaction, analyze the marketing research, SWOT analysis and position map. In the practical part a marketing research was done by asking the customers of the Eclosion design. The data harvested by the research were implemented into suggestions how to improve the company`s services. In case the suggestions would be executed, it could definitely contribute to increase customers satisfaction. The conclusion of the research is that Customers are mainly satisfied with the services provided. However, there is still some space for improvement in the area of time efficiency, time schedules and deadlines.It is the upmost priority to increase the human capital in order to manage the amount of work. Also, the Design company should promote itself using targeted advertising.116 - Katedra marketingu a obchoduvelmi dobř

Automated Termination Analysis for Logic Programs by Term Rewriting

Abstract. There are two kinds of approaches for termination analysis of logic programs: “transformational ” and “direct ” ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a term rewrite system (TRS) and then analyze termination of the resulting TRS instead. Thus, transformational approaches make all methods previously developed for TRSs available for logic programs as well. However, the applicability of most existing transformations is quite restricted, as they can only be used for certain subclasses of logic programs. (Most of them are restricted to well-moded programs.) In this paper we improve these transformations such that they become applicable for any definite logic program. To simulate the behavior of logic programs by TRSs, we slightly modify the notion of rewriting by permitting infinite terms. We show that our transformation results in TRSs which are indeed suitable for automated termination analysis. In contrast to most other methods for termination of logic programs, our technique is also sound for logic programming without occur check, which is typically used in practice. We implemented our approach in the termination prover AProVE and successfully evaluated it on a large collection of examples.