id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
app01-3392	Balyo, Tomáš; Barták, Roman; Trunda, Otakar	REINFORCED ENCODING FOR PLANNING AS SAT	2015	7	.pdf	application/pdf	5857	333	69	The constructed formula Fk will have the following three kinds of Boolean variables. • Action variables ati indicating whether the i-th ac- tion is used in the t-th step. Solving planning problems via translation to satisfiability (SAT) is one of the most successful approaches to automated planning.	cache/app01-3392.pdf	txt/app01-3392.txt