Advances in the Internet of things and the Web of Data created huge opportunities for developing applications that can generate actionable knowledge out of streaming data. the trade-off between scalability and express...
详细信息
ISBN:
(数字)9783319220024
ISBN:
(纸本)9783319220024;9783319220017
Advances in the Internet of things and the Web of Data created huge opportunities for developing applications that can generate actionable knowledge out of streaming data. the trade-off between scalability and expressivity is a key challenge in this setting, and more investigation is required to identify what are the relevant features in optimizing this trade-off, and what role do they have in the optimization. In this paper we motivate the need for heuristics to design adaptive solutions and, following an empirical approach, we highlight some key concepts and ideas that can guide the design of heuristics for adaptive optimization of Web Stream reasoning.
Performance analysis and tuning are well established software engineering processes in the realm of imperative programming. this work is a step towards establishing the standards of performance analysis in the realm o...
详细信息
Most of contemporary software systems are implemented using an object-oriented approach. Modeling phases – during which software engineers analyze requirements to the future system using some modeling language – are...
详细信息
In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. the selection of package tours is done according to several pre...
详细信息
ISBN:
(数字)9783319220024
ISBN:
(纸本)9783319220024;9783319220017
In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. the selection of package tours is done according to several preference criteria aimed at maximizing the expected earnings given a budget. In this paper we formalize an allotment problem that abstracts the requirements of a real travel agent, and we solve it using Answer Set programming. the obtained specification is executable, and it implements an advanced feature of the iTravel+ system.
Probabilistic coupling is a powerful tool for analyzing pairs of probabilistic processes. Roughly, coupling two processes requires finding an appropriate witness process that models both processes in the same probabil...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
Probabilistic coupling is a powerful tool for analyzing pairs of probabilistic processes. Roughly, coupling two processes requires finding an appropriate witness process that models both processes in the same probability space. Couplings are powerful tools proving properties about the relation between two processes, include reasoning about convergence of distributions and stochastic dominance-a probabilistic version of a monotonicity property. While the mathematical definition of coupling looks rather complex and cumbersome to manipulate, we show that the relational program logic pRHL-the logic underlying the EasyCrypt cryptographic proof assistant-already internalizes a generalization of probabilistic coupling. Withthis insight, constructing couplings is no harder than constructing logical proofs. We demonstrate how to express and verify classic examples of couplings in pRHL, and we mechanically verify several couplings in EasyCrypt.
In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we pre...
详细信息
ISBN:
(纸本)9781467375092
In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we present an approach that addresses this problem by applying an argumentation-based scene interpretation framework for accurately modelling and representing the observations and beliefs of an agent. Our approach is based on temporal and probabilistic defeasible logicprogramming for reasoning. the performance of our approach is evaluated on simulation experiments in the Stage Robot Simulator. We also show that our approach is applicable to real world scenarios with an autonomous Pioneer 3-AT robot.
Knowledge representation and reasoning capacities are vital to cognitive robotics because they provide higher level functionalities for reasoning about actions, environments, goals, perception, etc. Although Answer Se...
详细信息
the role of data and knowledge exchange is becoming increasingly important. the approach of DACMAS [1] proposes a quite general modeling of Multi-Agent Systems (MAS), including data representation in a MAS via DRL-Lit...
详细信息
Intuitionistic Public Announcement logic (IntPAL) proposed by Ma et al. (2014) aims at formalizing changes of an agent's knowledge in a constructive manner. IntPAL can be regarded as an intuitionistic generalizati...
详细信息
ISBN:
(数字)9783662488997
ISBN:
(纸本)9783662488997;9783662488980
Intuitionistic Public Announcement logic (IntPAL) proposed by Ma et al. (2014) aims at formalizing changes of an agent's knowledge in a constructive manner. IntPAL can be regarded as an intuitionistic generalization of Public Announcement logic (PAL) whose modal basis is the intuitionistic modal logic IK by Fischer Servi (1984) and Simpson (1994). We also refer to IK for the basis of this paper. Meanwhile, Nomura et al. (2015) provided a cut-free labelled sequent calculus based on the study of Maffezioli et al. (2010). In this paper, we introduce a labelled sequent calculus for IntPAL (we call it GIntPAL) as both an intuitionistic variant of GPAL and a public announcement extension of Simpson's labelled calculus, and show that all theorems of the Hilbert axiomatization of IntPAL are also derivable in GIntPAL withthe cut rule. then we prove the admissibility of the cut rule in GIntPAL and also the soundness result for birelational Kripke semantics. Finally, we derive the semantic completeness of GIntPAL as a corollary of these theorems.
logic programs with graded modality (LPGMs) combine ideas underlying graded modal logic and answer set programming. logicprogramming under answer set semantics is extended with a new graded modality M[lb:ub] where lb...
详细信息
暂无评论