We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability probl...
详细信息
ISBN:
(纸本)3540412859
We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability problems. Such problems can then be decided, via a reification transformation, using a highly optimised reasoner for the SHIQ description logic. We use a simple example to support our hypothesis that this procedure will work well with realistic problems.
the Belief-Desire-Intention (BDI) model is well suited for describing an agent's mental state. To model human reasoning with uncertainty and imprecision, fuzzy logic have been employed to represent beliefs for BDI...
详细信息
ISBN:
(纸本)9781479986460
the Belief-Desire-Intention (BDI) model is well suited for describing an agent's mental state. To model human reasoning with uncertainty and imprecision, fuzzy logic have been employed to represent beliefs for BDI agents in our previous work. In order that the BDI agents are more and more suitable for modelling our real world, a BDI agent programming language with fuzzied-belief based on a existing BDI agent programming language is developed in this paper. the new language is more flexible and human-like compared to non-fuzzy based BDI agent language in the real world applications. Particularly, it provides a more reasonable planning selection mechanism. the reasoning capability of the previous BDI language is improved due to the work in this paper.
the Nurse Scheduling problem (NSP) is a combinatorial problem that consists of assigning nurses to shifts according to given practical constraints. In previous years, several approaches have been proposed to solve dif...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
the Nurse Scheduling problem (NSP) is a combinatorial problem that consists of assigning nurses to shifts according to given practical constraints. In previous years, several approaches have been proposed to solve different variants of the NSP. In this paper, an ASP encoding for one of these variants is presented, whose requirements have been provided by an Italian hospital. We also design a second encoding for the computation of "optimal" schedules. Finally, an experimental analysis has been conducted on real data provided by the Italian hospital using both encodings. Results are very positive: the state-of-the-art ASP system CLINGO is able to compute one year schedules in few minutes, and it scales well even when more than one hundred nurses are considered.
We present a proof theory and a proof procedure for nonmonotonicreasoning based on the acceptability semantics for logicprogramming, formulated in an argumentation framework. these proof theory and procedure are def...
详细信息
Formal models developed in the field of argumentation allow for analysing and evaluating problems that have previously been studied by philosophers on an informal level only. Importantly, they also give rise to the de...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Formal models developed in the field of argumentation allow for analysing and evaluating problems that have previously been studied by philosophers on an informal level only. Importantly, they also give rise to the development of computational tools for argumentation. In this paper we report on ArgueApply, a mobile app for argumentation that is based on the Grappa framework, an extension of, e.g., abstract argumentation in the sense of Dung. With ArgueApply users can engage in online discussions and evaluate their semantics. Each of the resulting interpretations can be seen as a coherent view on a discussion in which some of the discussions statements are accepted and others rejected. Being a mobile tool, ArgueApply is intended to be more accessible than existing systems for computing argumentation semantics allowing, e.g., for spontaneous analysis of an ongoing discussion or collective preparation for an important debate. While having a practical system for these applications is the final goal of our work, an immediate objective is using the system for exploring which type of Grappa frameworks under which semantics are best suited for such applications.
In answer set programming, programs often contain auxiliary atoms, "defined" in terms of atoms introduced earlier. To prove that the answer sets of a program containing definitions correspond to the solution...
详细信息
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. the availability of different semantics naturally raises the question of which are most adequate to mo...
详细信息
We propose an approach for reasoning about actions with domain descriptions including an EL perpendicular to ontology in a temporal action theory. the action theory is based on a Dynamic Linear Time Temporal logic, wh...
详细信息
ISBN:
(纸本)9783031157073;9783031157066
We propose an approach for reasoning about actions with domain descriptions including an EL perpendicular to ontology in a temporal action theory. the action theory is based on a Dynamic Linear Time Temporal logic, whose extensions are defined through temporal answer sets. the work provides conditions under which action consistency can be guaranteed with respect to an EL perpendicular to ontology, by polynomially encoding an EL perpendicular to knowledge base into a domain description of the temporal action theory.
In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported...
详细信息
ISBN:
(纸本)9783642042379
In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but Slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P-1 as input to another program P-2 in order to provide the desired Solutions to the problem to be solved. In practice, the evaluation of the program P-1 Currently has to be decopuled from the evaluation of P-2 using an intermediate step which collects the desired consequences of P-1 and provides them as input to P-2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies oil rewriting P-1 into a so-called manifold program. which allows for accessing all desired consequences of P-1 within a single answer set. then, this manifold program can be evaluated jointly with P-2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As an application, we present all encoding for computing the ideal extension of,in abstract argumentation framework.
暂无评论