Downloads: constraint solving, planning, decision-making

Software by Jussi Rintanen and his research group(s).

Madagascar planner (asynchronous, deterministic, perfect information) see: planning by SAT and planning overview
- binaries: M, Mp, MpC (64-bit Ubuntu Linux)
- source: MADAGASCAR.TAR (last change: November 16, 2023)
- papers: [Rintanen, Heljanko & Niemelä, AIJ 2006], [Rintanen, AIJ 2012], [Rintanen, ECAI 2012]
contingent planner with small-memory plans (asynchronous, nondeterministic, incomplete information, partially observable)
- problem files: icaps18dimacs.tar (DIMACS+graphs for GraphSAT), icaps18ndl.tar.bz2 (NDL)
- paper: [Pandey & Rintanen, ICAPS 2018]
GraphSAT SAT solver (CNF + graph constraints: acyclicity, s-t-reachability)
- binary: graphsat (64-bit Ubuntu Linux)
- papers: [Gebser et al., 2014]
graph2dimacs translator DIMACS+reach -> DIMACS+acyc -> DIMACS
- binary: graph2dimacs (64-bit Ubuntu Linux)
- source: graph2dimacs.tar.bz2 (Standard ML, mlton)
Classical planning with indirect effects/forced actions:
- source code: LAMAfa (LAMA with forced actions)
- source code: FFF1 (FF with forced actions)
- paper: [Elahi et al. ICAPS'24]