找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

掃一掃，訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Logic for Programming, Artificial Intelligence, and Reasoning; 18th International C Nikolaj Bj?rner,Andrei Voronkov Conference proceedings

[復(fù)制鏈接]
查看: 24279|回復(fù): 61
樓主
發(fā)表于 2025-3-21 18:19:36 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning
副標(biāo)題18th International C
編輯Nikolaj Bj?rner,Andrei Voronkov
視頻videohttp://file.papertrans.cn/589/588016/588016.mp4
概述Up-to-date results.Fast-track conference proceedings.State-of-the-art research
叢書(shū)名稱(chēng)Lecture Notes in Computer Science
圖書(shū)封面Titlebook: Logic for Programming, Artificial Intelligence, and Reasoning; 18th International C Nikolaj Bj?rner,Andrei Voronkov Conference proceedings
描述This book constitutes the proceedings of the 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-18, held in Merida, Venezuela, in March 2012. The 25 regular papers and 6 tool descriptions and experimental papers presented were carefully reviewed and selected from 74submissions.The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world.
出版日期Conference proceedings 2012
關(guān)鍵詞artificial intelligence; constraint programming; description logics; resource analysis of programs; soft
版次1
doihttps://doi.org/10.1007/978-3-642-28717-6
isbn_softcover978-3-642-28716-9
isbn_ebook978-3-642-28717-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning影響因子(影響力)




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning被引頻次




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning被引頻次學(xué)科排名




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning年度引用




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning年度引用學(xué)科排名




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning讀者反饋




書(shū)目名稱(chēng)Logic for Programming, Artificial Intelligence, and Reasoning讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶(hù)組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:20:06 | 只看該作者
Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning, Such results, however, measure the complexity of a logic .. For example, reasoning in the basic DL . is E.T.-complete, which means that . constructors can be used in a way so that exponential time is strictly required for solving a reasoning problem. It is, however, well known that, given two . kno
板凳
發(fā)表于 2025-3-22 02:19:12 | 只看該作者
地板
發(fā)表于 2025-3-22 05:07:55 | 只看該作者
5#
發(fā)表于 2025-3-22 09:28:06 | 只看該作者
6#
發(fā)表于 2025-3-22 15:33:32 | 只看該作者
7#
發(fā)表于 2025-3-22 20:36:25 | 只看該作者
Backward Trace Slicing for Conditional Rewrite Theories, rewrite theories that may contain conditional equations and/or rules. Given a conditional execution trace . and a slicing criterion for the trace (i.e., a set of positions that we want to observe in the final state of the trace), we traverse . from back to front, and at each rewrite step, we increm
8#
發(fā)表于 2025-3-23 00:02:49 | 只看該作者
9#
發(fā)表于 2025-3-23 01:39:15 | 只看該作者
Querying Proofs,tructure using hierarchical nested labelled trees. The core language presented in this paper is ., with queries built using recursion and patterns over proof structure and rule names. We define the syntax and semantics of locally structured queries, demonstrate their power, and sketch some implement
10#
發(fā)表于 2025-3-23 08:12:30 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 21:38
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
卓资县| 兴化市| 同德县| 玉溪市| 越西县| 普陀区| 巫溪县| 丘北县| 吉木乃县| 义乌市| 平武县| 新源县| 屏东市| 宝坻区| 合水县| 布拖县| 清流县| 嵊州市| 克什克腾旗| 新兴县| 许昌市| 容城县| 韶关市| 德昌县| 温宿县| 溆浦县| 乌拉特前旗| 双流县| 扶风县| 林西县| 嘉禾县| 吕梁市| 光泽县| 汉寿县| 当雄县| 平凉市| 肥西县| 灵宝市| 珲春市| 白河县| 芮城县|