Pages that link to "Item:Q4133168"
From MaRDI portal
The following pages link to A Proof Procedure Using Connection Graphs (Q4133168):
Displayed 33 items.
- Argument graphs and assumption-based argumentation (Q253995) (← links)
- Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Generating relevant models (Q809621) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Some representational issues in default reasoning (Q1056558) (← links)
- Automated theorem proving methods (Q1057850) (← links)
- Link inheritance in abstract clause graphs (Q1097716) (← links)
- Inconsistency check of a set of clauses using Petri net reductions (Q1100906) (← links)
- A new reduction rule for the connection graph proof procedure (Q1114445) (← links)
- MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics (Q1118426) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
- Using rewriting rules for connection graphs to prove theorems (Q1137877) (← links)
- A logic for default reasoning (Q1140434) (← links)
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms (Q1143807) (← links)
- Experiments with resolution-based theorem-proving algorithms (Q1165594) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- A new subsumption method in the connection graph proof procedure (Q1199542) (← links)
- The logic of constraint satisfaction (Q1204865) (← links)
- Paramodulated connection graphs (Q1257912) (← links)
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete (Q1311394) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- On the termination of clause graph resolution (Q1344889) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
- The achievement of knowledge bases by cycle search. (Q1854365) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Faster linear unification algorithm (Q2102937) (← links)
- An Algorithm for Generating Arguments in Classical Predicate Logic (Q3638143) (← links)
- A new method for knowledge compilation: The achievement by cycle search (Q4647543) (← links)
- Compressing Propositional Refutations (Q5178991) (← links)
- Proving with BDDs and control of information (Q5210793) (← links)
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach (Q5445306) (← links)