Pages that link to "Item:Q1157324"
From MaRDI portal
The following pages link to Complexity results for classes of quantificational formulas (Q1157324):
Displaying 49 items.
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- The most nonelementary theory (Q598194) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- Deciding effectively propositional logic using DPLL and substitution sets (Q972432) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Average case completeness (Q1176231) (← links)
- Set constraints in some equational theories (Q1271568) (← links)
- On computational complexity of Prolog programs (Q1311967) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- Relational transducers for electronic commerce (Q1591155) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Tarskian set constraints (Q1854523) (← links)
- The guarded fragment with transitive guards (Q1877098) (← links)
- On logics with two variables (Q1960419) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- SCL clause learning from simple models (Q2305416) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Efficiently solving quantified bit-vector formulas (Q2441770) (← links)
- Symbolic backward reachability with effectively propositional logic. Application to security policy analysis (Q2441771) (← links)
- First-order logic with two variables and unary temporal logic (Q2506493) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic (Q2961583) (← links)
- NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Q2964454) (← links)
- XML Schema Mappings (Q3189647) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- Random models and the Gödel case of the decision problem (Q3317081) (← links)
- Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (Q3453234) (← links)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
- Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (Q3541720) (← links)
- Universal quantifiers and time complexity of random access machines (Q3699679) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
- SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation (Q4443408) (← links)
- Using resolution for deciding solvable classes and building finite models (Q4560350) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Set constraints in some equational theories (Q5096315) (← links)
- Data Centric Workflows for Crowdsourcing (Q5100748) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
- First-order definable counting-only queries (Q5919275) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- First order Büchi automata and their application to verification of LTL specifications (Q6643476) (← links)
