Several proposals of the semantics of aggregates are based oil different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designin...
详细信息
ISBN:
(纸本)9783642042379
Several proposals of the semantics of aggregates are based oil different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designing aggregates, we provide reformulations of some existing semantics in terms of propositional formulas, which help us compare the semanitcs and understand their properties in terms of their propositional formula representations. We also present a generalization of semantics of aggregates without involving grounding, and define loop formulas for programs with aggregates guided by the reductive approach.
Norms and regulations play an important role in the governance of human society. Social rules Such as laws, conventions and contracts prescribe and regulate our behaviour, however it is possible for us to break these ...
详细信息
ISBN:
(纸本)9783642042379
Norms and regulations play an important role in the governance of human society. Social rules Such as laws, conventions and contracts prescribe and regulate our behaviour, however it is possible for us to break these rules at our discretion and face the consequences. By providing the means to describe and reason about norms in a computational context, normative frameworks may be applied to software systems allowing for automated reasoning about the consequences of socially acceptable and unacceptable behaviour. In this paper, we outline our mathematical formulation for normative frameworks and describe how its semantics can be represented in ASP. thus enabling the construction of models of normative systems that can be subjected to formal verification and that can act as functional repositories of normative knowledge for the software components that participate in them.
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 present an extension epsilon L+perpendicular to T of the description logic epsilon L+perpendicular to for reasoning about prototypical properties and inheritance with exceptions. epsilon L+perpendicular to T is obt...
详细信息
ISBN:
(纸本)9783642042379
We present an extension epsilon L+perpendicular to T of the description logic epsilon L+perpendicular to for reasoning about prototypical properties and inheritance with exceptions. epsilon L+perpendicular to T is obtained by adding to epsilon L+perpendicular to a typicality operator T, which is intended to select the "typical" instances of a concept. In epsilon L+perpendicular to T knowledge bases may contain inclusions of the form "T(C) is subsumed by P", expressing that typical C-members have the property P. We show that the problem of entailment in epsilon L+perpendicular to T is in CO-NP.
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.
We present DLV-Complex, an extension of the DLV system that features the support for a powerful (possibly recursive) use of functions, list and set terms in the full ASP language with disjunction and negation. Any com...
详细信息
ISBN:
(纸本)9783642042379
We present DLV-Complex, an extension of the DLV system that features the support for a powerful (possibly recursive) use of functions, list and set terms in the full ASP language with disjunction and negation. Any computable function can be encoded in a rich and fully declarative KRR language, ensuring termination on all programs belonging to the recently introduced class of finitely-ground programs furthermore, termination can be "a priori" guaranteed on demand by means of a syntactic restriction check that ensures a finite-domain property. the system, which is already successfully used in many universities and reinstitutes, comes also equipped with a rich library of built-in functions and predicates for the manipulation of complex terms.
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 the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of boththeoretical and practical interests: on one hand, it will shed new i...
详细信息
ISBN:
(纸本)9783642042379
We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of boththeoretical and practical interests: on one hand, it will shed new insights to understand the expressive power of preferred answer set programs on the other hand, it may also lead to efficient implementations for computing preferred answer sets of logic programs. In this paper, we focus on Brewka and Eiter's preferred answer set programs. We propose a translation from preferred answer set programs to propositional logic and show that there is one-to-one correspondence between the preferred answer sets of the program to the models of the resulting propositional theory. We then link this result to Brewka and Eiter's weakly preferred answer set semantics.
暂无评论