By incorporating the methods of Answer Set programming (ASP) and Markov logic Networks (MLN), LPMLN becomes a powerful tool for non-monotonic, inconsistent and uncertain knowledge representation and reasoning. To faci...
详细信息
The blocks world is a classic toy domain that has long been used to build and test spatial reasoning systems. Despite its relative simplicity, tackling this domain in its full complexity requires the agent to exhibit ...
详细信息
GlioBastoma Multiforme (GBM) is an aggressive primary brain tumor characterized by a heterogeneous cell population that is genetically unstable and resistant to chemotherapy. Indeed, despite advances in medicine, pati...
详细信息
ISBN:
(纸本)9783319984469;9783319984452
GlioBastoma Multiforme (GBM) is an aggressive primary brain tumor characterized by a heterogeneous cell population that is genetically unstable and resistant to chemotherapy. Indeed, despite advances in medicine, patients diagnosed with GBM have a median survival of just one year. Magnetic Resonance Imaging (MRI) is the most widely used imaging technique for determining the location and size of brain tumors. Indisputably, this technique plays a major role in the diagnosis, treatment planning, and prognosis of GBM. Therefore, this study proposes a new Case Based Reasoning approach to problem solving that attempts to predict a patient's GBM volume after five months of treatment based on features extracted from MR images and patient attributes such as age, gender, and type of treatment.
In this paper we attempt to analyze the concept of quantum probability within quantum computation and quantum computational logic. While the subjectivist interpretation of quantum probability explains it as a reliable...
详细信息
One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the correctness of these operations. A solut...
详细信息
ISBN:
(纸本)9783319733050;9783319733043
One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the correctness of these operations. A solution is adding run-time checks to the program via assertions, but this can introduce overheads that are in many cases impractical. While static analysis can greatly reduce such overheads, the gains depend strongly on the quality of the information inferred. Reusable libraries, i.e., library modules that are pre-compiled independently of the client, pose special challenges in this context. We propose a technique which takes advantage of module systems which can hide a selected set of functor symbols to significantly enrich the shape information that can be inferred for reusable libraries, as well as an improved run-time checking approach that leverages the proposed mechanisms to achieve large reductions in overhead, closer to those of static languages, even in the reusable-library context. While the approach is general and system-independent, we present it for concreteness in the context of the Ciao assertion language and combined static/dynamic checking framework. Our method maintains the full expressiveness of the assertion language in this context. In contrast to other approaches it does not introduce the need to switch the language to a (static) type system, which is known to change the semantics in languages like Prolog. We also study the approach experimentally and evaluate the overhead reduction achieved in the run-time checks.
Recursion-free Constrained Horn Clauses (CHCs) are logic-programming problems that can model safety properties of programs with bounded iteration and recursion. In addition, many CHC solvers reduce recursive systems t...
详细信息
Recursion-free Constrained Horn Clauses (CHCs) are logic-programming problems that can model safety properties of programs with bounded iteration and recursion. In addition, many CHC solvers reduce recursive systems to a series of recursion-free CHC systems that can each be solved efficiently. In this paper, we define a novel class of recursion-free systems, named Clause-Dependence Disjoint (CDD), that generalizes classes defined in previous work. The advantage of this class is that many CDD systems are smaller than systems which express the same constraints but are part of a different class. This advantage in size allows CDD systems to be solved more efficiently than their counterparts in other classes. We implemented a CHC solver named SHARA. SHARA solves arbitrary CHC systems by reducing the input to a series of CDD systems. Our evaluation indicates that SHARA outperforms state-of-the-art implementations in many practical cases.
We consider the problem of adding a new machine to an existing production line with minimum engineering effort and downtime (e.g. for plug-and-produce). The supervising system and the new machine have interfaces which...
详细信息
ISBN:
(纸本)9781538635933
We consider the problem of adding a new machine to an existing production line with minimum engineering effort and downtime (e.g. for plug-and-produce). The supervising system and the new machine have interfaces which are similar but not fully compatible with each other, so the interfaces and interaction logic between these systems must be modified and adapted to ensure functionality and exploit the full potential of the new machine. This adaptation is currently done by hand, where a number of parameters and synchronization steps need to be checked by the engineer. We present an approach for detecting incompatibilities between production machine interfaces automatically. To match the parameters requested by the supervising system with the capabilities provided by the machine, we employ an augmented unification method stemming from logic programming. To analyze the synchronization and termination properties of the interaction, we employ graph algorithms on the synchronous cross product of finite state automata. We developed a software prototype and used it to evaluate the approach with example models. Our approach has the potential to optimize the process of machine addition and replacement and minimize potential failure by applying a zero-engineering approach.
We consider dynamic programs modelled in a variant of the Algebraic Dynamic programming (ADP) framework which allows us to develop general purpose solvers for Dynamic programming problems. In such dynamic programs the...
详细信息
ISBN:
(纸本)9783319729268;9783319729251
We consider dynamic programs modelled in a variant of the Algebraic Dynamic programming (ADP) framework which allows us to develop general purpose solvers for Dynamic programming problems. In such dynamic programs the information accumulated in memoization tables is usually lost if the input data of the problem instance changes. We analyze those changes and how they affect the information stored for subproblems of a dynamic program. We then present the theory for a new algorithm for partial invalidation and incremental evaluation of ADPs based on a previous simpler algorithm. The new algorithm should reduce the amount of discarded information in Dynamic programming tables and to speed up the reevaluation of dynamic programs in the face of changing inputs. In future work we will integrate the algorithms into a framework currently under development to conduct thorough experiments on their practical efficieny.
*Abstraction is a well-known approach to reduce program complexity by over-approximating the problem with a deliberate loss of information. It has not been considered so far in the context of Answer Set programming, a...
详细信息
ISBN:
(纸本)9781577358039
*Abstraction is a well-known approach to reduce program complexity by over-approximating the problem with a deliberate loss of information. It has not been considered so far in the context of Answer Set programming, a convenient tool for problem solving. In this paper, we introduce a method to automatically abstract ground ASP programs that preserves their structure by reducing the vocabulary. Such an abstraction makes it possible to generate partial answer set candidates, which can help with the approximation of reasoning. Faithful (non-spurious) abstractions may be used to represent the projection of answer sets and to guide solvers in answer set construction. In order to deal with the unavoidably introduced spurious answer sets, we employ an ASP debugging approach to help with the refinement of the abstraction. We investigate the usage of such an abstraction to obtain explanations of unsatisfiable programs as a show case.
Threat evaluation is the process in which threat values of targets are calculated, based on the inferred capabilities and intents of the targets to give damage to defended assets. The capability and the intent are mea...
详细信息
Threat evaluation is the process in which threat values of targets are calculated, based on the inferred capabilities and intents of the targets to give damage to defended assets. The capability and the intent are measured by its capacity of giving damage and by its actions, respectively. While having warhead and its estimated power show a damage capability measure, being aimed a defended unit is a measure of hostile action. Target evaluation is proceeded in real time in a wargame and the aim is to compare weapon target pairs according to a set of criteria. The target evaluation cycle is repeated anytime a new detection received and when any change is happened in the target currently detected. In this paper, an agent based command and control entity, which is in charge of target evaluation and giving engagement decision, is designed and it is situated in an air defense simulation environment.
暂无评论