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.
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...
详细信息
In this paper we present STeLP, a solver for Answer Set programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal logic Program), STeLP ...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper we present STeLP, a solver for Answer Set programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal logic Program), STeLP obtains its set of temporal equilibrium models (a generalisation of stable models for this extended syntax). the obtained set of models is represented in terms of a deterministic Buchi automaton capturing the complete program behaviour. In small examples, this automaton can be graphically displayed in a direct and readable way. the input language provides a set of constructs which allow a simple definition of temporal logic programs, including a special syntax for action domains that can be exploited to simplify the graphical output. STeLP combines the use of a standard ASP solver with a linear temporal logic model checker in order to find all models of the input theory.
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 this paper, we study a method for computing temporal equilibrium models, a generalisation of stable models for logic programs with temporal operators, as in Linear Temporal logic (LTL). To this aim, we focus on a s...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper, we study a method for computing temporal equilibrium models, a generalisation of stable models for logic programs with temporal operators, as in Linear Temporal logic (LTL). To this aim, we focus on a syntactic subclass of these temporal logic programs called splitable and whose main property is satisfying a kind of "future projected" dependence present in most dynamic scenarios in Answer Set programming (ASP). Informally speaking, this property can be expressed as "past does not depend on the future." We show that for this syntactic class, temporal equilibrium models can be captured by an LTL formula, that results from the combination of two well-known techniques in ASP: splitting and loop formulas. As a result, an LTL model checker can be used to obtain the temporal equilibrium models of the program.
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.
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 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.
暂无评论