Name
Abstract | ||
|---|---|---|
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a partial order relation on the program's rules can be used to deduce a preference relation on its extended answer sets. In this paper, we propose a "quantitative" preference relation that associates a weight with each rule in a program. Intuitively, these weights define the "cost" of defeating a rule. An extended answer set is preferred if it minimizes the sum of the weights of its defeated rules. We characterize the expressiveness of the resulting semantics and show that it can capture negation as failure. Moreover the semantics can be conveniently extended to sequences of weight preferences, without increasing the expressiveness. We illustrate an application of the approach by showing how it can elegantly express subgraph isomorphic approximation problems, a concept often used in intelligence analysis to find specific regions of interest in a large graph of observed activities. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-32275-7_12 | Lecture Notes in Artificial Intelligence |
Keywords | Field | DocType |
partial order,intelligence analysis | Knowledge representation and reasoning,Preference relation,Negation,Computer science,Algorithm,Theoretical computer science,Negation as failure,Artificial intelligence,Stable model semantics,Logic programming,Semantics,Partially ordered set | Conference |
Volume | ISSN | Citations |
3452 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Davy Van Nieuwenborgh | 1 | 231 | 14.54 |
| Stijn Heymans | 2 | 463 | 37.60 |
| Dirk Vermeir | 3 | 694 | 85.34 |