In this paper we present a technique based on logicprogramming for data cleaning, and its application to a real use case from the Italian Healthcare System. the use case is part of a more complex project developing a...
详细信息
ISBN:
(纸本)9783642405648
In this paper we present a technique based on logicprogramming for data cleaning, and its application to a real use case from the Italian Healthcare System. the use case is part of a more complex project developing a business intelligence suite for the analysis of distributed archives of tumor-based diseases.
In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes cont...
详细信息
In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. the construction of the concept-aware multipreference semantics is related to Brewka's framework for qualitative preferences. We exploit Answer Set programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic EL perpendicular to+
In recent work, we provided a formulation of ASP programs in terms of linear logictheories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Se...
详细信息
ISBN:
(纸本)9783642405648
In recent work, we provided a formulation of ASP programs in terms of linear logictheories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Semantics".
Many multi-agent system applications involve software agents that reason about the behavior of other agents with which they interact in cooperation or competition. In order to design and develop those systems, the emp...
详细信息
We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects ...
详细信息
ISBN:
(纸本)3540285385
We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects (ramifications). We give formal results which characterize ME's high degree of modularity and elaboration tolerance, and show how these properties help to separate out, and provide a principled solutions to, the endogenous and exogenous qualification problems. We also show how a notion of (micro) processes can be used to facilitate reasoning at the dual levels of temporal granularity necessary for narrative-based domains involving "instantaneous" series of indirect and knock-on effects.
We present an initial exploration into the possibilities of applying current state-of-the-art answer set programming (ASP) tools-esp. conflict-driven answer set enumeration-for mining itemsets in 0-1 data. We evaluate...
详细信息
ISBN:
(纸本)9783642208942
We present an initial exploration into the possibilities of applying current state-of-the-art answer set programming (ASP) tools-esp. conflict-driven answer set enumeration-for mining itemsets in 0-1 data. We evaluate a simple ASP-based approach experimentally and compare it to a recently proposed framework exploiting constraint programming (CP) solvers for itemset mining.
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to Solutions, and then pick the ones whose weights are over (resp. be...
详细信息
ISBN:
(纸本)9783642042379
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to Solutions, and then pick the ones whose weights are over (resp. below) a threshold. this paper studies Computing weighted Solutions to such problems ill Answer Set programming. We investigate two sorts of methods for computing weighted solutions: one suggests modifying the representation of the problem and the other suggests modifying the search procedure of the answer set solver. We show the applicability and the effectiveness of these methods in phylogeny reconstruction.
Disjunctive Deductive Databases (DDDBs) - function-free disjunctive logic programs with negation in rule bodies allowed - have been recently recognized as a powerful tool for knowledge representation and commonsense r...
详细信息
ISBN:
(纸本)3540632557
Disjunctive Deductive Databases (DDDBs) - function-free disjunctive logic programs with negation in rule bodies allowed - have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a thorough investigation thereof is a basic requirement for building systems which fender previous foundational work on DDDBs useful for practice. this paper presents the architecture of a DDDB system currently developed at TU Vienna in the FWF project P11580-MAT "A Query System for Disjunctive Deductive Databases".
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities...
详细信息
ISBN:
(纸本)9783642042379
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. Oil the one hand, they reveal some reasons responsible for the hardness of computing answer sets. On the other hand. they identify classes of problem instances, for which the problem is "easy" (in P) or "easier than in general" (in NP).
the advantages of FLORID as a deductive object-oriented databaSe system are the rich object-oriented modeling facilities of its language Flogic. the focus of this paper is on FLORID’S multiple inheritance mechanism w...
详细信息
暂无评论