T. Castell, M. Cayrol, C. Cayrol et D. Le Berre. Using the Davis and Putnam procedure for an efficient computation of preferred models. In Proc. of ECAI'96, pp. 350-354, Budapest, Hungary, Aug. 11-16, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Decision as Abduction - Sabbadin (1998) (Correct)
....agreement with two non classical decision theories. In this framework, the label computation of one symbol only is necessary, therefore we should not apply classical methods which maintain justifications for all the data. In practice, for the label computation we used the method of (Castell et al. [3]) based on semantical evaluation and on the use of a Davis and Putnam procedure. The representation we propose allows a compromise between a compact representation of decision problems, and efficient computation methods. A similar approach for decision problems under uncertainty was advocated in ....
T. Castell, M. Cayrol, C. Cayrol et D. Le Berre. Using the Davis and Putnam procedure for an efficient computation of preferred models. In Proc. of ECAI'96, pp. 350-354, Budapest, Hungary, Aug. 11-16, 1996.
Logically-Complete Local Search for Propositional.. - Grégoire, Mazure (Correct)
.... probable failures should be exhibited in order for a first analysis to be conducted, other ones are often simple consequence ones or are considered secondary and treated 1 Other approaches to compute circumscritption and minimal models can be found in e.g. Niemela, 1996a; Niemela, 1996b) and (Castell et al. 1996). afterwards (they should not hide the real problem) Coincidently, this will also allow better experimental efficiency results to be obtained. Accordingly, we can rewrite the definition of nonmonotonic inference in the following way, which will prove more convenient for our purpose. Let us ....
Castell, T., Cayrol, C., Cayrol, M., and Le Berre, D. (1996). Using the Davis and Putnam procedure for an efficient computation of preferred models. In Proceedings of the Twelfth European Conference on Artificial Intelligence(ECAI'96), pages 350--354.
Decision-Theoretic Diagnosis and Repair: Representational.. - Le Berre, Sabbadin (1997) Self-citation (Le berre) (Correct)
.... reliability solver ( Provan 1989) e.g. Others use a specific algorithm to transform the DNF denoted by the label into an equivalent one in mutually exclusive form ( Kohlas Monney 1995) e.g. Our work can be related to the latter, but taking advantage of a specific implementation of an ATMS (Castell et al. 1996), we propose to compute the belief of a formula during its label computation, instead of after. The ATMS discussed in (Castell et al. 1996) can be decomposed in two modules, a simplification one and a computation one 5 . Simplification transforms the knowledge base K into K 0 of a specific ....
....in mutually exclusive form ( Kohlas Monney 1995) e.g. Our work can be related to the latter, but taking advantage of a specific implementation of an ATMS (Castell et al. 1996) we propose to compute the belief of a formula during its label computation, instead of after. The ATMS discussed in (Castell et al. 1996) can be decomposed in two modules, a simplification one and a computation one 5 . Simplification transforms the knowledge base K into K 0 of a specific form, such that label K ( label K 0 ( and computation takes advantage of the form of K 0 in order to make the label computation ....
[Article contains additional citation context not shown here]
Castell, T.; Cayrol, M.; Cayrol, C.; and Le Berre, D. 1996. Using the Davis and Putnam procedure for an efficient computation of preferred models. In ECAI'96, 350--354.
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