Towards computing revised models for FO theories
| Autor: | Johan Wittocx, Marc Denecker, Broes De Cat |
|---|---|
| Přispěvatelé: | Abreu, Salvador, Seipel, Dietmar |
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: | |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783642205880 INAP |
| Popis: | In many real-life computational search problems, one is not only interested in finding a solution, but also in maintaining it under varying circumstances. E.g., in the area of network configuration, an initial configuration of a computer network needs to be obtained, as well as 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 also 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. ispartof: pages:199-211 ispartof: Proceedings of the International Conference on Applications of Declarative Programming and Knowledge Management 2009 vol:6547 pages:199-211 ispartof: International Conference on Applications of Declarative Programming and Knowledge Management location:Evora, Portugal date:5 Nov - 7 Nov 2009 status: published |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|