The recent series 5 of the Answer Set programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constr...
详细信息
The recent series 5 of the Answer Set programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems.
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet...
详细信息
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the precise formal relation between them. We believe that this work will boost the cross-fertilization of the theoretical foundations and the existing solving methods in both areas. As a step in this direction, we provide a translation from constraint answer set programs with integer linear constraints to satisfiability modulo linear integer arithmetic that paves the way to utilizing modern satisfiability modulo theories solvers for computing answer sets of constraint answer set programs.
logicprogramming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/ coinductive soundness of formulae is a challenging t...
详细信息
logicprogramming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/ coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logicprogramming for regular formulae. Another, less famous, but equally fundamental and important undecidable property is productivity. If a derivation is infinite and coinductively sound, we may ask whether the computed answer it determines actually computes an infinite formula. If it does, the infinite computation is productive. This intuition was first expressed under the name of computations at infinity in the 80s. In modern days of the Internet and stream processing, its importance lies in connection to infinite data structure processing. Recently, an algorithm was presented that semi-decides a weaker property -of productivity of logic programs. A logic program is productive if it can give rise to productive derivations. In this paper, we strengthen these recent results. We propose a method that semi-decides productivity of individual derivations for regular formulae. Thus, we at last give an algorithmic counterpart to the notion of productivity of derivations in logicprogramming. This is the first algorithmic solution to the problem since it was raised more than 30 years ago. We also present an implementation of this algorithm.
We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressi...
详细信息
We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressive nonmonotonic language of answer set programming (ASP), and computation of the branches of a conditional plan in parallel using an ASP solver. In particular, thanks to external atoms, continuous feasibility checks (like collision checks) are embedded into formal representations of actuation actions and sensing actions in ASP;and thus each branch of a hybrid conditional plan describes a feasible execution of actions to reach their goals. Utilizing nonmonotonic constructs and nondeterministic choices, partial knowledge about states and nondeterministic effects of sensing actions can be explicitly formalized in ASP;and thus each branch of a conditional plan can be computed by an ASP solver without necessitating a conformant planner and an ordering of sensing actions in advance. We apply our method in a service robotics domain and report experimental evaluations. Furthermore, we present performance comparisons with other compilation based conditional planners on standardized benchmark domains.
Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. This talk will trace back the logicprogramming and non-monotonic reasoning origins of two well-known arg...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. This talk will trace back the logicprogramming and non-monotonic reasoning origins of two well-known argumentation formalisms in AI (namely abstract argumentation and assumption-based argumentation). Finally, the talk will discuss recent developments in AI making use of computational argumentation, in particular to support collaborative decision making.
We present the third generation of the constraint answer set system clingcon, combining Answer Set programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach t...
详细信息
We present the third generation of the constraint answer set system clingcon, combining Answer Set programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp. No extension is needed for parsing and grounding clingcon's hybrid modeling language since both can be accommodated by the new generic theory handling capabilities of the ASP grounder gringo. As a whole, clingcon 3 is thus an extension of the ASP system clingo 5, which itself relies on the grounder gringo and the solver clasp. The new approach of clingcon offers a seamless integration of CP propagation into ASP solving that benefits from the whole spectrum of clasp's reasoning modes, including, for instance, multi-shot solving and advanced optimization techniques. This is accomplished by a lazy approach that unfolds the representation of constraints and adds it to that of the logic program only when needed. Although the unfolding is usually dictated by the constraint propagators during solving, it can already be partially (or even totally) done during preprocessing. Moreover, clingcon's constraint preprocessing and propagation incorporate several well-established CP techniques that greatly improve its performance. We demonstrate this via an extensive empirical evaluation contrasting, first, the various techniques in the context of CSP solving and, second, the new clingcon system with other hybrid ASP systems.
Material programming is a proposal for how we are going to practice interaction design in the future, when grapheme transistors make genuine computational composites possible. Material programming is an embodied form ...
详细信息
Material programming is a proposal for how we are going to practice interaction design in the future, when grapheme transistors make genuine computational composites possible. Material programming is an embodied form of programming that supports kinesthetic creative practices. Material programming would complement traditional crafting of physical form with the crafting of temporal form;together they would make up the future practice of interaction design. The designer would program directly on the material and thus have first-hand access to explore and experience the outcome of different interactive compositions. With tools in hand, working directly with the material, the designer would be able to achieve an embodied sense of its interactive and expressive properties. Such tools would each have a specific function designed from the designer's point of view, rather than from a programming-logic point of view. By limiting the scope for each tool's action space, it would also be possible to create rather sophisticated tools. Material programming would happen on-site instead of through a detached desktop computer, with physical tools working directly on the materials. This would lower the threshold for designers to truly explore the potential of a new material in context and thus give them a better sense of the design space. since the physical interaction with the material is central to this programmingpractice, the designer can slowly develop tacit bodily skills and knowledge of how to use the expressive properties of both tools and materials. The tools allow the interaction designer to use her body in ways similar to that of crafting non-computational materials, enabling and utilizing the designer's expressive potential.
We present I-DLV+MS, a new Answer Set programming (ASP) system that integrates an efficient grounder, namely I-DLV, with an automatic selector that inductively chooses a solver: depending on some inherent features of ...
详细信息
This paper presents a practical application of Answer Set programming to the understanding of narratives about restaurants. While this task was investigated in depth by Erik Mueller, exceptional scenarios remained a s...
详细信息
Answer Set programming (ASP) is one of the major declarative programming paradigms in the area of logicprogramming and non-monotonic reasoning. Despite that ASP features a simple syntax and an intuitive semantics, er...
详细信息
暂无评论