For the automated deployment of applications, technologies exist which can process topology-based deployment models that describes the application's structure with its components and their relations. The topology-...
详细信息
For the automated deployment of applications, technologies exist which can process topology-based deployment models that describes the application's structure with its components and their relations. The topology-based deployment model of an application can be adapted for the deployment in different environments. However, the structural changes can lead to problems, which had not existed before and prevent a functional deployment. This includes security issues, communication restrictions, or incompatibilities. For example, a formerly over the internal network established insecure connection leads to security problems when using the public network after the adaptation. In order to solve problems in adapted deployment models, first the problems have to be detected. Unfortunately, detecting such problems is a highly non-trivial challenge that requires deep expertise about the involved technologies and the environment. In this paper, we present (1) an approach for detecting problems in deployment models using architecture and design patterns and (2) the automation of the detection process by formalizing the problem a pattern solves in a certain context. We validate the practical feasibility of our approach by a prototypical implementation for the automated problem detection in TOSCA topologies.
Although OWL 2 is widely used to describe complex objects such as chemical molecules, it cannot represent 'structural' features of chemical entities (e.g., having a ring). A combination of rules and descriptio...
详细信息
We are proud to introduce this special issue of LIPIcs - Leibniz International Proceedings in Informatics, dedicated to the technical communications accepted for the 28th International Conference on logic programming ...
详细信息
We present a high-level declarative programming language for representing argumentation schemes, where schemes represented in this language can be easily validated by domain experts, including developers of argumentat...
详细信息
We present a high-level declarative programming language for representing argumentation schemes, where schemes represented in this language can be easily validated by domain experts, including developers of argumentation schemes in informal logic and philosophy, and serve as executable specifications for automatically constructing arguments, when applied to a set of assumptions. Since argumentation schemes are defeasible inference rules, both premises and conclusions of schemes can be second-order schema variables, i.e. without a fixed predicate symbol. Thus, while particular schemes can be and have been implemented in computer programs, in general argumentation schemes cannot be represented as executable specifications using logic programming languages based on first-order logic, such as Prolog. Moreover, even if the conclusion (head) of Prolog rules could be second-order variables, a depth-first, backward-chaining search strategy, as typically used in logic programming, would usually cause such programs to not terminate, since every goal would match the head of such a scheme, including all goals created by instantiating the body of the same scheme. The language for representing argumentation schemes presented here, for the purpose of automatically constructing arguments, uses Constraint Handling Rules (CHR), a declarative, Turing complete, forwards-chaining, rule-based programming language introduced by Thom Fruhwirth in 1991. CHR is attractive for representing and implementing argumentation for several reasons, including: 1) Inference rules, rewrite rules, sequents, proof rules, and logical axioms can be directly written in CHR. 2) The execution of CHR rules can be interrupted and restarted at any time, with intermediate results approximating the final solution, and 3) Constraints can be input incrementally as they become known, during rule execution, without requiring recomputation. These three properties of CHR appear attractive for representing and implementin
State-of-the-art ASP systems are 2-phased: first they ground the input program and then they solve the variable-free ground program. This may increase the size of the input program even exponentially, making ASP infea...
详细信息
State-of-the-art ASP systems are 2-phased: first they ground the input program and then they solve the variable-free ground program. This may increase the size of the input program even exponentially, making ASP infeasible for many practical applications. Lazy grounding, as in the recent Alpha ASP system, interleaves grounding and solving to avoid this so-called grounding bottleneck. Alpha demonstrates, for the first time in lazy grounding, efficient solving capabilities also for larger problems. The DynaCon research project addresses issues of dynamic reconfiguration in cyber-physical systems, a novel emerging application domain of ASP. Alpha is a promising start for such large-scale systems that need continuous reconfiguration to adapt to a changing environment.
This paper describes how the logic programming System XSB combines top-down and bottomup computation through the mechanisms of variant tabling and subsumptive tabling with abstraction, respectively. It is well known t...
详细信息
This paper describes how the logic programming System XSB combines top-down and bottomup computation through the mechanisms of variant tabling and subsumptive tabling with abstraction, respectively. It is well known that top-down evaluation of logical rules in Prolog has a procedural interpretation as recursive procedure invocation (Kowalski 1986). Tabling adds the intuition of short-circuiting redundant computations (Warren 1992). This paper shows how to introduce into tabled logic program evaluation a bottom-up component, whose procedural intuition is the initialization of a data structure, in which a relation is initially computed and filled, on first demand, and then used throughout the remainder of a larger computation for efficient lookup. This allows many Prolog programs to be expressed fully declaratively, programs which formerly required procedural features, such as assert, to be made efficient.
logic programming is a declarative programming paradigm. programming language Prolog makes logic programming possible, at least to a substantial extent. However the Prolog debugger works solely in terms of the operati...
详细信息
We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC)—a system of higher-order logic modulo theories—and prove its soundness and refutational completeness w.r.t. both standard...
详细信息
A common feature in Answer Set programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front ...
详细信息
暂无评论