A Lower Bound for Answer Set Solver Computation
We build upon recent work by Lierler that denes an abstract framework for describing the algorithm underlying many of the existing answer set solvers (for answer set programs, based upon the Answer Set Seman- tics), considering in particular Smodels and SUP. We dene a particular class of programs, c...
Kaydedildi:
| Yayımlandı: | Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial |
|---|---|
| Asıl Yazarlar: | , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Asociación Española para la Inteligencia Artificial
2010
|
| Konular: | |
| Online Erişim: | https://www.redalyc.org/articulo.oa?id=92513175005 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|