Name
Abstract | ||
|---|---|---|
We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while carefully guarding useful knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting Conceptual Logic Programs can be reduced to finite, normal Answer Set Programming, for which reasoners are available. We argue that Conceptual Logic Programming is a useful tool for uniformly representing and reasoning with both ontologies and rules on the Semantic Web, as they can capture a large fragment of the OWL DL ontology language, while extending it in various aspects. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30504-0_9 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
semantic web,answer set programming,knowledge representation | Knowledge representation and reasoning,Programming language,Computer science,Description logic,Theoretical computer science,Negation as failure,Deductive reasoning,Non-monotonic logic,Logic programming,Reasoning system,Answer set programming,Database | Conference |
Volume | ISSN | Citations |
3323 | 0302-9743 | 15 |
PageRank | References | Authors |
0.83 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stijn Heymans | 1 | 463 | 37.60 |
| Davy Van Nieuwenborgh | 2 | 231 | 14.54 |
| Dirk Vermeir | 3 | 694 | 85.34 |