About: Enhancing Constraint Models for Planning Problems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Plánovací problémy se zabývají nelezením (nejkratší) sekvence akcí, která modifikuje iniciální stav světa do požadovaného stavu. Často jsou takovéto problémy řešeny pomocí specializovaných (plánovacích) algoritmů. Avšak exsitují také plánovače založené na translaci plánovacího problému do jiného formalismu, jako například splňování podmínek nebo problém boolovské splnitelnosti, kdy se pak na řešení použije obecný přístup dle daného formalismu. Tato publikace popisuje jak vylepšit existující CSP modely pro plánování pomocí technik jako odstranění symetrií, singleton konzistence a liftování (cs)
  • Planning problems deal with finding a (shortest) sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. The paper describes how to enhance existing constraint models of planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, and lifting
  • Planning problems deal with finding a (shortest) sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. The paper describes how to enhance existing constraint models of planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, and lifting (en)
Title
  • Enhancing Constraint Models for Planning Problems
  • Vylepšování CSP modelů pro plánovací problémy (cs)
  • Enhancing Constraint Models for Planning Problems (en)
skos:prefLabel
  • Enhancing Constraint Models for Planning Problems
  • Vylepšování CSP modelů pro plánovací problémy (cs)
  • Enhancing Constraint Models for Planning Problems (en)
skos:notation
  • RIV/00216208:11650/08:00106603!RIV09-MSM-11650___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • N
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 366267
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11650/08:00106603
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • planning; constraint models; lifting; symmetry breaking (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [057C37459ABC]
http://linked.open...v/mistoKonaniAkce
  • Edinburgh, UK
http://linked.open...i/riv/mistoVydani
  • Edinburgh, UK
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 27th Workshop of the UK Planning and Scheduling Special Interest Group
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Barták, Roman
  • Toropila, Daniel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
issn
  • 1368-5708
number of pages
http://purl.org/ne...btex#hasPublisher
  • Heriot-Watt University
http://localhost/t...ganizacniJednotka
  • 11650
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software