Knowledge discovery techniques had important impact in several relevant application domains. Among the most important knowledge discovery tasks is outlier detection. Outlier detection is the task of identifying anomal...
详细信息
Scheduling is needed in a multitude of smart city domains, such as public transportation, logistics, organization of events and parts delivery in assembly lines. In this paper, we present the architecture and implemen...
详细信息
ISBN:
(纸本)9781509064656
Scheduling is needed in a multitude of smart city domains, such as public transportation, logistics, organization of events and parts delivery in assembly lines. In this paper, we present the architecture and implementation of PickUp Planner, a service that enables scheduling and dynamic routing of connected vehicles for picking up number of users distributed in the city. The service dynamically reconfigures the routes of the vehicles based on real-time traffic condition information, which in turn is gathered from the road infrastructure and other connected vehicles registered to the service. The crux of the service is the usage of a novel vehicle routing and scheduling algorithm that combines clustering algorithms and answer set programming. Our evaluation shows that the algorithm decreases the total distance traveled by the vehicles, and therefore reduces fuel consumption and emissions from the vehicles. We also conclude that answer set programming solvers may not be the best choice for scenarios in which there is a high number of users to be served frequently.
The paper deals with base revision for answer set programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision str...
详细信息
ISBN:
(纸本)9783319675824;9783319675817
The paper deals with base revision for answer set programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answersets. This characterization allows one to equivalently consider the evolution of syntactic logic programs and the evolution of their semantic content.
This paper develops automated testing and debugging techniques for answerset solver development. We describe a flexible grammar-based black-box ASP fuzz testing tool which is able to reveal various defects such as un...
详细信息
This paper develops automated testing and debugging techniques for answerset solver development. We describe a flexible grammar-based black-box ASP fuzz testing tool which is able to reveal various defects such as unsound and incomplete behavior, i.e. invalid answersets and inability to find existing solutions, in state-of-the-art answerset solver implementations. Moreover, we develop delta debugging techniques for shrinking failure-inducing inputs on which solvers exhibit defective behavior. In particular, we develop a delta debugging algorithm in the context of answerset solving, and evaluate two different elimination strategies for the algorithm.
This work presents an innovative quantitative approach, based on an optimization model, to manage outpatient Day Service operations. The main objective of the research work is to maximize admitted patient flow in orde...
详细信息
ISBN:
(纸本)9783319661469;9783319661452
This work presents an innovative quantitative approach, based on an optimization model, to manage outpatient Day Service operations. The main objective of the research work is to maximize admitted patient flow in order to use available resources efficiently. The model is designed with the help of answer set programming and implemented in Datalog with Disjunction (DLV) system. As significant case study, we consider the Rheumatology domain. Preliminary results are presented.
In recent years there has been a growing interest in solutions for the delivery of clinical care for the elderly because of the large increase in aging population. Monitoring a patient in his home environment is neces...
详细信息
In recent years there has been a growing interest in solutions for the delivery of clinical care for the elderly because of the large increase in aging population. Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but, to be useful, this activity must not be too invasive for patients and a burden for caregivers. We prototyped a system called Secure and IN Dependent lIving (SINDI), focused on (a) collecting a limited amount of data about the person and the environment through Wireless Sensor Networks (WSN), and (b) inferring from these data enough information to support caregivers in understanding patients' well-being and in predicting possible evolutions of their health. Our hierarchical logic-based model of health combines data from different sources, sensor data, tests results, common-sense knowledge and patient's clinical profile at the lower level, and correlation rules between health conditions across upper levels. The logical formalization and the reasoning process are based on answer set programming. The expressive power of this logic programming paradigm makes it possible to reason about health evolution even when the available information is incomplete and potentially incoherent, while declarativity simplifies rules specification by caregivers and allows automatic encoding of knowledge. This paper describes how these issues have been targeted in the application scenario of the SINDI system.
Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata ...
详细信息
Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in an action language which in turn is defined as a high-level notation for answer set programming modulo theories-an extension of answerset programs to the firstorder level similar to the way satisfiability modulo theories (SMT) extends propositional satisfiability (SAT). We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories. A further translation into SMT allows for computing them using SMT solvers that support arithmetic over reals. Next, we extend the representation to the general class of non-linear hybrid automata allowing even non-convex invariants. We represent them by an action language modulo ordinary differential equations, which can be compiled into satisfiability modulo ordinary differential equations. We present a prototype system CPLUS2ASPMT based on these translations, which allows for a succinct representation of hybrid transition systems that can be computed effectively by the state-of-the-art SMT solver dReal.
There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distribute...
详细信息
There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions;(ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages;and (iii) analysed using existing results on connecting causal theories and answer set programming. Results on the application of our approach to different classes of network protocols are also presented.
The traditional ground-and-solve approach to answer set programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that int...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
The traditional ground-and-solve approach to answer set programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that interleaves grounding with solving and thus uses space more efficiently. The limited view on the search space in lazy grounding poses unique challenges, however, and can have adverse effects on solving performance. In this paper we present a novel characterization of degrees of laziness in grounding for ASP, i.e. of compromises between lazily grounding as little as possible and the traditional full grounding upfront. We investigate how these degrees of laziness compare to each other formally as well as, by means of an experimental analysis using a number of benchmarks, in terms of their effects on solving performance. Our contributions are the introduction of a range of novel lazy grounding strategies, a formal account on their relationships and their correctness, and an investigation of their effects on solving performance. Experiments show that our approach performs significantly better than state-of-the-art lazy grounding in many cases.
Inspired by the recent problems in supply chains, we propose an approach to declarative modeling of contracts between agents that will eventually support reasoning about resilience of and about ways to improve supply ...
详细信息
ISBN:
(纸本)9783031248405;9783031248412
Inspired by the recent problems in supply chains, we propose an approach to declarative modeling of contracts between agents that will eventually support reasoning about resilience of and about ways to improve supply chains. Specifically, we present a high-level language for specifying and reasoning about contracts over action domains of agents. We assume that the behavior of the agents can be formally expressed through action theories and view a contract as a collection of constraints. Each constraint specifies the responsibility of an agent to achieve a certain result by a deadline. Each agent also has a mapping between constraints and the agent's concerns, i.e. issues that the agent is concerned about, which are modeled in accordance with the CPS Framework proposed by the National Institute of Standards and Technology. We discuss how common questions related to the fulfillment of a contract or the concerns of the agents can be answered and computed via answer set programming.
暂无评论