About: Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In recent years, we have seen a few attempts to use the Answer Set Programming (ASP) to solve the problem of conformant planning with the support for causal laws and negation as failure. Typically, the whole planning domain is encoded into a large ASP meta-program expressing what holds and which actions should be executed in all the time steps of a resulting plan. Answer sets of this meta-program then represent all the possible plans. Since the complexity of answer set computation is exponential in size of input, we propose a technique of dividing it into several smaller meta-programs - one for every state transition. Actual plan finding can then be outsourced to a graph-search algorithm. This method increases the performance of planning with ASP semantics and allows us to produce considerably longer plans. After discussing the worst-case complexity of both approaches, we introduce the prototype ASP planner GRASP that employs our suggested technique and provide the experimental comparison with an alternative planning system DLV K. In recent years, we have seen a few attempts to use the Answer Set Programming (ASP) to solve the problem of conformant planning with the support for causal laws and negation as failure. Typically, the whole planning domain is encoded into a large ASP meta-program expressing what holds and which actions should be executed in all the time steps of a resulting plan. Answer sets of this meta-program then represent all the possible plans. Since the complexity of answer set computation is exponential in size of input, we propose a technique of dividing it into several smaller meta-programs - one for every state transition. Actual plan finding can then be outsourced to a graph-search algorithm. This method increases the performance of planning with ASP semantics and allows us to produce considerably longer plans. After discussing the worst-case complexity of both approaches, we introduce the prototype ASP planner GRASP that employs our suggested technique and provide the experimental comparison with an alternative planning system DLV K. (en)
Title	Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach (en)
skos:prefLabel	Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach (en)
skos:notation	RIV/68407700:21230/14:00227821!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita	I
http://linked.open...avai/riv/aktivity	I
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Čertický, Michal
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	8610
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00227821
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	ASP; Conformant Planning; Incomplete Knowledge; Static Causal Laws (en)
http://linked.open.../riv/klicoveSlovo	ASP Conformant Planning Incomplete Knowledge Static Causal Laws
http://linked.open...odStatuVydavatele	IN - Indická republika
http://linked.open...ontrolniKodProRIV	[845FBAAE180D]
http://linked.open...i/riv/nazevZdroje	International Journal of Artificial Intelligence
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	12
http://linked.open...iv/tvurceVysledku	Čertický, Michal
issn	0974-0635
number of pages	12 (xsd:int)
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software