Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Papadimitriou, C. H."'
Publikováno v:
Journal of Artificial Intelligence Research, Vol 8, (1998), 23-37
Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn core, respectively) was proposed by Selman and Kautz (1991, 1996) as a form of ``knowledge compilation,'' supporting rapid approximate reasoning; on the
Externí odkaz:
http://arxiv.org/abs/cs/9801101
Autor:
Papadimitriou, C. H., Steiglitz, K.
Publikováno v:
Operations Research, 1978 May 01. 26(3), 434-443.
Externí odkaz:
https://www.jstor.org/stable/169754
Autor:
Papadimitriou, C. H., Sideri, M.
Publikováno v:
Mathematical Systems Theory. 1996, Vol. 29 Issue 2, p97. 14p. 7 Diagrams, 1 Graph.
Publikováno v:
Journal of the ACM; Apr1991, Vol. 38 Issue 2, p255-274, 20p
Publikováno v:
Journal of the ACM; Jan1988, Vol. 35 Issue 1, p18-44, 27p
Publikováno v:
Annals of Mathematics and Artificial Intelligence
Ann.Math.Artif.Intell.
Ann.Math.Artif.Intell.
Extensions in prerequisite-free, disjunction-free default theories have been shown to be in direct correspondence with kernels of directed graphs hence default theories without odd cycles always have a "standard" kind of an extension. We show that, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4485::e3fd662c912563c85984b6733b540553
http://gnosis.library.ucy.ac.cy/handle/7/53865
http://gnosis.library.ucy.ac.cy/handle/7/53865
Autor:
Papadimitriou, C. H., Yannakakis, M.
Publikováno v:
Proceedings of the Fourteenth Annual ACM Symposium: Theory of Computing; 5/ 5/1982, p255-260, 6p
Publikováno v:
Proceedings of the Twenty-Second Annual ACM Symposium: Theory of Computing; May1990, p438-445, 8p
Publikováno v:
Proceedings of the Twenty-Fourth Annual ACM Symposium: Theory of Computing; 7/1/1992, p241-251, 11p
Publikováno v:
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium: Principles of Database Systems; 6/ 4/1996, p81-92, 12p