標題: Titlebook: Automated Reasoning; First International Rajeev Goré,Alexander Leitsch,Tobias Nipkow Conference proceedings 2001 Springer-Verlag Berlin He [打印本頁] 作者: 一再 時間: 2025-3-21 18:50
書目名稱Automated Reasoning影響因子(影響力)
書目名稱Automated Reasoning影響因子(影響力)學科排名
書目名稱Automated Reasoning網(wǎng)絡公開度
書目名稱Automated Reasoning網(wǎng)絡公開度學科排名
書目名稱Automated Reasoning被引頻次
書目名稱Automated Reasoning被引頻次學科排名
書目名稱Automated Reasoning年度引用
書目名稱Automated Reasoning年度引用學科排名
書目名稱Automated Reasoning讀者反饋
書目名稱Automated Reasoning讀者反饋學科排名
作者: 話 時間: 2025-3-21 21:49 作者: 尋找 時間: 2025-3-22 01:22 作者: BUST 時間: 2025-3-22 04:42
The Description Logic ,,, Extended with Concrete Domains: A Practically Motivated Approachestrictions, role hierarchies, transitively closed roles, generalized concept inclusions, and concrete domains. As in other languages based on concrete domains (e.g. . a so-called existential predicate restriction is provided. However, compared to . only features and no feature chains are allowed in作者: mendacity 時間: 2025-3-22 11:26 作者: Lignans 時間: 2025-3-22 16:25
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logicsnd ABox reasoning for the description logics ALCNH.. and ALC(D). The advances are demonstrated by an empirical analysis using the description logic system RACE that implmenets TBox and ABox reasoning for ALCNH...作者: Gnrh670 時間: 2025-3-22 19:47
The Hybrid μ-Calculusevising a new, highly expressive ExpTime logic. The decision procedure is based on tree automata, and makes explicit the problems caused by nominals and how to overcome them. Roughly speaking, we show how to reason in a logic lacking the tree model property using techniques for logics with the tree 作者: obtuse 時間: 2025-3-23 00:16 作者: 射手座 時間: 2025-3-23 02:21
Tableaux for Temporal Description Logic with Constant DomainsPTL (with the temporal operators ‘next-time’ and ‘until’) in order to design a terminating sound and complete tableau- based satisfiability-checking algorithm for the temporal description logic PTL. of [.] interpreted in models with constant domains. We use the method of quasimodels [.,.] to represe作者: Control-Group 時間: 2025-3-23 07:36 作者: Nebulizer 時間: 2025-3-23 10:14
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作者: 歪曲道理 時間: 2025-3-23 15:37 作者: 橫條 時間: 2025-3-23 21:21
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 作者: Emasculate 時間: 2025-3-24 00:38
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作者: 允許 時間: 2025-3-24 02:53
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.作者: 增強 時間: 2025-3-24 06:52
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 作者: Classify 時間: 2025-3-24 14:28
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作者: Coma704 時間: 2025-3-24 15:32
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作者: mastopexy 時間: 2025-3-24 19:26
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.作者: Gyrate 時間: 2025-3-24 23:10
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.作者: 平 時間: 2025-3-25 05:35
Tableaux for Temporal Description Logic with Constant Domainsnt models with in finite domains, and the technique of minimal types [.] to maintain these domains constant. The combination is flexible and can be extended to more expressive description logics or even to decidable fragments of first-order temporal logics.作者: eardrum 時間: 2025-3-25 10:07
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designatby “standard” (non-prefixed, non-annotated) ground tableau calculi. The calculi are extended so as to deal also with non-rigid designation, by means of a simple numerical annotation on functional symbols, conveying some semantical information about the worlds where they are meant to be interpreted.作者: Eosinophils 時間: 2025-3-25 15:20 作者: FOLLY 時間: 2025-3-25 15:51 作者: 出生 時間: 2025-3-25 20:05
The Peasant Way, Through Food Sovereigntynt models with in finite domains, and the technique of minimal types [.] to maintain these domains constant. The combination is flexible and can be extended to more expressive description logics or even to decidable fragments of first-order temporal logics.作者: 四指套 時間: 2025-3-26 00:29 作者: Forage飼料 時間: 2025-3-26 07:09 作者: 有權威 時間: 2025-3-26 08:29 作者: AMEND 時間: 2025-3-26 13:07
The World Adapting to Climate Change, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e. g., the rational numbers within a first-order theorem prover.作者: macrophage 時間: 2025-3-26 19:18
EU and Global Administrative Organizationsused in first-order theorem proving are matching, generalization, unifiability, and syntactic equality. Such a retrieval of candidate terms in theorem proving is interleaved with insertion of terms to ., and deletion of them from ..作者: 自制 時間: 2025-3-26 23:49
The Hybrid μ-Calculusnd how to overcome them. Roughly speaking, we show how to reason in a logic lacking the tree model property using techniques for logics with the tree model property. The contribution of the paper is two-fold: we extend the family of ExpTime logics, and we present a technique to reason in the presence of nominals.作者: cardiovascular 時間: 2025-3-27 04:55
NP-Completeness of Refutability by Literal-Once Resolution that despite of the weakness of literal–once resolution, the recognition of CNF-formulas which are refutable by literal–once resolution is NP–complete. We study the relationship between literal–once resolution and . (introduced by Iwama and Miyano). Further we answer a question posed by Kullmann related to minimal unsatisfiability.作者: 貪婪地吃 時間: 2025-3-27 06:24
Superposition and Chaining for Totally Ordered Divisible Abelian Groups it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e. g., the rational numbers within a first-order theorem prover.作者: maudtin 時間: 2025-3-27 11:48 作者: Focus-Words 時間: 2025-3-27 16:14
Three-Stage Commitment Buildingle seems simpler, more general and more automatic than other work in the literature: lexicographic orders, mutually recursive function calls and permuted arguments are all handled ., with no need for human-supplied argument orders, or theorem-proving search methods not certain to terminate at analysis time.作者: 污穢 時間: 2025-3-27 20:15
https://doi.org/10.1057/9780230523746 example, each message typically includes a .: a freshly-generated number that the other party must include in his response; the first party then knows that the response was not an old message replayed by an intruder. Many flaws have been discovered in security protocols [.].作者: 正論 時間: 2025-3-28 01:37 作者: agenda 時間: 2025-3-28 05:51 作者: fluffy 時間: 2025-3-28 09:59 作者: 專橫 時間: 2025-3-28 12:11 作者: 樣式 時間: 2025-3-28 17:47 作者: 幾何學家 時間: 2025-3-28 20:43 作者: Somber 時間: 2025-3-29 01:02 作者: 門窗的側柱 時間: 2025-3-29 03:45
0302-9743 Overview: Includes supplementary material: 978-3-540-42254-9978-3-540-45744-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 油膏 時間: 2025-3-29 07:47
Organizing for the 21st century, for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly overview other works related to algorithms and data structures, and to efficient theorem proving in general.作者: 前奏曲 時間: 2025-3-29 12:17 作者: 會犯錯誤 時間: 2025-3-29 15:35 作者: 情感 時間: 2025-3-29 22:19 作者: 預定 時間: 2025-3-30 03:16 作者: HERE 時間: 2025-3-30 05:20
Rajeev Goré,Alexander Leitsch,Tobias NipkowIncludes supplementary material: 作者: 低三下四之人 時間: 2025-3-30 08:54
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166319.jpg作者: Accrue 時間: 2025-3-30 16:06 作者: LEVY 時間: 2025-3-30 18:49 作者: 拱形面包 時間: 2025-3-30 21:02 作者: 客觀 時間: 2025-3-31 04:51 作者: 創(chuàng)造性 時間: 2025-3-31 09:04
Organizing for the 21st century, for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly overview other works related to algorithms and data structures, and to efficient theorem proving in general.作者: Congruous 時間: 2025-3-31 09:22 作者: acrophobia 時間: 2025-3-31 14:19
Matthew Breay Bolton,Elizabeth Minore properties” of objects such as sizes, weights, and durations. It is known that reasoning with ., the basic DL admitting concrete domains, is PSpace-complete. In this paper, it is shown that the upper bound is not robust: we give three examples for seemingly harmless extensions of .—namely acyclic
