arXiv (All)
open access
Symbolic Execution of Constrained Horn Clauses
Constrained Horn clauses (CHCs) are a fragment of first-order logic widely used as an intermediate language for verification. We study constrained resolution as a calculus for reasoning about the satisfiability of sets of CHCs. Constrained resolution forms a simple alternative to model checking algo
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
- Finite-on-Top-of-Temporal CSPs in Fixed-Point Logic#1343802
- Studies and Exercises in Formal Logic#58250
- The Complexity of Checking Non-Emptiness in Symbolic Tree Automata#1134215
- DLEAC: A Dialetheic Logic with Exclusive Assumptions and Conclusions#708261
- Display to Labeled Proofs and Back Again for Tense Logics#711054
Record · ID 1188023
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