Enlighten Publications
metadata only
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Evaluation indicator system for AI certificate programs#299218
- The Why and How of Deductive Program Verification#460994
- Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems#257676
- Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming#781004
- Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming#779629
Record · ID 468084
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive