Pages that link to "Item:Q972432"
From MaRDI portal
The following pages link to Deciding effectively propositional logic using DPLL and substitution sets (Q972432):
Displaying 16 items.
- On the verification of security-aware E-services (Q429592) (← links)
- Deciding effectively propositional logic using DPLL and substitution sets (Q972432) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- SGGS decision procedures (Q2096457) (← links)
- SCL clause learning from simple models (Q2305416) (← links)
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- Property Directed Reachability for Proving Absence of Concurrent Modification Errors (Q2961566) (← 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)
- Ensuring Correctness of Model Transformations While Remaining Decidable (Q3179408) (← links)
- Automated Reasoning Building Blocks (Q3449631) (← links)
- (Q5079756) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover (Q6156634) (← links)
- Synthesis of distributed agreement-based systems with efficiently-decidable verification (Q6536135) (← links)
