找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Automated Reasoning; First International Rajeev Goré,Alexander Leitsch,Tobias Nipkow Conference proceedings 2001 Springer-Verlag Berlin He

[復制鏈接]
樓主: 一再
11#
發(fā)表于 2025-3-23 10:14:30 | 只看該作者
Instructing Equational Set-Reasoning with Otter within the ground formalism .developed by Tarski and Givant. On top of a kernel axiomatization of map algebra we develop a layered formalization of basic set-theoretical concepts. A first-order theorem prover is exploited to obtain automated certification and validation of this layered architecture
12#
發(fā)表于 2025-3-23 15:37:55 | 只看該作者
13#
發(fā)表于 2025-3-23 21:21:42 | 只看該作者
Ordered Resolution vs. Connection Graph resolutionxpected unrestricted connection graph (cg) resolution to be strongly complete until Eisinger proved that it was not. In this paper, ordered resolution is shown to be a special case of cg-resolution, and that relationship is used to prove that ordered cg-resolution is strongly complete. On the other
14#
發(fā)表于 2025-3-24 00:38:01 | 只看該作者
A Model-Based Completeness Proof of Extended Narrowing and Resolutioncontext of Theorem Proving Modulo. ENAR integrates narrowing with respect to a set of rewrite rules on propositions into automated first-order theorem proving by resolution. Our proof allows to impose ordering restrictions on ENAR and provides general redundancy criteria, which are crucial for findi
15#
發(fā)表于 2025-3-24 02:53:11 | 只看該作者
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equalitycontain at most two variables. This paper shows how resolution theorem-proving techniques can be used to provide an algorithm for deciding whether any given formula in .is satisfiable. Previous resolution-based techniques could deal only with the equality-free subset .of the two-variable fragment.
16#
發(fā)表于 2025-3-24 06:52:00 | 只看該作者
Superposition and Chaining for Totally Ordered Divisible Abelian Groupsprevious superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way
17#
發(fā)表于 2025-3-24 14:28:00 | 只看該作者
Context Treess where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared. Here we describe a new indexing data structure, called context trees, where, by means of a limited kind of context variables, also co
18#
發(fā)表于 2025-3-24 15:32:14 | 只看該作者
On the Evaluation of Indexing Techniques for Theorem Provinglled the .), identify the subset . of . that consists of the terms . such that . holds. Terms in M will be called the .. Typical retrieval conditions used in first-order theorem proving are matching, generalization, unifiability, and syntactic equality. Such a retrieval of candidate terms in theorem
19#
發(fā)表于 2025-3-24 19:26:52 | 只看該作者
The Description Logic ,,, Extended with Concrete Domains: A Practically Motivated Approach this operator. This results in a limited expressivity w.r.t. concrete domains but is required to ensure the decidability of the language. We show that the results can be exploited for building practical description logic systems for solving e.g. configuration problems.
20#
發(fā)表于 2025-3-24 23:10:45 | 只看該作者
NExpTime-Complete Description Logics with Concrete DomainsTBoxes, inverse roles, and a role-forming concrete domain constructor—that make reasoning NExpTime-hard. As a corresponding upper bound, we show that reasoning with all three extensions . is in NExpTime.
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-16 21:07
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
香河县| 隆昌县| 海丰县| 闵行区| 洪湖市| 天津市| 海兴县| 旬阳县| 嘉善县| 金沙县| 井陉县| 古田县| 香格里拉县| 新兴县| 南郑县| 阿拉善左旗| 华阴市| 嘉善县| 黄石市| 长岛县| 彭山县| 林周县| 乐陵市| 栖霞市| 如皋市| 呼玛县| 五河县| 嵊州市| 拜城县| 安图县| 高阳县| 贵南县| 喀什市| 封丘县| 太谷县| 海晏县| 峨眉山市| 梧州市| 周至县| 永年县| 华容县|