UNT Digital Library
metadata only
Periodically specified satisfiability problems with applications: An alternative to domino problems
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
- Formalizing the Omega Test in Dafny#1129494
- Circuit-Based Program Verification: Sequential Circuits as an Intermediate Representation for Verifying C Programs#440436
- SNIPTEST: Fuzzing Multi-Level Code Slices for Validating Vulnerabilities#463293
- Automatisierte (Un)Gleichheit durch Künstliche Intelligenz#705969
- Software Testing in Computable Analysis#442730
Record · ID 483996
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