the proceedings contain 20 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using constraints for intrusion detection: the NeMODe system;A declarative ...
ISBN:
(纸本)9783642183775
the proceedings contain 20 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using constraints for intrusion detection: the NeMODe system;A declarative API for particle Systems;integrating Xpath withthe functional-logic language toy;sloth – A tool for checking minimal-strictness;the F# asynchronous programming model;kanor: A declarative language for explicit communication;joinads: A retargetable control-flow construct for reactive, parallel and concurrent programming;results on out-of-order event processing;nettle: Taking the sting out of programming network routers;learning language from its perceptual context;Determining actual response time in P-FRP;detection of asynchronous message passing errors using static analysis;combinators for message-passing in haskell;analysing a publish/subscribe system for mobile ad hoc networks with problog;profiling for run-time checking of computational properties and performance debugging in logic programs;plato: A compiler for interactive web forms;on the portability of prolog applications;Explicitly recursive grammar combinators: A better model for shallow parser DSLs.
this paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic specifications are particular first-order formula...
详细信息
ISBN:
(纸本)9783642177958
this paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic specifications are particular first-order formulae with constrained algebraic structure, called patterns. Program configurations satisfy patterns if they match their algebraic structure and satisfy their constraints. Using a simple imperative language (IMP), it is shown that a restricted use of the matching logic proof system is equivalent to IMP's Hoare logic proof system, in that any proof derived using either can be turned into a proof using the other. Extensions to IMP including a heap with dynamic memory allocation and pointer arithmetic are given, requiring no extension of the underlying first-order logic;moreover, heap patterns such as lists, trees, queues, graphs, etc., are given algebraically using fist-order constraints over patterns.
We present a numerical refinement operator based on multi-instance learning. In the approach, the task of handling numerical variables in a clause is delegated to statistical multi-instance learning schemes. To each c...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
We present a numerical refinement operator based on multi-instance learning. In the approach, the task of handling numerical variables in a clause is delegated to statistical multi-instance learning schemes. To each clause, there is an associated multi-instance classification model withthe numerical variables of the clause as input. Clauses are built in a greedy manner, where each refinement adds new numerical variables which are used additionally to the numerical variables already known to the multi-instance model. In our experiments, we tested this approach with multi-instance learners available in the Weka workbench (like MI-SVMs). these clauses are used in a boosting approach that can take advantage of the margin information, going beyond standard covering procedures or the discrete boosting of rules, like in SLIPPER. the approach is evaluated on the problem of hexose binding site prediction, a pharmacological application and mutagenicity prediction. In two of the three applications, the task is to find configurations of points with certain properties in 3D space that characterize either a binding site or drug activity: the logical part of the clause constitutes the points withtheir properties, whereas the multi-instance model constrains the distances among the points. In summary, the new numerical refinement operator is interesting boththeoretically as a new synthesis of logical and statistical learning and practically as a new method for characterizing binding sites and pharmacophores in biochemical applications.
Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexib...
详细信息
ISBN:
(纸本)9781457708817
Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexible sub-wavelength and super-channel connection provisioning to support heterogeneous and immense bandwidth demands. In this paper, we focus on the problem of Routing, Modulation Level, and Spectrum Allocation/Assignment (RMLSA) which emerges in such networks. We both formulate RMLSA as an Integer Linear programming (ILP) problem and propose an effective heuristic method called Adaptive Frequency Assignment - Division and Collision Avoidance (AFA-DCA) to be used if the solution of ILP is not attainable.
the proceedings contain 56 papers. the special focus in this conference is on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. the topics include: An Improved Variable Precision Model of Dominance-Based Rou...
ISBN:
(纸本)9783642218804
the proceedings contain 56 papers. the special focus in this conference is on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. the topics include: An Improved Variable Precision Model of Dominance-Based Rough Set Approach;rough Numbers and Rough Regression;covering Numbers in Covering-Based Rough Sets;on Coverings of Rough Transformation Semigroups;covering Rough Set Model Based on Multi-granulations;a Descriptive Language Based on Granular Computing – Granular logic;optimization and Adaptation of Dynamic Models of Fuzzy Relational Cognitive Maps;sensitivity Analysis for Fuzzy Linear programming Problems;estimation of Parameters of the Empirically Reconstructed Fuzzy Model of Measurements;Towards Faster Estimation of Statistics and ODEs Under Interval, P-Box, and Fuzzy Uncertainty: From Interval Computations to Rough Set-Related Computations;dominance-Based Rough Set Approach for Possibilistic Information Systems;creating Fuzzy Concepts: the One-Sided threshold, Fuzzy Closure and Factor Analysis Methods;position Paper: Pragmatics in Fuzzy theory;regularization of Fuzzy Cognitive Maps for Hybrid Decision Support System;on Designing of Flexible Neuro-Fuzzy Systems for Nonlinear Modelling;time Series Processing and Forecasting Using Soft Computing Tools;fuzzy Linear programming – Foreign Exchange Market;fuzzy Optimal Solution of Fuzzy Transportation Problems with Transshipments;Fuzzy Optimal Solution of Fully Fuzzy Project Crashing Problems with New Representation of LR Flat Fuzzy Numbers;a Prototype System for Rule Generation in Lipski’s Incomplete Information Databases;rough Set Based Uncertain Knowledge Expressing and Processing;how to Reconstruct the System’s Dynamics by Differentiating Interval-Valued and Set-Valued Functions;symbolic Galois Lattices with Pattern Structures;accumulated Cost Based Test-Cost-Sensitive Attribute Reduction.
We are investigating the potential use of trial transcripts as sources of social knowledge for epistemic agents. But we are immediately faced withthe reality that not all transcripts are equal. the quality of the tra...
详细信息
Research on natural language interfaces has mainly concentrated on question interpretation as well as answer computation, but not focused as Much on answer presentation. In most natural language interfaces, answers ar...
详细信息
Research on natural language interfaces has mainly concentrated on question interpretation as well as answer computation, but not focused as Much on answer presentation. In most natural language interfaces, answers are in fact provided extensionally as a list of all those instances satisfying the query description. In this paper, we aim to go beyond such a mere listing of facts and move towards producing additional descriptions of the query results referred to as intensional answers. We define an intensional answer (IA) as a logical description of the actual set of answer items to a given query in terms of properties that are shared by exactly these answer items. We argue that IAs can enhance a user's understanding of the answer itself but also of the underlying knowledge base. In particular, we present an approach for computing an intensional answer given an extensional answer (i.e. a set of entities) returned as a result of a question. In our approach, an intensional answer is represented by a clause and computed based on inductivelogicprogramming (ILP) techniques, in particular bottom-up clause generalization. the approach is evaluated in terms of usefulness and time performance, and we discuss its potential for helping to detect flaws in the knowledge base as well as to interactively enrich it with new knowledge. While the approach is used in the context of a natural language question answering system in our settings, it clearly has applications beyond, e.g. in the context of research on generating referring expressions. (C) 2009 Elsevier B.V. All rights reserved.
this paper reviews experiments with an approach to discovery through robot's experimentation in its environment. In addition to discovering laws that enable predictions, we are particularly interested in the mecha...
详细信息
Probabilistic Computation Tree logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking. In this ...
详细信息
ISBN:
(纸本)9781605589558
Probabilistic Computation Tree logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking. In this paper, we consider PCTL for noncountable-space Markov chains, and we show that there is a substantial affinity between certain of its operators and problems of Dynamic programming. We prove some basic properties of the solutions to the latter. We also provide two examples and demonstrate how recovery strategies in practical applications, which are naturally stated as reach-avoid problems, can be viewed as particular cases of PCTL formulas.
Flow logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic proce...
详细信息
ISBN:
(纸本)9783642120312
Flow logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it;to deal with modal logics and prove that it can give an exact characterisation of the semantics of formulae in a modal logic. this shows that model checking can be performed by means of state-of-the-art approaches to static analysis and allow us to conclude that the problems of model checking and static analysis are reducible to each other. In terms of computational complexity we show that model checking by means of static analysis gives the same complexity bounds as are known for traditional approaches to model checking.
暂无评论