Pages that link to "Item:Q4046035"
From MaRDI portal
The following pages link to A Decision Procedure for the First Order Theory of Real Addition with Order (Q4046035):
Displayed 50 items.
- A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
- Rank functions of tropical matrices (Q269280) (← links)
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Reasoning about negligibility and proximity in the set of all hyperreals (Q301366) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- Exact complexity bounds for ordinal addition (Q671516) (← links)
- Solving Łukasiewicz \(\mu\)-terms (Q683713) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- Linear quantifier elimination (Q707743) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- The complexity of one-agent refinement modal logic (Q744988) (← links)
- The complexity of almost linear diophantine problems (Q753494) (← links)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic (Q821561) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Real addition and the polynomial hierarchy (Q1063589) (← links)
- The complexity of linear problems in fields (Q1103602) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- On time-space classes and their relation to the theory of real addition (Q1155607) (← links)
- The complexity of logical theories (Q1159661) (← links)
- The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
- An efficient decision procedure for the theory of rational order (Q1244341) (← links)
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases (Q1307697) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Ehrenfeucht games and ordinal addition (Q1377635) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Syntax-guided quantifier instantiation (Q2233503) (← links)
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- Łukasiewicz logics for cooperative games (Q2321328) (← links)
- An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- The complexity of tropical matrix factorization (Q2445938) (← links)
- SLAP: specification logic of actions with probability (Q2447174) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- A Survey of Satisfiability Modulo Theory (Q2830018) (← links)
- The Complexity of One-Agent Refinement Modal Logic (Q2915064) (← links)
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order (Q2988842) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)