The following pages link to Maria Paola Bonacina (Q287273):
Displaying 50 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- On different structure-preserving translations to normal form (Q674761) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- (Q1272611) (redirect page) (← links)
- Well-behaved inference rules for first-order theorem proving (Q1272612) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- On subsumption in distributed derivations (Q1337562) (← links)
- A disjunctive positive refinement of model elimination and its application to subsumption deletion (Q1369080) (← links)
- A taxonomy of parallel strategies for deduction (Q1601867) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Distributed deduction by clause-diffusion: Distributed contraction and the Aquarius prover (Q1895413) (← links)
- TPS: A theorem-proving system for classical type theory (Q1923825) (← links)
- On the completeness of incidence calculus (Q1923826) (← links)
- A model and a first analysis of distributed-search contraction-based strategies (Q1978033) (← links)
- SGGS decision procedures (Q2096457) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Theory combination: beyond equality sharing (Q2185458) (← links)
- Conflict-driven satisfiability for theory combination: transition system and completeness (Q2303254) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- On the reconstruction of proofs in distributed theorem proving: A Modified Clause-Diffusion method (Q2365125) (← links)
- PSATO: A distributed propositional prover and its application to quasigroup problems (Q2365127) (← links)
- Satisfiability modulo theories and assignments (Q2405239) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Semantic tableaux with equality (Q2785839) (← links)
- Rewrite-based decision procedures (Q2864358) (← links)
- Rewrite-based satisfiability procedures for recursive data structures (Q2864524) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- On Interpolation in Decision Procedures (Q3010355) (← links)
- Canonical Inference for Implicational Systems (Q3541718) (← links)
- ${\mathcal{T}}$ -Decision by Decomposition (Q3608774) (← links)
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures (Q3613431) (← links)
- On rewrite programs: Semantics and relationship with prolog (Q4015955) (← links)
- (Q4227007) (← links)
- (Q4246963) (← links)
- (Q4281516) (← links)
- (Q4539630) (← links)
- (Q4847004) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- (Q4941840) (← links)
- On fairness of completion-based theorem proving strategies (Q5055773) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- The Clause-Diffusion theorem prover Peers-mcd (system description) (Q5234687) (← links)
- Abstract canonical inference (Q5277771) (← links)
- New results on rewrite-based satisfiability procedures (Q5277822) (← links)
- On Variable-inactivity and Polynomial Formula-Satisfiability Procedures (Q5450569) (← links)
