| C. Koch and N. Leone, "Stable Model Checking Made Easy," Proc. 16th Int'l Joint Conf. Artificial Intelligence, Thomas Dean, ed. Morgan Kaufmann, pp. 70-75, Aug. 1999. |
No context found.
C. Koch and N. Leone, "Stable Model Checking Made Easy," Proc. 16th Int'l Joint Conf. Artificial Intelligence, Thomas Dean, ed. Morgan Kaufmann, pp. 70-75, Aug. 1999.
No context found.
C. Koch, N. Leone. Stable Model Checking Made Easy. Proceedings of the 16th International Joint Conference on Arti cial Intelligence { IJCAI'99, Morgan Kaufmann Publishers, pp. 70-75, Sweden, August, 1999.
.... over in the last years, and its language has been enriched in several ways (see, e.g. 14, 13] Relevant optimization techniques have been incorporated in all modules of the DLV engine, including database techniques for efficient instantiation [50, 68] novel techniques for answer set checking [65], heuristics and advanced pruning operators for model generation [51, 17] A s a result, at the time being, DLV is generally recognized to be the state of the art implementation of disjunctive logic programming, it is widely used by researchers all over the world, and it INFSYS RR 1843 02 14 is ....
.... of a model is well known to be co NP complete (cf. 45] However, there are some relevant and frequently used classes of programs where answer set checking can be efficiently performed (see Table 3 in Section 4) INFSYS RR 1843 02 14 The MC implements novel techniques for answer set checking [65], which extend and complement previous results [8, 9, 69] The MC fully complies with the complexity bounds specified in Section 4. Indeed, a) it terminates in polynomial time on every program where answer set checking is tractable according to Table 3 (including, e.g. HCF programs) and (b) it ....
[Article contains additional citation context not shown here]
C. Koch and N. Leone. Stable model checking made easy. In T. Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI) 1999.
....to be monotonic, is that we now have to explicitly check that the model at hand is stable. This is accomplished by the function is Stable. Stable model checking can be effectively done by looking for some unfounded set possibly included in the model, as suggested in [17] and recently improved in [10]. We assume is Stable is implemented as described in [10] Algorithm Optimal Model General 25 Input: A disjunctive program P , a weight function , an aggregation strategy A. Output: An optimal stable model of P w.r.t. A) Procedure Compute Optimal G(I : SetOfLiterals; var best mod : ....
....that the model at hand is stable. This is accomplished by the function is Stable. Stable model checking can be effectively done by looking for some unfounded set possibly included in the model, as suggested in [17] and recently improved in [10] We assume is Stable is implemented as described in [10]. Algorithm Optimal Model General 25 Input: A disjunctive program P , a weight function , an aggregation strategy A. Output: An optimal stable model of P w.r.t. A) Procedure Compute Optimal G(I : SetOfLiterals; var best mod : SetOfLiterals; var best val : Real) var I 0 : ....
Christoph Koch and Nicola Leone. Stable model checking made easy. In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), pages 70--75, Stockholm, Sweden, August 1999. Morgan Kaufmann Publishers.
No context found.
C. Koch and N. Leone. Stable model checking made easy. In Proc. IJCAI-99, pp. 70--75. Morgan Kaufmann, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC