標(biāo)題: Titlebook: Correct Reasoning; Essays on Logic-Base Esra Erdem,Joohyung Lee,David Pearce Book 2012 Springer-Verlag Berlin Heidelberg 2012 approximate u [打印本頁(yè)] 作者: 相似 時(shí)間: 2025-3-21 16:08
書目名稱Correct Reasoning影響因子(影響力)
書目名稱Correct Reasoning影響因子(影響力)學(xué)科排名
書目名稱Correct Reasoning網(wǎng)絡(luò)公開度
書目名稱Correct Reasoning網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Correct Reasoning被引頻次
書目名稱Correct Reasoning被引頻次學(xué)科排名
書目名稱Correct Reasoning年度引用
書目名稱Correct Reasoning年度引用學(xué)科排名
書目名稱Correct Reasoning讀者反饋
書目名稱Correct Reasoning讀者反饋學(xué)科排名
作者: 免除責(zé)任 時(shí)間: 2025-3-21 21:30
Here and There among Logics for Logic Programming,he same semantics, so their differences are largely due to choice of the underlying language. Our representation suggests a more tolerant answer to the question ‘What is the Logic of Logic Programming?’, as well as some further expressive opportunities in using logic programs as a general knowledge representation formalism.作者: 巡回 時(shí)間: 2025-3-22 03:29 作者: Locale 時(shí)間: 2025-3-22 05:30
Applications of Action Languages in Cognitive Robotics,g/prediction with complex (temporal) goals/constraints. We discuss how these challenges can be handled using computational methods of action languages, and elaborate on the usefulness of action languages to extend the classical 3-layer robot control architecture.作者: dagger 時(shí)間: 2025-3-22 12:41 作者: 腐蝕 時(shí)間: 2025-3-22 14:16 作者: 腐蝕 時(shí)間: 2025-3-22 19:15
Just When You Thought You Could Bank on itit in on the course so that I would know what he was teaching each week. I agreed to sit in on the course, but without much enthusiasm because I believed that I already knew the content he was planning to teach.作者: 音樂戲劇 時(shí)間: 2025-3-22 22:11
https://doi.org/10.1007/978-3-319-08260-8 This work provides a tutorial-like introduction to the problem of query answering under existential and equality constraints. We survey the most notable (semantic and syntactic) restrictions to such constraints ensuring decidability of query answering, and we discuss their practical application to conceptual modelling.作者: AUGER 時(shí)間: 2025-3-23 04:46 作者: 繁重 時(shí)間: 2025-3-23 07:56
Emil W. P?ywaczewski,Izabela Kra?nickaspect to traditional Prolog computation and with respect to answer set programming. We prove completeness of answer sets for . with respect to {0,1} solutions of .(.) for programs with only negated atoms in the body of clauses. We offer equational semantics for logic programs with negation as failure in the spirit of Clark’s completion.作者: 星球的光亮度 時(shí)間: 2025-3-23 13:12
To Vladimir Lifschitz on His 65th Birthday,arch; his work on stable models with Michael Gelfond, and some of my work in related areas; and describe some of the many contributions Vladimir has made in formalizing ad hoc approaches in artificial intelligence to a formal basis of logic-based analysis.作者: Eviction 時(shí)間: 2025-3-23 14:02
,Vladimir Lifschitz — A Youth at 65,it in on the course so that I would know what he was teaching each week. I agreed to sit in on the course, but without much enthusiasm because I believed that I already knew the content he was planning to teach.作者: Derogate 時(shí)間: 2025-3-23 19:29
On the Interaction of Existential Rules and Equality Constraints in Ontology Querying, This work provides a tutorial-like introduction to the problem of query answering under existential and equality constraints. We survey the most notable (semantic and syntactic) restrictions to such constraints ensuring decidability of query answering, and we discuss their practical application to conceptual modelling.作者: Veneer 時(shí)間: 2025-3-24 01:32 作者: 符合你規(guī)定 時(shí)間: 2025-3-24 06:11
An Equational Approach to Logic Programming,spect to traditional Prolog computation and with respect to answer set programming. We prove completeness of answer sets for . with respect to {0,1} solutions of .(.) for programs with only negated atoms in the body of clauses. We offer equational semantics for logic programs with negation as failure in the spirit of Clark’s completion.作者: photopsia 時(shí)間: 2025-3-24 08:46
0302-9743 sents 39 articles by colleagues from all over the world with whom Vladimir Lifschitz had cooperation in various respects. The 39 contributions reflect the breadth and the depth of the work of Vladimir Lifschitz in logic programming, circumscription, default logic, action theory, causal reasoning and作者: 平躺 時(shí)間: 2025-3-24 14:21 作者: VAN 時(shí)間: 2025-3-24 17:54 作者: Inelasticity 時(shí)間: 2025-3-24 19:50 作者: evanescent 時(shí)間: 2025-3-25 03:05 作者: recede 時(shí)間: 2025-3-25 04:13
Wusheng Wang,Thomas T. Hildebrandtlicts with the agent’s knowledge; and so the agent must revise its knowledge. In particular, it is shown how an agent’s initial belief set may be propagated through an action sequence so that, in contrast to previous work, for a revision one does not need to refer back to the initial state of the agent.作者: beta-cells 時(shí)間: 2025-3-25 11:17
https://doi.org/10.1007/978-3-319-08260-8al rule bodies, general interpretations (also non-Herbrand interpretations) and aggregates. We also investigate the relationship with the equilibrium semantics of nested answer set programs, on the formal and the informal level.作者: 溝通 時(shí)間: 2025-3-25 15:30 作者: Counteract 時(shí)間: 2025-3-25 19:25 作者: harpsichord 時(shí)間: 2025-3-25 23:32 作者: 成績(jī)上升 時(shí)間: 2025-3-26 03:13
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs,al rule bodies, general interpretations (also non-Herbrand interpretations) and aggregates. We also investigate the relationship with the equilibrium semantics of nested answer set programs, on the formal and the informal level.作者: 阻擋 時(shí)間: 2025-3-26 06:22 作者: conspicuous 時(shí)間: 2025-3-26 09:03 作者: Relinquish 時(shí)間: 2025-3-26 14:02 作者: 聰明 時(shí)間: 2025-3-26 16:54 作者: 側(cè)面左右 時(shí)間: 2025-3-27 00:50 作者: 昏迷狀態(tài) 時(shí)間: 2025-3-27 03:14
To Vladimir Lifschitz on His 65th Birthday,rthday. In this article I describe some of the major contributions that Vladimir has made in his exceptional career. I provide background material about Vladimir in the Former Soviet Union (FSU), where he was born; discuss his beginning years in the United States (US); how I became aware of his rese作者: 思想上升 時(shí)間: 2025-3-27 07:53
,Vladimir Lifschitz — A Youth at 65,sity of Texas at Austin to work as his teaching assistant for the graduate course he was teaching on Mathematical Logic. When we met for the first time in his office, he explained what he was planning to cover during the semester, gave me the book that he was planning to teach from and asked me to s作者: Glossy 時(shí)間: 2025-3-27 10:29 作者: 失眠癥 時(shí)間: 2025-3-27 16:31
The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Applicati English sentences to formulas in an appropriate knowledge representation language. This paper focuses on a method to translate sentences to First-Order Logic (FOL). Our approach is inspired by Montague’s use of lambda calculus formulas to represent the meanings of words and phrases. Since our targe作者: Affable 時(shí)間: 2025-3-27 17:52
Parameterized Splitting: A Simple Modification-Based Approach,mantics can be split into two disjoint parts, a “bottom” part and a “top” part. The bottom part can be evaluated independently of the top part. Results of the evaluation, i.e., answer sets of the bottom part, are then used to simplify the top part. To obtain answer sets of the original program one s作者: SUGAR 時(shí)間: 2025-3-28 00:11 作者: Semblance 時(shí)間: 2025-3-28 02:30
Here and There among Logics for Logic Programming,imary representative. It will be shown, however, that there are other potential logics in the range. Still, all such logics are based on essentially the same semantics, so their differences are largely due to choice of the underlying language. Our representation suggests a more tolerant answer to th作者: 草率男 時(shí)間: 2025-3-28 09:38
Causal Logic Programming,ernative causes of each true atom. The syntax is extended by the simple addition of an optional reference label per each rule in the program. Then, the obtained causes rely on the concept of a .: an inverted tree of labels that keeps track of the ordered application of rules that has allowed derivin作者: daredevil 時(shí)間: 2025-3-28 11:33 作者: 相容 時(shí)間: 2025-3-28 16:23
Extending Action Language , by Formalizing Composite Actions,ble way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal theories. We implement the language by extending ., which translates caus作者: WAG 時(shí)間: 2025-3-28 20:27
Strong Equivalence of RASP Programs,rces. In this paper, we extend the concept of strong equivalence (which, as widely recognized, provides an important conceptual and practical tool for program simplification, transformation and optimization) from ASP to RASP programs and discuss its applicability, usefulness and implications in this作者: 袋鼠 時(shí)間: 2025-3-29 01:12
Considerations on Belief Revision in an Action Theory,ages, where an action language in turn is based on the underlying semantic notion of a transition system. Transition systems have been shown to be an elegant, deceptively simple, yet rich framework from which to address problems of action consequence, causality, planning and the like. In this paper 作者: Retrieval 時(shí)間: 2025-3-29 05:14 作者: Hemoptysis 時(shí)間: 2025-3-29 07:49 作者: Fester 時(shí)間: 2025-3-29 11:42
Simulating Production Rules Using ACTHEX,e and/or effect a change of the external environment in which they are situated, based on an operational semantics. . is a recent formalism extending . programs, such that the specification of declarative knowledge in the form of logic programming rules can be interleaved with a type of condition-ac作者: PLIC 時(shí)間: 2025-3-29 19:06
Applications of Action Languages in Cognitive Robotics,inuous geometric reasoning and high-level discrete causal reasoning; 2) embedding background/commonsense knowledge in high-level reasoning; 3) planning/prediction with complex (temporal) goals/constraints. We discuss how these challenges can be handled using computational methods of action languages作者: Iniquitous 時(shí)間: 2025-3-29 22:04
The Intelligent Grounder of ,ased on a variant of semi-naive evaluation, it also includes several advanced optimization techniques and supports a number of application-oriented features which allow for the successful exploitation of . in real-world contexts, also at an industrial level.作者: cumber 時(shí)間: 2025-3-30 02:10 作者: mendacity 時(shí)間: 2025-3-30 07:25
An Equational Approach to Logic Programming, logic program . as a template for generating a system of equations .(.), where the literals are considered variables ranging over the unit interval [0, 1], and where the solutions to the equations give us the logical meaning of the logic program. We show soundness of the equational approach with re作者: tackle 時(shí)間: 2025-3-30 12:07
https://doi.org/10.1007/978-3-642-30743-0approximate uniqueness; infon logic; modal logic; non-monotonic reasoning; production rules作者: GUILT 時(shí)間: 2025-3-30 15:05
978-3-642-30742-3Springer-Verlag Berlin Heidelberg 2012作者: stroke 時(shí)間: 2025-3-30 20:27 作者: Deject 時(shí)間: 2025-3-30 22:42
Just When You Thought You Could Bank on itsity of Texas at Austin to work as his teaching assistant for the graduate course he was teaching on Mathematical Logic. When we met for the first time in his office, he explained what he was planning to cover during the semester, gave me the book that he was planning to teach from and asked me to s作者: Gene408 時(shí)間: 2025-3-31 02:58 作者: 尊重 時(shí)間: 2025-3-31 06:56 作者: esculent 時(shí)間: 2025-3-31 12:00 作者: 闖入 時(shí)間: 2025-3-31 14:01
Igor Jugo,Dragutin Kermek,Ana Me?trovi?c of .. The . fragment of infon logic is amenable to linear time decision algorithms when policies and queries are ground. In the presence of policies with variables and implicit universal quantification, but no functions of positive arity, primal infon logic can be reduced to Datalog. We here prese作者: champaign 時(shí)間: 2025-3-31 18:06
Lecture Notes in Computer Scienceimary representative. It will be shown, however, that there are other potential logics in the range. Still, all such logics are based on essentially the same semantics, so their differences are largely due to choice of the underlying language. Our representation suggests a more tolerant answer to th作者: Arboreal 時(shí)間: 2025-4-1 00:54 作者: CARE 時(shí)間: 2025-4-1 05:42 作者: 施魔法 時(shí)間: 2025-4-1 07:02
Wusheng Wang,Thomas T. Hildebrandtble way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal theories. We implement the language by extending ., which translates caus作者: 知道 時(shí)間: 2025-4-1 11:54 作者: EXALT 時(shí)間: 2025-4-1 16:23
Wusheng Wang,Thomas T. Hildebrandtages, where an action language in turn is based on the underlying semantic notion of a transition system. Transition systems have been shown to be an elegant, deceptively simple, yet rich framework from which to address problems of action consequence, causality, planning and the like. In this paper 作者: 期滿 時(shí)間: 2025-4-1 20:20 作者: 很像弓] 時(shí)間: 2025-4-2 01:40
