"An Open Research Problem: Strong Completeness of R. Kowalski's Connection ..."

Jörg H. Siekmann, Graham Wrightson (2002)

> Home

Details and statistics

DOI: 10.1093/JIGPAL/10.1.85

access: closed

type: Journal Article

metadata version: 2020-03-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/igpl/SiekmannW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/igpl/SiekmannW02
Jörg H. Siekmann, Graham Wrightson:
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Log. J. IGPL 10(1): 85-103 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.