the proceedings contain 26 papers. the topics discussed include: inconsistency management for description logic programs and beyond;reasoning about pattern-based XML queries;answer set programming: language, applicati...
ISBN:
(纸本)9783642396656
the proceedings contain 26 papers. the topics discussed include: inconsistency management for description logic programs and beyond;reasoning about pattern-based XML queries;answer set programming: language, applications and development tools;a variant of earley deduction with partial evaluation;verification and synthesis in description logic based dynamic systems;towards an efficient algorithm to reason over description logics extended with nominal schemas;computing incoherence explanations for learned ontologies;an ontology-based reasoning approach for electric power utilities;conjunctive queries with negation over DL-lite: a closer look;on the exploration of the query rewriting space with existential rules;incomplete information in RDF;RIO: minimizing user interaction in ontology debugging;and eliminating nonmonotonic DL-atoms in description logic programs.
the strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully efficiently. A similar goal is shared by two other approaches. SAT and Constraint Programm...
详细信息
ISBN:
(纸本)9783642042379
the strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully efficiently. A similar goal is shared by two other approaches. SAT and Constraint programming (CP). As future applications of ASP hinge on its Underlying solving techniques, in this note. I will briefly comment on the related techniques, and argue for the need of ASP systems to integrate with state-of-the-art techniques for constraint solving, and in general to serve as the core reasoning engine to glue other logstics and reasoning mechanisms together
nonmonotoniclogics are meant to be a formalization of nonmonotonicreasoning. However, for the most part they fail to capture in a perspicuous fashion two of the most important aspects of such reasoning: the explicit...
详细信息
We present a new approach to reasoning with default logicthat aims at Reiter's original approach, whenever there is no source for incoherence. We accomplish this by shifting the emphasis from the application of i...
详细信息
ISBN:
(纸本)3540667490
We present a new approach to reasoning with default logicthat aims at Reiter's original approach, whenever there is no source for incoherence. We accomplish this by shifting the emphasis from the application of individual default rules to that of the joint application of a default rule together with rules supporting this application. this allows for reasoning in an incremental yet compositional fashion, without giving up the expressiveness needed for knowledge representation. Technically, our approach differs from others in that it guarantees the existence of extensions without requiring semi-monotonicity.
ACMI is a decision support system for the checking of medical invoices in a German health insurance company. We present a brief overview of the system and its implementation in DLV.
ISBN:
(纸本)3540285385
ACMI is a decision support system for the checking of medical invoices in a German health insurance company. We present a brief overview of the system and its implementation in DLV.
the main construction in this paper is an encoding of default logic into an "only knowing" logic with degrees of confidence. By imposing simple and natural constraints on the encoding we show that the "...
详细信息
ISBN:
(纸本)3540285385
the main construction in this paper is an encoding of default logic into an "only knowing" logic with degrees of confidence. By imposing simple and natural constraints on the encoding we show that the "only knowing" logic can accommodate ordered default theories and that the constrained encoding implements a prescriptive interpretation of preference between defaults. An advantage of the encoding is that it provides a transparent formal rendition of such a semantics. A feature of the construction is that the generation of extensions can be carried out within the "only knowing" logic, using object level concepts alone.
Limiting the number of times a variable appears in either the head or the body of a rule, we identify two classes of normal propositional logic programs. these classes have the desirable property that stable models, i...
详细信息
ISBN:
(纸本)3540632557
Limiting the number of times a variable appears in either the head or the body of a rule, we identify two classes of normal propositional logic programs. these classes have the desirable property that stable models, if they exist, can be found in linear time (worst case). We also identify a related class containing;programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-complete. We show in this class how, by relaxing one constraint, previously linear complexity is increased to intractability.
this paper reports oil the Second Answer Set programming Competition. the competitions in areas of Satisfiability checking, Pseudo-Boolean constraint solving and Quantified Boolean Formula evaluation have proven to be...
详细信息
ISBN:
(纸本)9783642042379
this paper reports oil the Second Answer Set programming Competition. the competitions in areas of Satisfiability checking, Pseudo-Boolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing systems. Following this experience, the Answer Set programming competition series was set up in 2007, and ran as part of the internationalconference oil logicprogramming and nonmonotonicreasoning (LPNMR). this second competition, held in conjunction with LPNMR 2009, differed from the first one in two important ways. First, while the original competition was restricted to systems designed for the answer set programming language, the sequel was open to systems designed for other modeling languages, as well. Consequently, among the contestants of the second competition were a CLP(FD) team and three model generation systems for (extensions of) classical logic. Second, this latest competition covered not only satisfiability problems but also optimization ones. We present and discuss the set-up and the results of the competition.
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations studied by BRASS and DIX [4, 5]. the tra...
详细信息
ISBN:
(纸本)3540632557
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations studied by BRASS and DIX [4, 5]. the transformation approach has been introduced in more detail in [7]. In this paper we present a deeper analysis of its complexity and describe an optimized SCC-oriented evaluation. We show that by our method no more work is done than by the alternating fixpoint procedure [23, 24] and that there are examples where our algorithm is significantly superior.
We describe an application of Abductive logicprogramming (ALP) to the analysis of an important class of DNA microarray experiments. We develop an ALP theory that provides a simple and general model of how gene intera...
详细信息
ISBN:
(纸本)3540285385
We describe an application of Abductive logicprogramming (ALP) to the analysis of an important class of DNA microarray experiments. We develop an ALP theory that provides a simple and general model of how gene interactions can cause changes in observable expression levels of genes. Input to the procedure are the observed microarray results;output are hypotheses about possible gene interactions that explain the observed effects. We apply and evaluate our approach on microarray experiments on M. tuberculosis and S. cerevisiae.
暂无评论