In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchica...
详细信息
We tackle the problem of partial correctness of programs processing structures defined as graphs. We introduce a kernel imperative programming language endowed with atomic actions that participate in the transformatio...
详细信息
Advances in the Internet of things and the Web of Data created huge opportunities for developing applications that can generate actionable knowledge out of streaming data. the trade-off between scalability and express...
详细信息
ISBN:
(数字)9783319220024
ISBN:
(纸本)9783319220024;9783319220017
Advances in the Internet of things and the Web of Data created huge opportunities for developing applications that can generate actionable knowledge out of streaming data. the trade-off between scalability and expressivity is a key challenge in this setting, and more investigation is required to identify what are the relevant features in optimizing this trade-off, and what role do they have in the optimization. In this paper we motivate the need for heuristics to design adaptive solutions and, following an empirical approach, we highlight some key concepts and ideas that can guide the design of heuristics for adaptive optimization of Web Stream reasoning.
We describe symbol elimination and consequence finding in the first-order theorem prover Vampire for automatic generation of quantified invariants, possibly with quantifier alternations, of loops with arrays. Unlike t...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
We describe symbol elimination and consequence finding in the first-order theorem prover Vampire for automatic generation of quantified invariants, possibly with quantifier alternations, of loops with arrays. Unlike the previous implementation of symbol elimination in Vampire, our work is not limited to a specific programming language but provides a generic framework by relying on a simple guarded command representation of the input loop. We also improve the loop analysis part in Vampire by generating loop properties more easily handled by the saturation engine of Vampire. Our experiments show that, with our changes, the number of generated invariants is decreased, in some cases, by a factor of 20. We also provide a framework to use our approach to invariant generation in conjunction with pre- and post-conditions of program loops. We use the program specification to find relevant invariants as well as to verify the partial correctness of the loop. As a case study, we demonstrate how symbol elimination in Vampire can be used as an interface for realistic imperative languages, by integrating our tool in the KeY verification system, thus allowing reasoning about loops in Java programs in a fully automated way, without any user guidance.
We present a spectrum of default logics, using powerdoma~ns to encode default constraints. the resulting non-monotonic entailment relations all satisfy the law of reasoning by cases. this result is a consequence of tw...
详细信息
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves as the basis of logicprogramming and...
详细信息
ISBN:
(纸本)3540255966
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves as the basis of logicprogramming and term rewriting techniques that provide similar advantages to, but remain simpler than, higher-order logicprogramming or term rewriting systems. Previous work on nominal rewriting and logicprogramming has relied on nominal unification, that is, unification up to equality in nominal logic. However, because of nominal logic's equivariance property, these applications require a stronger form of unification, which we call equivariant unification. Unfortunately, equivariant unification and matching are NP-hard decision problems. this paper presents an algorithm for equivariant unification that produces a complete set of finitely many solutions, as well as NP decision procedure and a version that enumerates solutions one at a time. In addition, we present a polynomial time algorithm for swapping-free equivariant matching, that is, for matching problems in which the swapping operation does not appear.
In most works on negotiation dialogues, agents are supposed to be ideally honest. However, there are many situations where such a behaviour cannot always be expected from the agents (e.g. advertising, political negoti...
详细信息
In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. the selection of package tours is done according to several pre...
详细信息
ISBN:
(数字)9783319220024
ISBN:
(纸本)9783319220024;9783319220017
In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. the selection of package tours is done according to several preference criteria aimed at maximizing the expected earnings given a budget. In this paper we formalize an allotment problem that abstracts the requirements of a real travel agent, and we solve it using Answer Set programming. the obtained specification is executable, and it implements an advanced feature of the iTravel+ system.
Automated planning has been the subject of intensive research and is at the core of several areas of AI, including intelligent agents and robotics. In this thesis proposal, we argue that Concurrent Transaction logic (...
详细信息
暂无评论