GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Applications of parallel processing technologies in heuristic search planning: methodologies and experiments
    Wiley ; 2009
    In:  Concurrency and Computation: Practice and Experience Vol. 21, No. 15 ( 2009-10), p. 1928-1960
    Details
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 21, No. 15 ( 2009-10), p. 1928-1960
    Abstract: The goal of this paper is to investigate the application of parallel programming techniques to boost the performance of heuristic search‐based planning systems in various aspects. It shows that an appropriate parallelization of a sequential planning system often brings gain in performance and/or scalability. We start by describing general schemes for parallelizing the construction of a plan. We then discuss the applications of these techniques to two domain‐independent heuristic search‐based planners—a competitive conformant planner (C P A) and a state‐of‐the‐art classical planner (FF). We present experimental results—on both shared memory and distributed memory platforms—which show that the performance improvements and scalability are obtained in both cases. Finally, we discuss the issues that should be taken into consideration when designing a parallel planning system and relate our work to the existing literature. Copyright © 2009 John Wiley & Sons, Ltd.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    URL: Article
    DOI: 10.1002/cpe.v21:15
    DOI: 10.1002/cpe.1420
    RVK:
    SA 4270
    Language: English
    Publisher: Wiley
    Publication Date: 2009
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Domain-dependent knowledge in answer set planning
    Association for Computing Machinery (ACM) ; 2006
    In:  ACM Transactions on Computational Logic Vol. 7, No. 4 ( 2006-10), p. 613-657
    Details
    In: ACM Transactions on Computational Logic, Association for Computing Machinery (ACM), Vol. 7, No. 4 ( 2006-10), p. 613-657
    Abstract: In this article we consider three different kinds of domain-dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. We show how temporal, procedural and HTN-based control knowledge can be incorporated into AnsProlog* by the modular addition of a small number of domain-dependent rules, without the need to modify the planner. We formally prove the correctness of our planner, both in the absence and presence of the control knowledge. Finally, we perform some initial experimentation that demonstrates the potential reduction in planning time that can be achieved when procedural domain knowledge is used to solve planning problems with large plan length.
    Type of Medium: Online Resource
    ISSN: 1529-3785 , 1557-945X
    URL: Article
    DOI: 10.1145/1183278.1183279
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2006
    detail.hit.zdb_id: 2025647-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Reasoning about Sensing Actions in Domains with Multi-Valued Fluents
    Springer Science and Business Media LLC ; 2005
    In:  Studia Logica Vol. 79, No. 1 ( 2005-2), p. 135-160
    Details
    In: Studia Logica, Springer Science and Business Media LLC, Vol. 79, No. 1 ( 2005-2), p. 135-160
    Type of Medium: Online Resource
    ISSN: 0039-3215 , 1572-8730
    URL: Article
    DOI: 10.1007/s11225-005-0499-4
    RVK:
    SA 8098
    RVK:
    CA 1000
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2005
    detail.hit.zdb_id: 1478982-6
    SSG: 5,1
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
    Cambridge University Press (CUP) ; 2007
    In:  Theory and Practice of Logic Programming Vol. 7, No. 4 ( 2007-07), p. 377-450
    Details
    In: Theory and Practice of Logic Programming, Cambridge University Press (CUP), Vol. 7, No. 4 ( 2007-07), p. 377-450
    Abstract: We extend the 0-approximation of sensing actions and incomplete information in Son and Baral (2001) to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP -complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.
    Type of Medium: Online Resource
    ISSN: 1471-0684 , 1475-3081
    URL: Article
    DOI: 10.1017/S1471068406002948
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2007
    detail.hit.zdb_id: 2045489-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 5
    Online Resource
    Online Resource
    A Constructive semantic characterization of aggregates in answer set programming
    Cambridge University Press (CUP) ; 2007
    In:  Theory and Practice of Logic Programming Vol. 7, No. 3 ( 2007-05), p. 355-375
    Details
    In: Theory and Practice of Logic Programming, Cambridge University Press (CUP), Vol. 7, No. 3 ( 2007-05), p. 355-375
    Abstract: This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution . Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator Φ aggr P for aggregate programs, independently proposed in Pelov (2004) and Pelov et al. (2004). This operator allows us to closely tie the computational complexity of the answer set checking and answer sets existence problems to the cost of checking a solution of the aggregates in the program. Finally, we relate the semantics described by the operator to other proposals for logic programming with aggregates.
    Type of Medium: Online Resource
    ISSN: 1471-0684 , 1475-3081
    URL: Article
    DOI: 10.1017/S1471068406002936
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2007
    detail.hit.zdb_id: 2045489-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 6
    Online Resource
    Online Resource
    A State-Based Regression Formulation for Domains with Sensing Actions and Incomplete Information
    Centre pour la Communication Scientifique Directe (CCSD) ; 2006
    In:  Logical Methods in Computer Science Vol. Volume 2, Issue 4 ( 2006-10-02)
    Details
    In: Logical Methods in Computer Science, Centre pour la Communication Scientifique Directe (CCSD), Vol. Volume 2, Issue 4 ( 2006-10-02)
    Abstract: We present a state-based regression function for planning domains where an agent does not have complete information and may have sensing actions. We consider binary domains and employ a three-valued characterization of domains with sensing actions to define the regression function. We prove the soundness and completeness of our regression formulation with respect to the definition of progression. More specifically, we show that (i) a plan obtained through regression for a planning problem is indeed a progression solution of that planning problem, and that (ii) for each plan found through progression, using regression one obtains that plan or an equivalent one.
    Type of Medium: Online Resource
    ISSN: 1860-5974
    URL: Article
    DOI: 10.2168/LMCS-2(4:2)2006
    Language: English
    Publisher: Centre pour la Communication Scientifique Directe (CCSD)
    Publication Date: 2006
    detail.hit.zdb_id: 2170262-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 7
    Online Resource
    Online Resource
    Planning with preferences using logic programming
    Cambridge University Press (CUP) ; 2006
    In:  Theory and Practice of Logic Programming Vol. 6, No. 5 ( 2006-09), p. 559-607
    Details
    In: Theory and Practice of Logic Programming, Cambridge University Press (CUP), Vol. 6, No. 5 ( 2006-09), p. 559-607
    Abstract: We present a declarative language, ${\cal PP}$ , for the high-level specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over such preferences. The semantics of ${\cal PP}$ allows the identification of most preferred trajectories for a given goal. We also provide an answer set programming implementation of planning problems with ${\cal PP}$ preferences.
    Type of Medium: Online Resource
    ISSN: 1471-0684 , 1475-3081
    URL: Article
    DOI: 10.1017/S1471068406002717
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2006
    detail.hit.zdb_id: 2045489-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 8
    Online Resource
    Online Resource
    Justifications for logic programs under answer set semantics
    Cambridge University Press (CUP) ; 2009
    In:  Theory and Practice of Logic Programming Vol. 9, No. 1 ( 2009-01), p. 1-56
    Details
    In: Theory and Practice of Logic Programming, Cambridge University Press (CUP), Vol. 9, No. 1 ( 2009-01), p. 1-56
    Abstract: The paper introduces the notion of offline justification for answer set programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom with respect to a given answer set. The paper extends also this notion to provide justification of atoms during the computation of an answer set (on-line justification) and presents an integration of online justifications within the computation model of Smodels . Offline and online justifications provide useful tools to enhance understanding of ASP, and they offer a basic data structure to support methodologies and tools for debugging answer set programs. A preliminary implementation has been developed in – .
    Type of Medium: Online Resource
    ISSN: 1471-0684 , 1475-3081
    URL: Article
    DOI: 10.1017/S1471068408003633
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2009
    detail.hit.zdb_id: 2045489-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...