Stop the war!
Остановите войну!
for scientists:
default search action
"An Open Research Problem: Strong Completeness of R. Kowalski's Connection ..."
Jörg H. Siekmann, Graham Wrightson (2002)
- 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
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.