An open research problem: strong completeness of R Kowalski's connection graph proof procedure.
- Published in:
- Logic Journal of the IGPL, 2002, v. 10, n. 1, p. 85, doi. 10.1093/jigpal/10.1.85
- By:
- Publication type:
- Article
Works matching IS 13670751 AND DT 2002 AND VI 10 AND IP 1
Results: 4
1
2
A general framework for pattern-driven modal tableaux.
- Published in:
- Logic Journal of the IGPL, 2002, v. 10, n. 1, p. 51, doi. 10.1093/jigpal/10.1.51
- By:
- Publication type:
- Article
3
Disjunctions and specificity in suppositional defeasible argumentation.
- Published in:
- Logic Journal of the IGPL, 2002, v. 10, n. 1, p. 23, doi. 10.1093/jigpal/10.1.23
- By:
- Publication type:
- Article
4
A spatial similarity measure based on games: theory and practice.
- Published in:
- Logic Journal of the IGPL, 2002, v. 10, n. 1, p. 1, doi. 10.1093/jigpal/10.1.1
- By:
- Publication type:
- Article