ISTA Publications
metadata only
Quantified linear and polynomial arithmetic satisfiability via template-based skolemization
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial intelligence, program analysis, etc. While there has been much
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
- The existence of polyhedral invariants is undecidable for linear systems#1105704
- Linear Planar 3-SAT#685151
- Formal Background for the Incompleteness and Undefinability Theorems#111866
- Full Justified Representation in Temporal Voting: Efficient Computation and Verification#1130668
- Robust Approximation and the Arity Barrier at Width Two#1141739
Record · ID 1066555
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