information-gain-aml 0.1.0

CNF/SAT-based information-theoretic online action model learning

Online Action Model Learning Experiment Framework

Overview

A framework for online action model learning in PDDL domains, using a CNF/SAT solver-based information-theoretic approach for uncertainty representation.

Algorithm

Information-Theoretic Selection - CNF-based approach using expected information gain with SAT solver integration

Getting Started

For detailed architecture and design principles, see DEVELOPMENT_RULES.md

Installation

# Install core dependencies
pip install unified-planning pysat numpy pandas matplotlib

# Install additional UP integrations (optional)
pip install unified-planning[pyperplan,tamer]

# Install requirements
pip install -r requirements.txt

Usage

from src.experiments.runner import ExperimentRunner
from src.algorithms.information_gain import InformationGainLearner

# Configure experiment
config = {
    'domain': 'blocksworld',
    'problems': ['p01', 'p02', 'p03'],
    'algorithms': ['information_gain'],
    'metrics': ['sample_complexity', 'time_to_goal', 'model_accuracy', 'cnf_formula_size'],
    'seed': 42,
    'cnf_settings': {
        'solver': 'minisat',
        'minimize_formulas': True,
        'max_clauses': 1000
    }
}

# Run experiments
runner = ExperimentRunner(config)
results = runner.run()
runner.visualize_results(results)

Code Examples

For detailed examples and code patterns, see QUICK_REFERENCE.md

Project Status

For current implementation status and roadmap, see IMPLEMENTATION_TASKS.md

Testing

# Run curated test suite (51 tests, 100% pass rate)
make test

# Run with Docker for consistent environment
make docker-test

For complete testing options and Docker usage, see QUICK_REFERENCE.md