We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model ...
详细信息
ISBN:
(纸本)9783642548307;9783642548291
We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model systems with branching as coalgebras whose type arises as the composition of a branching monad and a polynomial endofunctor on the category of sets, and employ a set of truth values induced canonically by the branching monad. this yields logics for reasoning about quantitative aspects of linear-time behaviour. Examples include reasoning about the probability of a linear-time behaviour being exhibited by a system with probabilistic branching, or about the minimal cost of a linear-time behaviour being exhibited by a system with weighted branching. In the case of non-deterministic branching, our logic supports reasoning about the possibility of exhibiting a given linear-time behaviour, and therefore resembles an existential version of the logic LTL.
Subsequently, we introduce a novel semantics for the bimodal logic of subset spaces, denoted by LSS. this system was originally invented by Moss and Parikh for the purpose of clarifying the intrinsic relationship betw...
详细信息
ISBN:
(纸本)9783319120966;9783319120959
Subsequently, we introduce a novel semantics for the bimodal logic of subset spaces, denoted by LSS. this system was originally invented by Moss and Parikh for the purpose of clarifying the intrinsic relationship between the epistemic notion of knowledge and the geometric concept of topology. Focussing on the knowledge-theoretic side in this paper, we re-adjust LSS to multi-agent scenarios. As a result, a particular dynamic logic of implicit knowledge is obtained. this finds expression in the technical outcome of the paper, which covers soundness, completeness, decidability, and complexity issues regarding the arising system.
this paper presents two applications of the ASP-Prolog system, one of the earliest modular logicprogramming frameworks for integrating ASP and traditional Prolog/CLP reasoning. Both applications represent significant...
详细信息
Task Scheduling is an important problem having many practical applications. More often than not, precedence constraints exist between tasks, and a common way to capture them is through Directed Acyclic Graphs (DAGs). ...
详细信息
Incremental method engineering proposes to evolve the information systems development methods of a software company through a step-wise improvement process. In practice, this approach proved to be effective for reduci...
详细信息
ISBN:
(纸本)9783319078816;9783319078809
Incremental method engineering proposes to evolve the information systems development methods of a software company through a step-wise improvement process. In practice, this approach proved to be effective for reducing the risks of failure while introducing method changes. However, little attention has been paid to the important problem of identifying an adequate plan for implementing the changes in the company's context. To overcome this deficiency, we propose an approach that assists analysts by suggesting-via automatedreasoning-optimal and quasi-optimal plans for implementing method changes. After formalizing the Process-Deliverable Diagrams language for describing the method changes to implement, we present a planning framework for generating plans that comply with different types of constraints. We also describe an implementation of the modeling and planning components of our approach.
Optimization problems in Answer Set programming (ASP) are usually modeled by means of programs with weak constraints. these programs can be handled by algorithms for solving Maximum Satisfiability (MaxSAT) problems, i...
详细信息
A strong intuition for AGM belief change operations, Gardenfors suggests, is that formulas that are independent of a change should remain intact. Based on this intuition, Farias and Herzig axiomatize a dependence rela...
A strong intuition for AGM belief change operations, Gardenfors suggests, is that formulas that are independent of a change should remain intact. Based on this intuition, Farias and Herzig axiomatize a dependence relation w.r.t. a belief set, and formalize the connection between dependence and belief change. In this paper, we introduce base dependence as a relation between formulas w.r.t. a belief base. After an axiomatization of base dependence, we formalize the connection between base dependence and a particular belief base change operation, saturated kernel contraction. Moreover, we prove that base dependence is a reversible generalization of Farias and Herzig's dependence. that is, in the special case when the underlying belief base is deductively closed (i.e., it is a belief set), base dependence reduces to dependence. Finally, an intriguing feature of Farias and Herzig's formalism is that it meets other criteria for dependence, namely, Keynes' conjunction criterion for dependence (CCD) and Gardenfors' conjunction criterion for independence (CCI). We show that our base dependence formalism also meets these criteria. More interestingly, we offer a more specific criterion that implies both CCD and CCI, and show our base dependence formalism also meets this new criterion.
Problems from the area of graph theory always served as fruitful benchmarks in order to explore the performance of Answer Set programming (ASP) systems. A relatively new branch in graph theory is concerned with so-cal...
详细信息
Attribute-Based Access Control (ABAC) maps of characteristics of users, objects and the environment to authorisations. ABAC is a highly versatile access control model well suited to domains such as web services. With ...
详细信息
ISBN:
(纸本)9781450330336
Attribute-Based Access Control (ABAC) maps of characteristics of users, objects and the environment to authorisations. ABAC is a highly versatile access control model well suited to domains such as web services. Withthe recent set of draft ABAC guidelines by NIST there is a clear desire to promote further adoption of the model. Despite this ABAC continues to face challenges relating to policy evaluation. In this paper we present a novel framework for ABAC policy evaluation based on negotiations and formalised in Answer Set programming. Categories and Subject Descriptors: C.2.0 [Computer-Communication Networks]: General - Security and Protection. D.4.6 [Operating Systems]: Security and protection - Access controls. I.2.3 [Artificial Intelligence]: Deduction and theorem Proving - logicprogramming. General Terms: Security. Copyright 2014 ACM 978-1-4503-3033-6/14/09...$15.00.
CP2K is a widely used application for atomistic simulation that can execute on a range of architectures. Consisting of more than one million lines of Fortran 95 code, the application is tested for correctness with a s...
详细信息
ISBN:
(纸本)9780769551852
CP2K is a widely used application for atomistic simulation that can execute on a range of architectures. Consisting of more than one million lines of Fortran 95 code, the application is tested for correctness with a set of about 2,500 inputs using a dedicated regression testing environment. CP2K can be built with many compilers and executed on different serial and parallel platforms, thus making comprehensive testing even more challenging. this paper presents an effort to improve the existing testing process of CP2K in order to better support its continuing development. Enhancements have been made to the regression testing environment to support multi-platform testing and a new automated multi-platform testing system has been developed to check the code on a regular basis. Also, tools have been used to gain code coverage information for different test configurations. All the information is aggregated and displayed on the dedicated web page.
暂无评论