Name
Abstract | ||
|---|---|---|
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reasoners are available. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.jal.2006.02.001 | Journal of Applied Logic |
Keywords | Field | DocType |
Answer set programming,Semantic web,Description logics,Open domain reasoning | Functional logic programming,Knowledge representation and reasoning,Programming language,Computer science,Algorithm,F-logic,Theoretical computer science,Non-monotonic logic,Stable model semantics,Logic programming,Reasoning system,Answer set programming | Journal |
Volume | Issue | ISSN |
5 | 1 | 1570-8683 |
Citations | PageRank | References |
18 | 0.66 | 40 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stijn Heymans | 1 | 463 | 37.60 |
| Davy Van Nieuwenborgh | 2 | 231 | 14.54 |
| Dirk Vermeir | 3 | 694 | 85.34 |