This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n13http://localhost/temp/predkladatel/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F10%3A10052035%21RIV11-GA0-11320___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10052035%21RIV11-GA0-11320___
rdf:type
skos:Concept n14:Vysledek
dcterms:description
The paper describes how to enhance existing constraint models of sequential planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, nogoods, lifting, or techniques motivated by the partial-order planning. The paper describes how to enhance existing constraint models of sequential planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, nogoods, lifting, or techniques motivated by the partial-order planning.
dcterms:title
Solving Sequential Planning Problems via Constraint Satisfaction Solving Sequential Planning Problems via Constraint Satisfaction
skos:prefLabel
Solving Sequential Planning Problems via Constraint Satisfaction Solving Sequential Planning Problems via Constraint Satisfaction
skos:notation
RIV/00216208:11320/10:10052035!RIV11-GA0-11320___
n3:aktivita
n12:P n12:Z
n3:aktivity
P(1M0545), P(GA201/07/0205), P(GD201/09/H057), Z(MSM0021620838)
n3:cisloPeriodika
2
n3:dodaniDat
n4:2011
n3:domaciTvurceVysledku
n10:8318573 n10:3555720
n3:druhVysledku
n9:J
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
288563
n3:idVysledku
RIV/00216208:11320/10:10052035
n3:jazykVysledku
n6:eng
n3:klicovaSlova
Constraint Satisfaction; Sequential Planning
n3:klicoveSlovo
n16:Sequential%20Planning n16:Constraint%20Satisfaction
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[5E4C44A0192D]
n3:nazevZdroje
Fundamenta Informaticae
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n7:GA201%2F07%2F0205 n7:1M0545 n7:GD201%2F09%2FH057
n3:rokUplatneniVysledku
n4:2010
n3:svazekPeriodika
99
n3:tvurceVysledku
Toropila, Daniel Barták, Roman
n3:wos
000277761200002
n3:zamer
n19:MSM0021620838
s:issn
0169-2968
s:numberOfPages
21
n13:organizacniJednotka
11320