27 research outputs found

    Wissenschaftlich-technischer Jahresbericht 1991

    Get PDF

    Wissenschaftlich-technischer Jahresbericht 1991

    Get PDF

    Specializing Interpreters using Offline Partial Deduction

    No full text
    We present the latest version of the Logen partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters.We show how to achieve Jones-optimality in a systematic way for several interpreters. Finally, we present and specialise a non-trivial interpreter for a small functional programming language. Experimental results are also presented, highlighting that the Logen system can be a good basis for generating compilers for high-level languages

    Semantic Cache Reasoners

    Get PDF

    Description Logics with Symbolic Number Restrictions

    Get PDF
    Aus der Einleitung: ā€žTerminological knowledge representation systems (TKR systems) are powerful tools not only to represent but also to reason about the knowledge on the terminology of an application domain. Their particular power lie in their ability to infer implicit knowledge from the knowledge explicitly stored in a knowledge base. Mainly, a TKR system consists of three parts: First, a terminological knowledge base which contains the explicit description of the concepts relevant for the application domain. Second, an assertional knowledge base which contains the description of concrete individuals and their relations. This description of concrete individuals is realized using the terminology fixed in the terminological knowledge base. Third, a TKR system comprises an inference engine which is able to infer implicit properties of the defined concepts and individuals such as subclass/superclass relations amongst concepts (subsumption), the classifcation of all defned concepts with respect to the subclass/superclass relation. This yields the class taxonomy. whether there exists an interpretation of the terminology where a given concept has at least one instance (satisfiability), to enumerate all individuals that are instances of a given concept (retrieval), given a concrete individual, to enumerate the most specific concepts of the terminology this individual is an instance of.

    Decidable Reasoning in Terminological Knowledge Representation Systems

    Get PDF
    Terminological knowledge representation systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a theoretical point of view a TKRS whose capabilities go beyond the ones of presently available TKRSs. The new features studied, often required in practical applications, can be summarized in three main points. First, we consider a highly expressive terminological language, called ALCNR, including general complements of concepts, number restrictions and role conjunction. Second, we allow to express inclusion statements between general concepts, and terminological cycles as a particular case. Third, we prove the decidability of a number of desirable TKRS-deduction services (like satisfiability, subsumption and instance checking) through a sound, complete and terminating calculus for reasoning in ALCNR-knowledge bases. Our calculus extends the general technique of constraint systems. As a byproduct of the proof, we get also the result that inclusion statements in ALCNR can be simulated by terminological cycles, if descriptive semantics is adopted.Comment: See http://www.jair.org/ for any accompanying file

    Abductive speech act recognition, corporate agents and the COSMA system

    Get PDF
    This chapter presents an overview of the DISCO project\u27s solutions to several problems in natural language pragmatics. Its central focus is on relating utterances to intentions through speech act recognition. Subproblems include the incorporation of linguistic cues into the speech act recognition process, precise and efficient multiagent belief attribution models (Corporate Agents), and speech act representation and processing using Corporate Agents. These ideas are being tested within the COSMA appointment scheduling system, one application of the DISCO natural language interface. Abductive speech act processing in this environment is not far from realizing its potential for fully bidirectional implementation

    Offline Specialisation in Prolog Using a Hand-Written Compiler Generator

    No full text
    The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evaluation of both functional and imperative languages. This paper demonstrates that the "cogen" approach is also applicable to the specialisation of logic programs (called partial deduction when applied to pure logic programs) and leads to effective specialisers. Moreover, using good binding-time annotations, the speed-ups of the specialised programs are comparable to the speed-ups obtained with online specialisers. The paper first develops a generic approach to offline partial deduction and then a specific offline partial deduction method, leading to the offline system LIX for pure logic programs. While this is a usable specialiser by itself, its specialisation strategy is used to develop the "cogen" system LOGEN. Given a program, a specification of what inputs will be static, and an annotation specifying which calls should be unfolded, LOGEN generates a specialised specialiser for the program at hand. Running this specialiser with particular values for the static inputs results in the specialised program. While this requires two steps instead of one, the efficiency of the specialisation process is improved in situations where the same program is specialised multiple times. The paper also presents and evaluates an automatic binding-time analysis that is able to derive the annotations. While the derived annotations are still suboptimal compared to hand-crafted ones, they enable non-expert users to use the LOGEN system in a fully automated way Finally, LOGEN is extended so as to directly support a large part of Prolog's declarative and non-declarative features and so as to be able to perform so called mixline specialisations. In mixline specialisation some unfolding decisions depend on the outcome of tests performed at specialisation time instead of being hardwired into the specialiser
    corecore