Article

A Glimpse of Answer Set Programming.

KI 01/2005; 19:12-.
Source: DBLP

ABSTRACT sentation and reasoning. To solve a problem, a programmer designs a logic program so that models of the program determine solutions to the problem. ASP has been identi ed in the late 1990s as a subarea of logic programming and is becoming one of the fastest growing elds in knowledge representation and declarative programming. Major advantages of ASP are (1) its simplicity, (2) its ability to model e ectively incomplete speci cations and closure constraints, and (3) its relation to constraint satisfaction and propositional satis ability, which allows one to take advantage of advances in these areas when designing solvers for ASP systems.

0 Bookmarks
 · 
133 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Image processing is becoming more and more present in our everyday life. With the requirements of minia- turization, low-power, performance in order to provide some intelligent processing directly into the camera, embedded camera will dominate the image processing landscape in the future. While the common approach of developing such embedded systems is to use sequentially operating processors, image processing algorithms are inherently parallel, thus hardware devices like FP- GAs provide a perfect match to develop highly efficient systems. Unfortunately hardware development is more difficult and there are less experts available compared to software. Automatizing the design process will leverage the existing infrastructure, thus providing faster time to market and quick investigation of new algorithms. We exploit ASP (answer set programming) for system synthesis with the goal of genarating an optimal hardware software partitioning, a viable communication structure and the corresponding scheduling, from an image processing application.
    Proceedings of the 22nd IEEE International Symposium on Rapid System Prototyping, RSP 2011, Karlsruhe, Germany, 24-27 May, 2011; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: No Yes
    01/2008;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The automatic derivation of heuristic functions for guiding the search for plans is a fundamental technique in planning. The type of heuristics that have been considered so far, however, deal only with simple planning models where costs are associated with actions but not with states. In this work we address this limitation by formulating a more expressive planning model and a corresponding heuristic where preferences in the form of penalties and rewards are associated with fluents as well. The heuristic, that is a generalization of the well-known delete-relaxation heuristic, is admissible, informative, but intractable. Exploiting a correspondence between heuristics and preferred models, and a property of formulas compiled in d-DNNF, we show however that if a suitable relaxation of the domain, expressed as the strong completion of a logic program with no time indices or horizon is compiled into d-DNNF, the heuristic can be computed for any search state in time that is linear in the size of the compiled representation. This representation defines an evaluation network or circuit that maps states into heuristic values in linear-time. While this circuit may have exponential size in the worst case, as for OBDDs, this is not necessarily so. We report empirical results, discuss the application of the framework in settings where there are no goals but just preferences, and illustrate the versatility of the account by developing a new heuristic that overcomes limitations of delete-based relaxations through the use of valid but implicit plan constraints. In particular, for the Traveling Salesman Problem, the new heuristic captures the exact cost while the delete-relaxation heuristic, which is also exponential in the worst case, captures only the Minimum Spanning Tree lower bound.
    Artificial Intelligence. 01/2008;

Full-text (2 Sources)

View
2 Downloads
Available from
May 17, 2014