Although knowing the operating systems running in a network is becoming more and more important (mainly for security reasons), current operating system discovery tools are not sufficiently accurate to acquire the info...
详细信息
ISBN:
(纸本)9783642042379
Although knowing the operating systems running in a network is becoming more and more important (mainly for security reasons), current operating system discovery tools are not sufficiently accurate to acquire the information in a fully automated way. Many design choices explain this lack of accuracy, but they all come down to a poor knowledge representation scheme. In this paper, we study how answer set programming call he used to guide the design of a knowledge-oriented operating system discovery tool. the result is significantly more accurate than today's state of the art tools.
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. However, due to technological limitations. we have access to genotype data (genetic ...
详细信息
ISBN:
(纸本)9783642042379
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. However, due to technological limitations. we have access to genotype data (genetic makeup of an individual), and determining haplotypes (genetic makeup of the parents) experimentally is a costly and time consuming procedure. Withthese biological motivations, we Study haplotype inference-determining the haplotypes that form a given set of genotypes-using Answer Set programming we call our approach HAPLO-ASP. this note summarizes the range of problems that can be handled by HAPLO-ASP, and its applicability and effectiveness on real data in comparison withthe other existing approaches.
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, withthe ones by Dalal or Satoh being ...
详细信息
ISBN:
(纸本)9783642042379
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, withthe ones by Dalal or Satoh being two of the most fundamental ones. As is well known, most computational tasks in this area are intractable. therefore, in practical applications, one requires Sufficient conditions under which revision problems become efficiently solvable. In this paper, we identify such tractable fragments for the reasoning and the enumeration problem exploiting the notion of treewidth. More specifically, we present new algorithms based on dynamic programming for these problems in Dalal's setting and a tractability Proof using Courcelle's theorem for Satoh's approach.
In recent years there has been growing interest in solutions for the delivery of clinical care for the elderly, due to the large increase in aging population. Monitoring a patient in his home environment is necessary ...
详细信息
ISBN:
(纸本)9783642042379
In recent years there has been growing interest in solutions for the delivery of clinical care for the elderly, due to the large increase in aging population. Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but this activity must not be too invasive and a burden for clinicians. We prototyped a system called SINDI (Secure and INDependent, living), focused on i) collecting data about the person and the environment through Wireless Sensor Networks (WSN), and ii) reasoning about these data both to contextualize them and to support clinicians in understanding patients' well being as well as ill predicting possible evolutions of their health.
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random "sparse" and "dense" programs with two-literal r...
详细信息
ISBN:
(纸本)9783642042379
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random "sparse" and "dense" programs with two-literal rules have answer sets. We study experimentally how hard it is to compute answer sets of such programs. For programs that are constraint-free and purely negative we show that the easy-hard-easy pattern emerges. We provide arguments to explain that behavior. We also show that the hardness of programs from the hard region grows quickly withthe number of atoms. Our results point to the importance of purely negative constraint-free programs for the development of ASP solvers.
We introduce a nonmonotonic procedure for preferential Description logics in order to reason about typicality by taking probabilities of exceptions into account. We consider an extension, called ALC + T-R(P), of the l...
详细信息
We introduce a nonmonotonic procedure for preferential Description logics in order to reason about typicality by taking probabilities of exceptions into account. We consider an extension, called ALC + T-R(P), of the logic of typicality ALC + T-R by inclusions of the form T(C) subset of(p) D with probability p, whose intuitive meaning is that "all the typical Cs are Ds, and the probability that a C is not a D is 1 - p ''. We consider a notion of extension of an ABox containing only some typicality assertions, then we equip each extension with a probability. We then restrict entailment of a query F to those extensions whose probabilities belong to a given and fixed range. We propose a decision procedure for reasoning in ALC + T-R(P). and we exploit it to show that entailment is EXPTIME-complete as for the underlying ALC. (C) 2019 Elsevier Inc. All rights reserved.
this paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via if technique known as superoptimisation. Answer...
详细信息
ISBN:
(纸本)9783642042379
this paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via if technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for searching over the large. complex search spaces and for proving the functional equivalence of two code sequences. Experimental results are given showing the progress made in solver performance over the previous few years, along with an Outline Of future developments to the system and applications within compiler toolchanis.
In most styles of music, composition is governed by a set of rules. We demonstrate that approaching the automation and analysis of composition declaratively, by expressing these rules in a suitable logical language, p...
详细信息
ISBN:
(纸本)9783642042379
In most styles of music, composition is governed by a set of rules. We demonstrate that approaching the automation and analysis of composition declaratively, by expressing these rules in a suitable logical language, powerful and expressive intelligent composition tools can easily be built. this paper describes the use of answer set programming to construct an automated system, named ANTON, that can compose both melodic and harmonic music, dignose errors in human compositions and serve is a computer-aided composition tool.
We investigate the problem of reasoning in nonmonotonic extensions of first-order logic. In particular, we study reasoning in first-order MKNF, the modal logic of minimal knowledge and negation as failure introduced b...
详细信息
ISBN:
(纸本)3540667490
We investigate the problem of reasoning in nonmonotonic extensions of first-order logic. In particular, we study reasoning in first-order MKNF, the modal logic of minimal knowledge and negation as failure introduced by Lifschitz. MKNF can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, and logicprogramming. By suitably extending deduction methods for propositional nonmonotoniclogics, we define techniques for reasoning in significant subsets of first-order MKNF, which allow for characterizing decidable fragments of first-order nonmonotonic modal logics. Due to the expressive abilities of MKNF, such techniques can be seen as general reasoning methods for several nonmonotonic formalisms based on first-order logic. We also analyze the relationship between such decidable fragments of MKNF and disjunctive Datalog.
暂无评论