Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

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

> Home

Details and statistics

DOI: 10.1007/3-540-45632-5_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/birthday/SiekmannW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/SiekmannW02
Jörg H. Siekmann, Graham Wrightson:
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Computational Logic: Logic Programming and Beyond 2002: 231-252

a service of

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.