標(biāo)題: Titlebook: Logic Programming and Knowledge Representation; Third International Jürgen Dix,Luís Moniz Pereira,Teodor C. Przymusins Conference proceedi [打印本頁] 作者: ARRAY 時(shí)間: 2025-3-21 18:20
書目名稱Logic Programming and Knowledge Representation影響因子(影響力)
書目名稱Logic Programming and Knowledge Representation影響因子(影響力)學(xué)科排名
書目名稱Logic Programming and Knowledge Representation網(wǎng)絡(luò)公開度
書目名稱Logic Programming and Knowledge Representation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logic Programming and Knowledge Representation被引頻次
書目名稱Logic Programming and Knowledge Representation被引頻次學(xué)科排名
書目名稱Logic Programming and Knowledge Representation年度引用
書目名稱Logic Programming and Knowledge Representation年度引用學(xué)科排名
書目名稱Logic Programming and Knowledge Representation讀者反饋
書目名稱Logic Programming and Knowledge Representation讀者反饋學(xué)科排名
作者: 不能和解 時(shí)間: 2025-3-21 21:30 作者: chisel 時(shí)間: 2025-3-22 01:27
Abduction, argumentation and bi-disjunctive logic programs, nondeterminism, BDAS integrates and naturally extends many key semantics, such as the minimal models, EGCWA, the well-founded model, and the stable models. In particular, a novel and interesting argumentation-theoretic characterization of EGCWA is shown. Thus the framework in this paper does not on作者: Glutinous 時(shí)間: 2025-3-22 08:34 作者: Shuttle 時(shí)間: 2025-3-22 10:29 作者: 泥瓦匠 時(shí)間: 2025-3-22 14:11
Evelina Lamma,Paola Mello,Michela Milano,Fabrizio Riguzzi作者: 注射器 時(shí)間: 2025-3-22 20:43
Jo?o Alexandre Leite,Luís Moniz Pereirair es auch so gemeint haben. Dieses m?chten wir anhand der Analyse einer Kinderzeichnung entfalten. Im Folgenden wird es uns dabei vor allem aber auch um die Herausarbeitung der Verwobenheit von Sozial- und Naturerfahrung in diesem ?sthetischen Aneignungsprozess gehen.作者: 有斑點(diǎn) 時(shí)間: 2025-3-23 00:40
Jürgen Dix,Luís Moniz Pereira,Teodor C. Przymusins作者: Stress 時(shí)間: 2025-3-23 05:21 作者: defendant 時(shí)間: 2025-3-23 08:11 作者: Definitive 時(shí)間: 2025-3-23 10:50
Partial evidential stable models for disjunctive deductive databases,t there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics..We define a consistent variant of each class of models, which we call . and .. It is shown that if a database is already consistent w.r.作者: Dignant 時(shí)間: 2025-3-23 14:08
Disjunctive logic programming and autoepistemic logic,served that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based. We also observed that all logic program semantics fall into three semantical points of view: the skeptical, stabl作者: 套索 時(shí)間: 2025-3-23 21:33
A system for abductive learning of logic programs,heory. A new type of induction problem has been defined as an extension of the Inductive Logic Programming framework. In the new problem definition, both the background and the target theories are abductive logic programs and abductive derivability is used as the coverage relation..LAP is based on t作者: lethargy 時(shí)間: 2025-3-24 02:16
Refining action theories through abductive logic programming,ometimes not simple to give an immediately available action theory. In this paper we will present an abductive methodology for describing action domains. We start with an action theory which is not complete, i.e., has more than one model. Then, after some tests are done, we can abduce a complete act作者: Exposition 時(shí)間: 2025-3-24 05:28 作者: FORGO 時(shí)間: 2025-3-24 08:16 作者: 有組織 時(shí)間: 2025-3-24 13:36
Generalizing updates: From models to programs,ion programs. The updating of theory models is governed by their update rules and also by inertia applied to those literals not directly affected by the update program. Though this is important, it remains necessary to tackle as well the updating of programs specifying theories. Some results have be作者: 不再流行 時(shí)間: 2025-3-24 16:44 作者: 持久 時(shí)間: 2025-3-24 19:16 作者: meditation 時(shí)間: 2025-3-25 02:24 作者: Overdose 時(shí)間: 2025-3-25 03:32
A system for abductive learning of logic programs,defined by Kakas and Mancarella [24]. Assumptions can be made in order to cover positive examples and to avoid the coverage of negative ones, and these assumptions can be used as new training data. LAP can be applied for learning in the presence of incomplete knowledge and for learning exceptions to classification rules.作者: 墻壁 時(shí)間: 2025-3-25 09:08 作者: mucous-membrane 時(shí)間: 2025-3-25 11:45 作者: forbid 時(shí)間: 2025-3-25 16:34 作者: 詩集 時(shí)間: 2025-3-25 22:57 作者: 婚姻生活 時(shí)間: 2025-3-26 02:01 作者: 觀察 時(shí)間: 2025-3-26 05:45 作者: VEIL 時(shí)間: 2025-3-26 08:42
https://doi.org/10.1007/BFb0054787Argumentation; knowledge; knowledge representation; learning; logic; logic programming; programming; semant作者: 他去就結(jié)束 時(shí)間: 2025-3-26 12:46 作者: NEX 時(shí)間: 2025-3-26 18:09
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/587908.jpg作者: impaction 時(shí)間: 2025-3-26 23:28
8樓作者: 明智的人 時(shí)間: 2025-3-27 02:18
8樓作者: 變色龍 時(shí)間: 2025-3-27 06:04
8樓作者: 實(shí)施生效 時(shí)間: 2025-3-27 12:12
9樓作者: 上釉彩 時(shí)間: 2025-3-27 16:49
9樓作者: 神圣將軍 時(shí)間: 2025-3-27 21:38
9樓作者: 難管 時(shí)間: 2025-3-27 23:00
9樓作者: 樹上結(jié)蜜糖 時(shí)間: 2025-3-28 02:38
10樓作者: Demulcent 時(shí)間: 2025-3-28 06:42
10樓作者: indemnify 時(shí)間: 2025-3-28 11:19
10樓作者: 原告 時(shí)間: 2025-3-28 16:41
10樓
