Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
APCCM
/
Paper
Checking Feasible Completeness of Domain Models with Natural Language Queries.
Christian Kop
Venue
Australasian
APCCM
Year
2012
Proceedings
APCCM
DBLP record
conf/apccm/Kop12 ↗
Browse the full
APCCM paper archive
.