The following pages link to Jörg H. Siekmann (Q1124374):
Displayed 31 items.
- Computer supported mathematics with \(\Omega\)MEGA (Q865650) (← links)
- Item:Q1124374 (redirect page) (← links)
- Item:Q1094130 (redirect page) (← links)
- On unification: Equational theories are not bounded (Q1094131) (← links)
- Unification in abelian semigroups (Q1098653) (← links)
- Unification theory (Q1124375) (← links)
- Paramodulated connection graphs (Q1257912) (← links)
- Item:Q1124374 (redirect page) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Proof planning with multiple strategies (Q2389631) (← links)
- a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution (Q2947006) (← links)
- (Q3012544) (← links)
- (Q3338215) (← links)
- (Q3484383) (← links)
- (Q3804235) (← links)
- (Q3883563) (← links)
- (Q4013978) (← links)
- (Q4247688) (← links)
- (Q4428312) (← links)
- (Q4530469) (← links)
- An open research problem: strong completeness of R Kowalski's connection graph proof procedure (Q4532365) (← links)
- (Q4619815) (← links)
- (Q4664927) (← links)
- Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666220) (← links)
- (Q4707731) (← links)
- (Q4707767) (← links)
- (Q4720795) (← links)
- (Q4723704) (← links)
- Formal software development in the Verification Support Environment (VSE) (Q4783352) (← links)
- (Q4809051) (← links)
- Ωmega: Towards a mathematical assistant (Q5234706) (← links)
- KI 2004: Advances in Artificial Intelligence (Q5450782) (← links)