The paper presents a knowledge representation language Alog which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some propert...
详细信息
The paper presents a knowledge representation language Alog which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some properties of Alog, an algorithm for computing its answersets, and comparison with other approaches.
In this paper, we revisit the problem of entity resolution and propose a novel, logical framework, LACE, which mixes declarative and procedural elements to achieve a number of desirable properties. Our approach is fun...
详细信息
ISBN:
(纸本)9781450392600
In this paper, we revisit the problem of entity resolution and propose a novel, logical framework, LACE, which mixes declarative and procedural elements to achieve a number of desirable properties. Our approach is fundamentally declarative in nature: it utilizes hard and soft rules to specify conditions under which pairs of entity references must or may be merged, together with denial constraints that enforce consistency of the resulting instance. Importantly, however, rule bodies are evaluated on the instance resulting from applying the already `derived' merges. It is the dynamic nature of our semantics that enables us to capture collective entity resolution scenarios, where merges can trigger further merges, while at the same time ensuring that every merge can be justified. As the denial constraints restrict which merges can be performed together, we obtain a space of (maximal) solutions, from which we can naturally define notions of certain and possible merges and query answers. We explore the computational properties of our framework and determine the precise computational complexity of the relevant decision problems. Furthermore, as a first step towards implementing our approach, we demonstrate how we can encode the various reasoning tasks using answer set programming.
Sequential pattern mining algorithms are widely used to explore care pathways database, but they generate a deluge of patterns, mostly redundant or useless. Clinicians need tools to express complex mining queries in o...
详细信息
ISBN:
(纸本)9783319597584;9783319597577
Sequential pattern mining algorithms are widely used to explore care pathways database, but they generate a deluge of patterns, mostly redundant or useless. Clinicians need tools to express complex mining queries in order to generate less but more significant patterns. These algorithms are not versatile enough to answer complex clinician queries. This article proposes to apply a declarative pattern mining approach based on answer set programming paradigm. It is exemplified by a pharmaco-epidemiological study investigating the possible association between hospitalization for seizure and antiepileptic drug switch from a french medico-administrative database.
Based on Belief-Desire-Intention(BDI) architecture,the Agent built in answer set programming (ASP) is applied to a security ***, the task planning is described in BDI models for different autonomous agents,which corre...
详细信息
ISBN:
(纸本)9781728107387
Based on Belief-Desire-Intention(BDI) architecture,the Agent built in answer set programming (ASP) is applied to a security ***, the task planning is described in BDI models for different autonomous agents,which corresponding structure and cooperation mechanism are explained in detail;Secondly, the symbol language L-p including predicate set is created for the security task , which defines the unified abstract symbols for representation, interaction and state *** paper describes the system as a dynamic application program in ASP to solve multi-agents problem. in additional, the method to solve the conflict of beliefs in multi-agent collaboration process is given with a technical framework called Equibel, which shares beliefs among agents and the renewal of their own beliefs. Finally, the theoretical method is simulated and validated with the security application background .The simulation results prove the effectiveness of Agent method, which can upgrade the traditional security system conveniently.
In this paper we discuss how we can augment an existing controlled natural language in a systematic way with temporal expressions in order to write high-level temporal specifications which require reasoning about acti...
详细信息
ISBN:
(纸本)9783030299088;9783030299071
In this paper we discuss how we can augment an existing controlled natural language in a systematic way with temporal expressions in order to write high-level temporal specifications which require reasoning about action and change. We show that domain-dependent axioms which are necessary to specify time-varying properties, deal with the commonsense law of inertia, and with continuous change can be expressed directly and in a transparent way on the level of the controlled natural language. The resulting temporal specification including the corresponding axioms and the required terminological knowledge can be translated automatically into an executable answerset program and then be used by a linguistically motivated version of the Event Calculus, implemented as an answerset program, for temporal reasoning and question answering.
The problem of scheduling Pre-Operative Assessment Clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, du...
详细信息
ISBN:
(纸本)9783031084218;9783031084201
The problem of scheduling Pre-Operative Assessment Clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates, and operators availability. Realizing a satisfying schedule is of upmost importance for a clinic, since delay in PAC can cause delay in the subsequent phases, causing a decrease in patients' satisfaction. In this paper, we divide the problem in two sub-problems: In the first sub-problem patients are assigned to a day taking into account a default list of exams;then, in the second sub-problem, having the actual list of exams needed by each patient, we use the results of the first sub-problem to assign a starting time to each exam. We first present a mathematical formulation for both problems. Then, we present solutions based on answer set programming (ASP): The first solution is a genuine ASP encoding of the sub-problems, while the second introduces domain-specific optimizations. Experiments show that both solutions provide satisfying results in short time, while the second is able to prove optimality faster.
The challenge for public health officials is to detect an emerging foodborne disease outbreak from a large set of simple and isolated, domain-specific events. These events can be extracted from a large number of disti...
详细信息
ISBN:
(纸本)9783642225451;9783642225468
The challenge for public health officials is to detect an emerging foodborne disease outbreak from a large set of simple and isolated, domain-specific events. These events can be extracted from a large number of distinct information systems such as surveillance and laboratory reporting systems from health care providers, real-time complaint hotlines from consumers, and inspection reporting systems from regulatory agencies. In this paper we formalize a foodbome disease outbreak as a complex event and apply an event-driven rule-based engine to the problem of detecting emerging events. We define an evidence set as a set of simple events that are linked symptomatically, spatially and temporally. A weighted metric is used to compute the strength of the evidence set as a basis for response by public health officials.
answer set programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs. Existing approaches towards integrating function terms into ASP can be organized in two classes: uninterprete...
详细信息
ISBN:
(纸本)9783319516769;9783319516752
answer set programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs. Existing approaches towards integrating function terms into ASP can be organized in two classes: uninterpreted function symbols and interpreted functions;we focus on the latter. Existing approaches usually define interpreted functions in the program (e.g. using term equations), while evaluation wrt. to a pre-existing external semantics is neglected. However, this is useful if existing function libraries shall be accessed or if a function is more naturally implemented in procedural code. In this paper, we propose the declarative language of hex ifu - programs which extends answerset programs (ASP) with such interpreted functions. However, rather than just providing a means for evaluating functions, it further turns interpreted functions into first-class citizens, i.e., functions are represented by accessible objects in the program. This paves the way for functionals (higher-order functions), i.e., functions that take other functions as arguments or return them. We provide then a rewriting of such programs to hex-programs, an extension of ASP with external sources, and an implementation based on this rewriting. Afterwards we present applications which motivated our work, e.g. the adoption of design pattern from software engineering. Finally, we discuss properties of the formalism and differences to related work.
This paper proposes multi-model optimization through SAT witness or answerset sampling, with common probabilistic reasoning tasks as primary use cases (including deduction-style probabilistic inference and hypothesis...
详细信息
ISBN:
(数字)9783319999609
ISBN:
(纸本)9783319999609;9783319999593
This paper proposes multi-model optimization through SAT witness or answerset sampling, with common probabilistic reasoning tasks as primary use cases (including deduction-style probabilistic inference and hypothesis weight learning). Our approach enhances a state-of-the-art SAT/ASP solving algorithm with Gradient Descent as branching literal decision approach, and optionally a cost backtracking mechanism. Sampling of models using these methods minimizes a task-specific, user-provided multi-model cost function while adhering to given logical background knowledge (either a Boolean formula in CNF or a normal logic program under stable model semantics). Features of the framework include its relative simplicity and high degree of expressiveness, since arbitrary differentiable cost functions and background knowledge can be provided.
Incomplete argumentation frameworks (IAFs) are abstract argumentation frameworks that encode qualitative uncertainty by distinguishing between certain and uncertain arguments and attacks. In a completion of an IAF, ea...
详细信息
暂无评论