標(biāo)題: Titlebook: Logic Programming and Nonmonotonic Reasoning; Third International V. Wiktor Marek,Anil Nerode,M. Truszczyński Conference proceedings 1995 [打印本頁] 作者: Addendum 時間: 2025-3-21 18:50
書目名稱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é)科排名
作者: confederacy 時間: 2025-3-21 21:10
hermal science, and tribology. Professor Leckie, the consulting editor for applied mechanics, and I are pleased to present this volume of the series: Kinematic 978-1-4612-7601-2978-1-4612-2600-0Series ISSN 0941-5122 Series E-ISSN 2192-063X 作者: Biomarker 時間: 2025-3-22 03:50
Jo?o C. P. da Silva,Sheila R. M. Velosocan also be used in the final year of the studies of MSc students or in the beginning of the studies of PhD students in mechanics and computation sciences..978-3-642-09379-1978-3-540-74361-3Series ISSN 1613-7736 Series E-ISSN 1860-0816 作者: languid 時間: 2025-3-22 05:33 作者: Respond 時間: 2025-3-22 12:33
D. Gabbay,L. Giordano,A. Martelli,N. Olivettican also be used in the final year of the studies of MSc students or in the beginning of the studies of PhD students in mechanics and computation sciences..978-3-642-09379-1978-3-540-74361-3Series ISSN 1613-7736 Series E-ISSN 1860-0816 作者: Affable 時間: 2025-3-22 15:50 作者: Alopecia-Areata 時間: 2025-3-22 20:58 作者: zonules 時間: 2025-3-23 00:59 作者: VOK 時間: 2025-3-23 01:30
Vladimir Lifschitz,Norman McCain,Teodor C. Przymusinski,Robert F. St?rk作者: 智力高 時間: 2025-3-23 07:54
Thomas Eiter,Georg Gottlob,Nicola Leonee methods as compared to the differential algebraic equations, not so thoroughly known at this stage. As a consequence, many of the computer programs currently available for the computer-aided analysis and design of multibody systems rely on well-established methods for the solution of ODE.作者: heckle 時間: 2025-3-23 11:26 作者: 其他 時間: 2025-3-23 15:04 作者: 煞費苦心 時間: 2025-3-23 18:27
Li Yan Yuan,Jia Huai You for academics, students and practitioners in mechanical engineering, design, researchers in the field and teaching staff. This book is can also be used in the final year of the studies of MSc students or in the beginning of the studies of PhD students in mechanics and computation sciences..作者: Hemodialysis 時間: 2025-3-24 00:48
Complexity results for abductive logic programming, from the area of knowledge representation and reasoning. The main part of the paper addresses the issue of the computational complexity of the principal decisional problems in abductive reasoning, which are: Given an instance of an abduction problem (i) does the problem have solution (i.e., an expl作者: 山羊 時間: 2025-3-24 03:31
A terminological interpretation of (abductive) logic programming,s a terminological logic. A terminological logic is designed to represent two different forms of knowledge. A TBox represents definitions for a set of concepts. An ABox represents the . of the expert. In our interpretation, a logic program is a TBox providing definitions for all predicates; this int作者: 離開真充足 時間: 2025-3-24 09:31 作者: 縱欲 時間: 2025-3-24 14:45
An operator for composing deductive data bases with theories of constraints, database. The operation is given an abstract semantics in terms of the immediate consequence operator. A transformational implementation is given and its correctness is proved with respect to the abstract semantics.作者: Saline 時間: 2025-3-24 16:06 作者: 敵手 時間: 2025-3-24 19:01
Characterizations of the stable semantics by partial evaluation,tified programs) and STABLE (defined for the whole class of all disjunctive programs). While there are various competitors based on 3-valued models, notably WFS and its disjunctive counterparts, there are no other semantics consisting of 2-valued models. We argue that the reason for this is the .-pr作者: BRINK 時間: 2025-3-25 00:26
Game characterizations of logic program properties,layers in order to avoid losing. The players are representable as interacting almost independent logic programs. A correspondence between winning strategies, well-founded dependencies, constructive ordinals and hyperarithmetic sets is presented. Complexity results can be obtained for logic program p作者: 開始沒有 時間: 2025-3-25 04:46 作者: 名詞 時間: 2025-3-25 10:41
Loop checking and the well-founded semantics,und with respect to the well-founded semantics; for finite programs, it is also complete. A Prolog-style proof search strategy for a modification of this calculus provides a query evaluation algorithm for finite propositional programs under the well-founded semantics. This algorithm is implemented a作者: 滔滔不絕地說 時間: 2025-3-25 14:54
Annotated revision specification programs, their idea to allow for confidence factors, multiple experts, and so on. The appropriate programming mechanism turns out to be . and the appropriate semantic tool, .. This may be the first example of a setting in which both notions arise naturally, and complement each other. We also show that sever作者: Antagonism 時間: 2025-3-25 17:17 作者: CLAIM 時間: 2025-3-25 23:46
Revision by communication,udy such revisions in a framework where a number of semantical agents is distinguished, each agent associated with a different semantics but all agents interpreting the same program. If an agent cannot find an acceptable model for the program, he has to perform program revision. For logic programs, 作者: Factorable 時間: 2025-3-26 02:37
Hypothetical updates, priority and inconsistency in a logic programming language,uences of updates by sets of atoms and it makes use of a revision mechanism to restore consistency when an update violates some integrity constraint. The revision policy we adopt is based on the simple idea that more recent information is preferred to earlier one. This language can be used to perfor作者: Progesterone 時間: 2025-3-26 06:58 作者: Congregate 時間: 2025-3-26 10:35
On the extension of logic programming with negation through uniform proofs,confusing status of semantics. In this paper we show that elegant, yet natural semantics can be obtained by building a mechanism of justifying default assumptions on top of a proof system. In particular, we propose extended logic programming languages with negation through .. The result is a very ge作者: mighty 時間: 2025-3-26 15:51 作者: LITHE 時間: 2025-3-26 17:18
Skeptical rational extensions,r used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a .. We give characterization results for skeptical rational extensions and an 作者: 恩惠 時間: 2025-3-26 21:14
share in the call for industrial renewal. The general call is urgent as we face profound issues of productivity and competitiveness that require engineering solu- tions, among others. The Mechanical Engineering Series features graduate texts and research monographs intended to address the need for i作者: 富足女人 時間: 2025-3-27 02:13 作者: spinal-stenosis 時間: 2025-3-27 08:21 作者: MOAN 時間: 2025-3-27 12:39 作者: Thymus 時間: 2025-3-27 17:03 作者: 過于平凡 時間: 2025-3-27 17:54 作者: excrete 時間: 2025-3-28 00:21 作者: 惰性女人 時間: 2025-3-28 03:13 作者: 假設(shè) 時間: 2025-3-28 06:58 作者: Cerebrovascular 時間: 2025-3-28 10:58 作者: 職業(yè) 時間: 2025-3-28 15:13 作者: 好開玩笑 時間: 2025-3-28 21:43 作者: 免除責(zé)任 時間: 2025-3-29 00:00 作者: nugatory 時間: 2025-3-29 07:04 作者: inhibit 時間: 2025-3-29 08:42 作者: 沒花的是打擾 時間: 2025-3-29 14:53
A terminological interpretation of (abductive) logic programming,and use classical logic as the language for the ABox. The resulting logic can be seen as an alternative interpretation of abductive logic program formalism. We study the expressivity of the formalism for representing uncertainty by proposing solutions for problems in temporal reasoning, with null values and open domain knowledge.作者: Incommensurate 時間: 2025-3-29 16:48
Revision by communication,s, adds the information they can infer to the program and tries to find an acceptable model for the expanded program. In this paper we will concentrate on the kind of information needed to find successful revisions of programs. We point out some parameters along which our framework can be analyzed and suggest some further research.作者: linear 時間: 2025-3-29 19:52
Skeptical rational extensions,is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.作者: 沉默 時間: 2025-3-30 03:56 作者: rectum 時間: 2025-3-30 07:32
Computing the well-founded semantics faster,rove the . performance of the computation. For a logic program . in atoms .., the speed up over the straight Van Gelder alternating fixed point algorithm (assuming worst-case behavior for both algorithms) is approximately (|.|/|.|).. For |.|≥|.|., the algorithm runs in time linear in |.|.作者: optic-nerve 時間: 2025-3-30 11:18
A sphere world semantics for default reasoning,ew sentence A is added to a belief set K and no sentence in K is deleted), is the class of models of some extension in Reiter‘s default logic. Furthermore, we will show that the class of models in Poole‘s system for default reasoning can be characterized in the same way.作者: ALIAS 時間: 2025-3-30 14:13
On the extension of logic programming with negation through uniform proofs,neral framework, in which . abstract logic programming language can be extended to a nonmonotonic reasoning system, and many semantics, previously proposed and new, can be characterized and understood in terms of uniform proofs.作者: 提升 時間: 2025-3-30 19:20
0302-9743 nd cross-fertilization of ideas. The 28 full papers presented define the state of the art in this interdisciplinary area of research, which has recently attracted much interest.978-3-540-59487-1978-3-540-49282-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 冷淡周邊 時間: 2025-3-30 21:15
Conference proceedings 1995 Reasoning, LPNMR ‘95, held in Lexington, KY, USA in June 1995 under the sponsorship of the Association for Logic Programming..The LPNMR conferences bring together researchers from logic programming and the logical foundations of artificial intelligence in order to facilitate cooperation and cross-f作者: 星球的光亮度 時間: 2025-3-31 02:30 作者: Lipoprotein(A) 時間: 2025-3-31 08:03
Characterizations of the stable semantics by partial evaluation,if we require . and . then STABLE is . determined on the class of all stratified disjunctive logic programs. The underlying notion of a semantics is very general and our abstract properties state that certain . on programs are equivalence preserving.作者: 雜色 時間: 2025-3-31 09:40 作者: Debility 時間: 2025-3-31 15:57 作者: 辯論 時間: 2025-3-31 19:16
Loop checking and the well-founded semantics,und with respect to the well-founded semantics; for finite programs, it is also complete. A Prolog-style proof search strategy for a modification of this calculus provides a query evaluation algorithm for finite propositional programs under the well-founded semantics. This algorithm is implemented as a meta-interpreter.作者: 致敬 時間: 2025-4-1 00:39 作者: Deduct 時間: 2025-4-1 02:15
Default consequence relations as a logical framework for logic programs,jor semantics for logic programs in this framework and study the question what kind of default reasoning is appropriate for them. It is shown, in particular, that default consequence relations based on three-valued inference are adequate for these semantics.作者: 谷物 時間: 2025-4-1 06:51 作者: 拍翅 時間: 2025-4-1 13:51
978-3-540-59487-1Springer-Verlag Berlin Heidelberg 1995作者: charisma 時間: 2025-4-1 17:37
Logic Programming and Nonmonotonic Reasoning978-3-540-49282-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: investigate 時間: 2025-4-1 19:57
https://doi.org/10.1007/3-540-59487-6Nichtklassische Logiken; Nichtmonotones Schlie?en; Programm-Semantik; artificial intelligence; logic; log
