Pages that link to "Item:Q1821564"
From MaRDI portal
The following pages link to Automated deduction by theory resolution (Q1821564):
Displaying 50 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Unification in commutative theories (Q582071) (← links)
- Theory matrices (for modal logics) using alphabetical monotonicity (Q687154) (← links)
- Logic-based subsumption architecture (Q814558) (← links)
- Defining answer classes using resolution refutation (Q881832) (← links)
- Solving quantified verification conditions using satisfiability modulo theories (Q1037401) (← links)
- A mechanical solution of Schubert's steamroller by many-sorted resolution (Q1060859) (← links)
- Link inheritance in abstract clause graphs (Q1097716) (← links)
- A new reduction rule for the connection graph proof procedure (Q1114445) (← links)
- The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning (Q1182164) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- An order-sorted logic for knowledge representation systems (Q1193487) (← links)
- A method for simultaneous search for refutations and models by equational constraint solving (Q1198235) (← links)
- A Prolog technology theorem prover: A new exposition and implementation in Prolog (Q1199932) (← links)
- The ECO family (Q1202626) (← links)
- Exploiting lattices in a theory of space and time (Q1202661) (← links)
- Completing sort hierarchies (Q1202662) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- Refutational theorem proving for hierarchic first-order theories (Q1328182) (← links)
- Hybrid reasoning using universal attachment (Q1329365) (← links)
- Hybridizing nonmonotonic inheritance with theorem proving (Q1356176) (← links)
- On Skolemization in constrained logics (Q1380406) (← links)
- Computing answers with model elimination (Q1402748) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Constraint solving for proof planning (Q1774557) (← links)
- Efficient algorithms for qualitative reasoning about time (Q1855212) (← links)
- A typed resolution principle for deduction with conditional typing theory (Q1855225) (← links)
- \(T\)-theorem proving. I (Q1914165) (← links)
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification (Q1919702) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Structured proof procedures (Q1924823) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Contradiction separation based dynamic multi-clause synergized automated deduction (Q2198231) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- Axiomatic Constraint Systems for Proof Search Modulo Theories (Q2964465) (← links)
- (Q3409868) (← links)
- SOLAR: An automated deduction system for consequence finding (Q3568229) (← links)
- (Q3738607) (← links)
- (Q4438235) (← links)
- (Q4539642) (← links)
- Automated natural deduction prover and experiments (Q4610323) (← links)
- Cyclic connections (Q4645228) (← links)
- Incremental theory reasoning methods for semantic tableaux (Q4645229) (← links)
- Proof normalization modulo (Q4650285) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- The Relative Power of Semantics and Unification (Q4916085) (← links)
- Unification properties of commutative theories: A categorical treatment (Q5096265) (← links)