Consequence Finding Algorithms
作者： Pierre Marquis
DOI: 10.1007/978-94-017-1737-3_3
关键词: Mathematical economics 、 Closed world 、 Section (archaeology) 、 Implicant 、 Scope (project management) 、 Closed-world assumption 、 Propositional formula 、 Computer science
摘要: In this section, the notion of consequence finding is introduced and motivated in informal terms. Then, scope chapter its organization are successively pointed out.
springer.com
sci-hub.st 参考文章(135)
Tomasz Pietrzykowski, Philip T. Cox, General Diagnosis by Abductive Inference. SLP. pp. 183- 189 ,(1987)
Olivier Raiman, Johan de Kleer, A Minimality Maintenance System. principles of knowledge representation and reasoning. pp. 532- 538 ,(1992)
David W. Etherington, Relating default logic and circumscription international joint conference on artificial intelligence. pp. 489- 494 ,(1987)
Pierre Marquis, Knowledge compilation using theory prime implicates international joint conference on artificial intelligence. pp. 837- 843 ,(1995)
Jonathan Stillman, The complexity of propositional default logics national conference on artificial intelligence. pp. 794- 799 ,(1992)
Alvaro Del Val, An analysis of approximate knowledge compilation international joint conference on artificial intelligence. pp. 830- 836 ,(1995)
Goran Gogic, Bart Selman, Henry Kautz, Christos Papadimitriou, The comparative linguistics of knowledge representation international joint conference on artificial intelligence. pp. 862- 869 ,(1995)
Michael Gelfond, Halina Przymusinska, Negation as failure: Careful closure procedure Artificial Intelligence. ,vol. 30, pp. 273- 287 ,(1986) , 10.1016/0004-3702(86)90001-9
R. C. T. Lee, J. R. Slagle, C. L. Chang, Completeness theorems for semantic resolution in consequence-finding international joint conference on artificial intelligence. pp. 281- 285 ,(1969)
Kave Eshghi, A tractable class of abduction problems international joint conference on artificial intelligence. pp. 3- 8 ,(1993)