This paper presents the design of an Intelligent Tutoring System (ITS) MathEH, that is a coached problem solving system, also called "Electronic Homework". In describing the main modules of the system, we em...
详细信息
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a type-inference based program analysis which determ...
详细信息
ISBN:
(纸本)9780897917193
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a type-inference based program analysis which determines when values are accessed at most once. Our analysis can handle higher-order functions and data structures, and admits principal types of terms. Unlike previous analyses, we prove our analysis sound with respect to call-by-need reduction. Call-by-name reduction does not provide an accurate model of how often a value is used during lazy evaluation, since it duplicates work which would actually be shared in a real implementation. Our type system can easily be modified to analyse usage in a call-by-value language.
In this paper we consider a logical treatment for the ordered disjunction operator × introduced by Brewka, Niemelä and Syrjänen in their logic Programs with Ordered Disjunctions (LPOD). LPODs are used t...
详细信息
We show how recent developments in the study of negation as failure of logic programming can be used to define a general framework for Default Reasoning. Negation as failure can be viewed as a form of hypotheses with ...
详细信息
A new system for spam e-mail annotation by end-users is presented. It is based on the recursive application of hand- written annotation rules by means of an inferential engine based on logic programming. Annotation ru...
详细信息
We present the tool Kato which is, to the best of our knowledge, the first tool for plagiarism detection that is directly tailored for answer-set programming (ASP). Kato aims at finding similarities between (segments ...
详细信息
ISBN:
(纸本)9783869560267
We present the tool Kato which is, to the best of our knowledge, the first tool for plagiarism detection that is directly tailored for answer-set programming (ASP). Kato aims at finding similarities between (segments of) logic programs to help detecting cases of plagiarism. Currently, the tool is realised for DLV programs but it is designed to handle various logic-programming syntax versions. We review basic features and the underlying methodology of the tool.
We study the possibility of reducing some special cases of circumscription to logic programming. The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by ru...
详细信息
Linear logic provides a logical framework to express ftindamentEd computationcil concepts in a declcirative style. As a consequence, it has been used as a sound foundation for the design of expressive progreimming and...
详细信息
ISBN:
(纸本)3540664920
Linear logic provides a logical framework to express ftindamentEd computationcil concepts in a declcirative style. As a consequence, it has been used as a sound foundation for the design of expressive progreimming and specification languages. Unfortunately, linearity is as convenient for specifying as difficult to implement. In particular, the successful implementation of linear logic Ismguages Eind provers involving context splitting strongly depends on the efficiency of the method computing a suitable split. A number of solutions have been proposed, referred to as lazy splitting or resource management systems. In this paper, we present a new resource management system for the Lolli linear logic Icinguage. We show that the choice of the structure employed to represent the contexts has a strong influence on the overall performcince of the resource mzinagement system. We also estimate the performsmce of previous proposals, and compare them to our new system.
logic is a universal language of abstract concepts of two-valued world. Fuzzy logic is a cornerstone of abstraction of real (continuous) world. Granular Computing is aimed at the development, processing and exchanging...
详细信息
ISBN:
(纸本)0769522912
logic is a universal language of abstract concepts of two-valued world. Fuzzy logic is a cornerstone of abstraction of real (continuous) world. Granular Computing is aimed at the development, processing and exchanging information granules. Viewing such granules as abstractions of real world, their manipulation is ultimately governed by the mechanisms of logic, and fuzzy logic in particular. In this talk, we focus on a general platform of granular modeling - a paradigm that seamlessly combines the concepts of information granules with their logic processing cast in the operational framework of fuzzy sets. First, we outline the research agenda of granular modeling. Second, we elaborate on the architectural and algorithmic issues of granular models. The talk offers a systematic view at the development of information granules (realized as fuzzy sets and fuzzy relations) through descriptive, prescriptive, and hybrid approaches. Those approaches arise under the rubric of clustering and knowledge-based clustering. The processing core handling processing information granules involves a spectrum of logic constructs. Those include OR, AND, OR/AND fuzzy neurons. In conjunction to their basic logic characteristics articulated by means of "standard" logic operators (being realized via some t-and s-norms), we show how their underlying functionality could be augmented through more advanced constructs such as cardinal sums and uninorms. We discuss several categories of processing units aimed at referential processing supported by matching, inclusion, dominance, and difference fuzzy neurons. In the sequel, we present fundamental topologies of logic networks including logic processors, fuzzy multiplexers, and referential processing units. The issue of transparency-accuracy tradeoffs of granular models is presented along with various mechanisms of pruning logic networks and their underlying quantification aspects (articulated in the sense of the approximation error and being viewed vi
We survey three of Paris Kanellakis's contributions to the complexity-theoretic analysis of constructs in the design of programming languages. These are (1) his result that first-order unification is complete for ...
详细信息
暂无评论