用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic Programming and Nonmonotonic Reasoning; 5th International Co Michael Gelfond,Nicola Leone,Gerald Pfeifer Conference proceedings 1999

[复制链接]
查看: 55032|回复: 63
发表于 2025-3-21 17:56:52 | 显示全部楼层 |阅读模式
书目名称Logic Programming and Nonmonotonic Reasoning
副标题5th International Co
编辑Michael Gelfond,Nicola Leone,Gerald Pfeifer
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Logic Programming and Nonmonotonic Reasoning; 5th International Co Michael Gelfond,Nicola Leone,Gerald Pfeifer Conference proceedings 1999
出版日期Conference proceedings 1999
关键词Automated Deduction; Constraint Programming; Logic Programming; Nonclassical Logics; Nonmonotonic Reason
版次1
doihttps://doi.org/10.1007/3-540-46767-X
isbn_softcover978-3-540-66749-0
isbn_ebook978-3-540-46767-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1999
The information of publication is updating

书目名称Logic Programming and Nonmonotonic Reasoning影响因子(影响力)




书目名称Logic Programming and Nonmonotonic Reasoning影响因子(影响力)学科排名




书目名称Logic Programming and Nonmonotonic Reasoning网络公开度




书目名称Logic Programming and Nonmonotonic Reasoning网络公开度学科排名




书目名称Logic Programming and Nonmonotonic Reasoning被引频次




书目名称Logic Programming and Nonmonotonic Reasoning被引频次学科排名




书目名称Logic Programming and Nonmonotonic Reasoning年度引用




书目名称Logic Programming and Nonmonotonic Reasoning年度引用学科排名




书目名称Logic Programming and Nonmonotonic Reasoning读者反馈




书目名称Logic Programming and Nonmonotonic Reasoning读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:14:42 | 显示全部楼层
Belief, Knowledge, Revisions, and a Semantics of Non-Monotonic Reasoningerefore they enable to define a semantics of insertions to and revisions of AELKB-theories. A computation of the transformations (between possible worlds) is based on (an enhanced) model-checking. The transformations may be used as a method of computing static autoepistemic expansions.
发表于 2025-3-22 02:40:34 | 显示全部楼层
From Causal Theories to Logic Programs (Sometimes) to the one given in [.,.]. Our main result is a theorem that shows how action precondition and fully instantiated successor state axioms can be computed from the answer sets of the translated logic program.
发表于 2025-3-22 04:52:50 | 显示全部楼层
Pushing Goal Derivation in DLP Computationsg and diagnosis, or implicitly in the form of integrity constraints). This way, a lot of useless models are discarded “a priori” and the computation converges rapidly toward the generation of the “right” answer set. A few preliminary benchmarks show dramatic efficiency gains due to the new techniques.
发表于 2025-3-22 10:30:40 | 显示全部楼层
发表于 2025-3-22 16:14:33 | 显示全部楼层
On the Role of Negation in Choice Logic Programsa program. Based on an intuitive notion of unfounded set for choice programs, we show that several results from (seminegative) disjunctive programs can be strengthened; characterizing the position of choice programs as an intermediate between simple positive programs and programs that allow for the explicit use of negation in the body of a rule.
发表于 2025-3-22 19:28:14 | 显示全部楼层
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoningt circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.
发表于 2025-3-22 21:20:40 | 显示全部楼层
Annotated Revision Programsn of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the case of annotated revision programs.
发表于 2025-3-23 03:50:12 | 显示全部楼层
Linear Tabulated Resolution for the Well-Founded Semanticsemantics, which resolves the problems of infinite loops and redundant computations while preserving the linearity. For non-floundering queries, the proposed method is sound and complete for general logic programs with the bounded-term-size property.
发表于 2025-3-23 07:24:34 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-10 11:58
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表