標(biāo)題: Titlebook: Logic Programming and Nonmonotonic Reasoning; Fourth International Jürgen Dix,Ulrich Furbach,Anil Nerode Conference proceedings 1997 Spring [打印本頁(yè)] 作者: papyrus 時(shí)間: 2025-3-21 17:02
書目名稱Logic Programming and Nonmonotonic Reasoning影響因子(影響力)
書目名稱Logic Programming and Nonmonotonic Reasoning影響因子(影響力)學(xué)科排名
書目名稱Logic Programming and Nonmonotonic Reasoning網(wǎng)絡(luò)公開度
書目名稱Logic Programming and Nonmonotonic Reasoning網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logic Programming and Nonmonotonic Reasoning被引頻次
書目名稱Logic Programming and Nonmonotonic Reasoning被引頻次學(xué)科排名
書目名稱Logic Programming and Nonmonotonic Reasoning年度引用
書目名稱Logic Programming and Nonmonotonic Reasoning年度引用學(xué)科排名
書目名稱Logic Programming and Nonmonotonic Reasoning讀者反饋
書目名稱Logic Programming and Nonmonotonic Reasoning讀者反饋學(xué)科排名
作者: 虛情假意 時(shí)間: 2025-3-21 21:28
Logic Programming and Nonmonotonic Reasoning978-3-540-69249-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 摘要記錄 時(shí)間: 2025-3-22 04:09
https://doi.org/10.1007/3-540-63255-7Artificial intelligence; Automated Deduction; Constraint Progamming; Logic Programming; Nonclassical Log作者: TAIN 時(shí)間: 2025-3-22 07:29 作者: recede 時(shí)間: 2025-3-22 10:29
On conservative enforced updates,se that it performs the minimum of the necessary changes in the initial data base. The method is based on a novel idea of a so called preference strategy, i.e. an “oracle” which resolves globally all the conflicts, taking into account the update to be committed.作者: craven 時(shí)間: 2025-3-22 16:22 作者: Kaleidoscope 時(shí)間: 2025-3-22 19:07 作者: glowing 時(shí)間: 2025-3-22 23:46
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/587903.jpg作者: freight 時(shí)間: 2025-3-23 02:30
tersuchungsverfahren wie die Computertomographie, neuerdings die Kernspintomographie, insbesondere aber die Sonographie haben das Spektrum der diagnostischen M?glichkeiten bei Erkrankungen im Kindesalter erheblich erweitert. Die zeitgem??e, kindgerechte Anwendung der zur Verfügung stehenden Verfahre作者: 自制 時(shí)間: 2025-3-23 08:12 作者: 逃避現(xiàn)實(shí) 時(shí)間: 2025-3-23 12:22 作者: 稱贊 時(shí)間: 2025-3-23 17:41 作者: Aromatic 時(shí)間: 2025-3-23 20:43 作者: Cumulus 時(shí)間: 2025-3-23 23:19 作者: LATE 時(shí)間: 2025-3-24 03:03
Is non-monotonic reasoning always harder, actually simplifies matters. Indeed, one of the reasons for considering non-monotonic systems is the hope of speeding up reasoning, and not to slow it down. In this paper, we consider proof lengths in a cut-free sequent calculus, and we show that the application of circumscription (or completion) t作者: 陰險(xiǎn) 時(shí)間: 2025-3-24 07:31 作者: 生命層 時(shí)間: 2025-3-24 11:37
Affordable classes of normal logic programs,ms. These classes have the desirable property that stable models, if they exist, can be found in linear time (worst case). We also identify a related class containing programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-comp作者: carotid-bruit 時(shí)間: 2025-3-24 14:53 作者: 障礙物 時(shí)間: 2025-3-24 19:40
Separating disbeliefs from beliefs in autoepistemic reasoning, disbelief. Along the separation of beliefs and disbeliefs, the relationship between autoepistemic logic and default logic becomes very intuitive. Straightforward ways of translating default theories into separated autoepistemic theories and back are presented. These translations are shown to preser作者: CAPE 時(shí)間: 2025-3-25 01:10
Power defaults (preliminary report), the law of reasoning by cases. This result is a consequence of two general theorems valid for any Scott domain: the Dichotomy Theorem and the Extension Splitting Theorem. We briefly indicate that for propositional logic, the complexity of entailment is complete for co-NP(3).作者: intrude 時(shí)間: 2025-3-25 06:16 作者: Incumbent 時(shí)間: 2025-3-25 09:24
Resolution for skeptical stable semantics, . subset of the program rules. Moreover, we characterize a large class of programs whose derivations may proceed in a thoroughly goal-directed way. Some inferences, which depend on non-ground negative goals, can be drawn without resorting to negation-as-failure; as a consequence, many goals which f作者: 不斷的變動(dòng) 時(shí)間: 2025-3-25 14:21
Computing non-ground representations of stable models,of constrained atoms is a constrained interpretation. We show how non-ground representations of . the stable model and the well-founded semantics may be obtained through Turi‘s approach. As a practical consequence, the well-founded model (or the set of stable models) may be partially pre-computed at作者: JECT 時(shí)間: 2025-3-25 18:54 作者: 爆炸 時(shí)間: 2025-3-25 23:04
A paraconsistent semantics with contradiction support detection,. and present its embedding into .. We then address the problem of detecting contradiction support and relate it to ..‘s intrinsic properties. Afterwards, we show how to implement two recent modal contradiction related constructs in the language of extended logic programs in order to gain explicit c作者: Peristalsis 時(shí)間: 2025-3-26 02:30
On conservative enforced updates,se that it performs the minimum of the necessary changes in the initial data base. The method is based on a novel idea of a so called preference strategy, i.e. an “oracle” which resolves globally all the conflicts, taking into account the update to be committed.作者: scrutiny 時(shí)間: 2025-3-26 05:30
Michael Dekhtyar,Alexander Dikovsky,Nicolas Spyratos作者: meritorious 時(shí)間: 2025-3-26 09:59 作者: 強(qiáng)所 時(shí)間: 2025-3-26 16:11 作者: 現(xiàn)任者 時(shí)間: 2025-3-26 17:48
cklungen die Gefahr einer überbewertung ihrer Aussagekraft in sich bergen, findet ein "diagnostisches Flu?diagramm" besondere Berücksichtigung. Dadurch sollen alle mit Erkrankungen des Kindesalters befa?ten ?rzte Hinweise für die richtige Indikation und eine sinnvolle Reihenfolge der bildgebenden Verfahren be978-3-642-96920-1978-3-642-96919-5作者: 內(nèi)行 時(shí)間: 2025-3-27 00:48 作者: bourgeois 時(shí)間: 2025-3-27 02:46 作者: jeopardize 時(shí)間: 2025-3-27 05:38 作者: 大量殺死 時(shí)間: 2025-3-27 11:39
Simulations between programs as cellular automata,llular automaton leads to a general method for simulating any covered program with a Horn clause program. This means that orbits of Horn programs are completely representative of orbits of covered normal programs.作者: JOG 時(shí)間: 2025-3-27 17:21
Separating disbeliefs from beliefs in autoepistemic reasoning,xtensions are captured by their analogs in separated autoepistemic logic, and vice versa. A particular novelty of the approach is that a reasonable notion of separated stationary expansions can be established.作者: 粗語 時(shí)間: 2025-3-27 18:47 作者: 轎車 時(shí)間: 2025-3-28 01:16 作者: Banister 時(shí)間: 2025-3-28 04:59
Nonmonotonic reasoning with quantified boolean constraints,ions of logic programming, circumscription, and default logic. Finally, we discuss some results about the relative succinctness of our reasoning formalisms versus any formalism for which model checking can be done somewhere in the polynomial time hierarchy.作者: 嬉耍 時(shí)間: 2025-3-28 06:24
Computing non-ground representations of stable models,e atom is an instance of one of some constrained atom whose associated constraint is solvable. Various related complexity results are explored, and the impacts of these results are discussed from the point of view of implementing systems that incorporate the stable and well-founded semantics.作者: alliance 時(shí)間: 2025-3-28 12:55
,A study of Przymusinski’s static semantics, without nested modalities and theories serving as translations of general logic programs. The representation of the latter will allow us to clarify a place of the static semantics for logic programs in the general classification proposed in [5].作者: overhaul 時(shí)間: 2025-3-28 16:23 作者: 針葉樹 時(shí)間: 2025-3-28 22:33 作者: 玉米 時(shí)間: 2025-3-29 02:55 作者: BOLUS 時(shí)間: 2025-3-29 04:11 作者: 消音器 時(shí)間: 2025-3-29 10:49
Affordable classes of normal logic programs,class containing programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-complete. We show in this class how, by relaxing one constraint, previously linear complexity is increased to intractability.作者: chiropractor 時(shí)間: 2025-3-29 15:24
Resolution for skeptical stable semantics,ome inferences, which depend on non-ground negative goals, can be drawn without resorting to negation-as-failure; as a consequence, many goals which flounder in the standard setting, have a successful skeptical derivation. The paper contains a preliminary study of some interesting derivation strategies.作者: Mirage 時(shí)間: 2025-3-29 18:26 作者: ARK 時(shí)間: 2025-3-29 23:05
0302-9743 ts of invited presentations. The papers included report state-of-the-art research and development in the interdisciplinary area of logic programming and logical foundations of artificial intelligence.978-3-540-63255-9978-3-540-69249-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Favorable 時(shí)間: 2025-3-30 03:22
7樓作者: archenemy 時(shí)間: 2025-3-30 08:03
7樓作者: aesthetician 時(shí)間: 2025-3-30 08:15
7樓作者: 使出神 時(shí)間: 2025-3-30 12:27
7樓作者: interrupt 時(shí)間: 2025-3-30 20:29
8樓作者: 欲望小妹 時(shí)間: 2025-3-30 21:47
8樓作者: 輕打 時(shí)間: 2025-3-31 01:12
8樓作者: 任命 時(shí)間: 2025-3-31 05:49
8樓作者: 反話 時(shí)間: 2025-3-31 12:09
9樓作者: WATER 時(shí)間: 2025-3-31 15:51
9樓作者: Root494 時(shí)間: 2025-3-31 19:36
9樓作者: Isolate 時(shí)間: 2025-4-1 01:45
9樓作者: Monotonous 時(shí)間: 2025-4-1 02:57
10樓作者: 性冷淡 時(shí)間: 2025-4-1 08:01
10樓作者: gnarled 時(shí)間: 2025-4-1 10:51
10樓作者: Mere僅僅 時(shí)間: 2025-4-1 14:52
10樓
