Name
Abstract | ||
|---|---|---|
In many real-life computational search problems, one is not only interested in finding a solution, but also in maintaining a solution under varying circumstances. For example, in the area of network configuration, an initial configuration of a computer network needs to be obtained, but also a new configuration when one of the machines in the network breaks down. Currently, most such revision problems are solved manually, or with highly specialized software. A recent declarative approach to solve (hard) computational search problems involving a lot of domain knowledge, is by finite model generation. Here, the domain knowledge is specified as a logic theory T, and models of T correspond to solutions of the problem. In this paper, we extend this approach to solve revision problems. In particular, our method allows to use the same theory to describe the search problem and the revision problem, and applies techniques from current model generators to find revised solutions. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-20589-7_6 | INAP |
Keywords | Field | DocType |
fo theory,current model generator,search problem,revised model,network configuration,initial configuration,revision problem,computational search problem,real-life computational search problem,domain knowledge,computer network,new configuration | Logic program,Knowledge representation and reasoning,Theory,Domain knowledge,Computer science,Theoretical computer science,Software,Artificial intelligence,Network configuration,Search problem | Conference |
Citations | PageRank | References |
2 | 0.47 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johan Wittocx | 1 | 109 | 9.37 |
| Broes De Cat | 2 | 64 | 6.24 |
| Marc Denecker | 3 | 1626 | 106.40 |