標題: Titlebook: Automated Reasoning; 5th International Jo Jürgen Giesl,Reiner H?hnle Conference proceedings 2010 The Editor(s) (if applicable) and The Auth [打印本頁] 作者: firearm 時間: 2025-3-21 16:05
書目名稱Automated Reasoning影響因子(影響力)
書目名稱Automated Reasoning影響因子(影響力)學科排名
書目名稱Automated Reasoning網(wǎng)絡公開度
書目名稱Automated Reasoning網(wǎng)絡公開度學科排名
書目名稱Automated Reasoning被引頻次
書目名稱Automated Reasoning被引頻次學科排名
書目名稱Automated Reasoning年度引用
書目名稱Automated Reasoning年度引用學科排名
書目名稱Automated Reasoning讀者反饋
書目名稱Automated Reasoning讀者反饋學科排名
作者: deviate 時間: 2025-3-21 21:52 作者: 乞丐 時間: 2025-3-22 02:51 作者: prostate-gland 時間: 2025-3-22 07:55 作者: DOTE 時間: 2025-3-22 11:51
Global Caching for Coalgebraic Description Logicsntics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal c作者: 凹室 時間: 2025-3-22 13:41 作者: Carcinoma 時間: 2025-3-22 21:00
Analytic Tableaux for Higher-Order Logic with Choicerds supporting automated reasoning in the presence of a choice operator, we present a cut-free ground tableau calculus for Church’s simple type theory with choice. The tableau calculus is designed with automated search in mind. In particular, the rules only operate on the top level structure of form作者: 除草劑 時間: 2025-3-22 23:32
Monotonicity Inference for Higher-Order Formulasains. Monotonicity is undecidable in general, but we devised two calculi that infer it in many cases for higher-order logic. The stronger calculus has been implemented in Isabelle’s model finder Nitpick, where it is used to prune the search space, leading to dramatic speed improvements for formulas 作者: 成績上升 時間: 2025-3-23 01:56
Sledgehammer: Judgement Dayder logic E, SPASS and Vampire. This paper is the largest and most detailed empirical evaluation of such a link to date. Our test data consists of 1240 proof goals arising in 7 diverse Isabelle theories, thus representing typical Isabelle proof obligations. We measure the effectiveness of Sledgehamm作者: 哪有黃油 時間: 2025-3-23 06:24 作者: Predigest 時間: 2025-3-23 12:33
Verifying Safety Properties with the TLA?+? Proof Systemd understanding proofs requires little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. Proofs are written in the same language as specifications; engineers do 作者: Dignant 時間: 2025-3-23 14:42
MUNCH - Automated Reasoner for Sets and Multisets expressions about sets, multisets, and integers. Constraints over collections and integers are connected using the cardinality operator. Our logic is a fragment of logics of popular interactive theorem provers, and MUNCH is the first fully automated reasoner for this logic. MUNCH reduces input form作者: Valves 時間: 2025-3-23 18:57 作者: FIR 時間: 2025-3-24 00:18 作者: 該得 時間: 2025-3-24 04:47 作者: 迅速飛過 時間: 2025-3-24 08:32 作者: Cytokines 時間: 2025-3-24 13:43 作者: 荒唐 時間: 2025-3-24 15:35 作者: Adherent 時間: 2025-3-24 21:19
Joseph Mark Drosdeck,Samer G. Mattarand explicit type tests. We develop a custom decision procedure for queries in a theory of . and show that the procedure is sound and complete, has low complexity, and is amenable to integration into an SMT framework. We present an empirical evaluation that demonstrates the speed and robustness of our procedure relative to Z3.作者: 乏味 時間: 2025-3-25 03:09
MCMT: A Model Checker Modulo Theoriess for quantifier instantiation, specifically tailored to model checking, are at the very heart of the system. . has been successfully applied to the verification of imperative programs, parametrised, timed, and distributed systems.作者: labyrinth 時間: 2025-3-25 04:25 作者: FELON 時間: 2025-3-25 09:35 作者: 匯總 時間: 2025-3-25 15:19 作者: 衣服 時間: 2025-3-25 16:31 作者: MOAT 時間: 2025-3-25 23:56 作者: condemn 時間: 2025-3-26 01:47 作者: 提升 時間: 2025-3-26 06:07 作者: 解決 時間: 2025-3-26 08:47 作者: osculate 時間: 2025-3-26 12:37 作者: 愚笨 時間: 2025-3-26 16:59 作者: Bone-Scan 時間: 2025-3-26 23:30
Global Banking Crises and Emerging Marketshecking the validity of logic formulas, in a suitable form for a large class of provers including SMT solvers and interactive proof assistants. Experiments using the Frama-C platform for static analysis of C code are presented.作者: Retrieval 時間: 2025-3-27 01:23 作者: 上流社會 時間: 2025-3-27 08:34
Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculusmall-step reduction semantics suitable for efficient implementation. We prove that subject reduction, confluence, and termination holds. All theorems have been formally verified in the Twelf proof assistant.作者: PSA-velocity 時間: 2025-3-27 13:00 作者: Factorable 時間: 2025-3-27 17:24
Sledgehammer: Judgement Day0 proof goals arising in 7 diverse Isabelle theories, thus representing typical Isabelle proof obligations. We measure the effectiveness of Sledgehammer and many other parameters such as run time and complexity of proofs. A facility for minimizing the number of facts needed to prove a goal is presented and analyzed.作者: 蟄伏 時間: 2025-3-27 20:46
Multi-Prover Verification of Floating-Point Programshecking the validity of logic formulas, in a suitable form for a large class of provers including SMT solvers and interactive proof assistants. Experiments using the Frama-C platform for static analysis of C code are presented.作者: addict 時間: 2025-3-28 00:37 作者: indenture 時間: 2025-3-28 04:03 作者: Inoperable 時間: 2025-3-28 08:22
Kriengkrai Techakanont,Sittisak Leelahanonulas. Additionally, we restrict the instantiation terms for quantifiers to a universe that depends on the current branch. At base types the universe of instantiations is finite. We prove completeness of the tableau calculus relative to Henkin models.作者: coltish 時間: 2025-3-28 12:15 作者: nostrum 時間: 2025-3-28 15:58 作者: Ethics 時間: 2025-3-28 22:44
Michael Keller,Pamela A. Matsonions, and preservation and progress for various ML-like languages. We also implemented proofs of structural properties of expressions and paths in expressions. Stating these properties requires nesting of quantifiers and implications, demonstrating the expressive power of Beluga.作者: JAMB 時間: 2025-3-29 02:31 作者: 可忽略 時間: 2025-3-29 04:21
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)ions, and preservation and progress for various ML-like languages. We also implemented proofs of structural properties of expressions and paths in expressions. Stating these properties requires nesting of quantifiers and implications, demonstrating the expressive power of Beluga.作者: 津貼 時間: 2025-3-29 08:22
Tractable Extensions of the Description Logic , with Numerical Datatypesppear only on the left-hand side of the axioms. To this end, we introduce a notion of safety for a numerical datatype with restrictions (NDR) which guarantees tractability, extend the . reasoning algorithm to these cases, and provide a complete classification of safe NDRs for natural numbers, integers, rationals and reals.作者: 爭議的蘋果 時間: 2025-3-29 12:45 作者: dominant 時間: 2025-3-29 18:03
Hierarchical Reasoning for the Verification of Parametric Systemsused for modeling such systems and the reasoning tasks which need to be solved in this context. We identify properties of the underlying theories which ensure that these classes of verification problems can be solved efficiently, give examples of theories with the desired properties, and illustrate the methods we use on several examples.作者: defendant 時間: 2025-3-29 21:44 作者: 敲詐 時間: 2025-3-30 00:56 作者: AVID 時間: 2025-3-30 05:57 作者: growth-factor 時間: 2025-3-30 08:39 作者: 脆弱帶來 時間: 2025-3-30 14:19
Afshan Jafar,Erynn Masi Casanova. is a toolbox for representing, learning, and automated reasoning with various approaches combining relational first-order logic with probabilities. We give a brief overview of the . system and its automated reasoning facilities.作者: 名義上 時間: 2025-3-30 19:31 作者: 防御 時間: 2025-3-30 22:51 作者: heterogeneous 時間: 2025-3-31 01:49 作者: 極大痛苦 時間: 2025-3-31 07:47
Automated Reasoning978-3-642-14203-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使痛苦 時間: 2025-3-31 12:23 作者: 自戀 時間: 2025-3-31 13:49 作者: 菊花 時間: 2025-3-31 20:22
Joseph Mark Drosdeck,Samer G. Mattarnumber of applications, such as invariant generation and computing interpolants. This tool paper describes how such proofs and interpolant generation are implemented in the first-order theorem prover Vampire.作者: ANTH 時間: 2025-3-31 21:48 作者: cylinder 時間: 2025-4-1 02:06 作者: malapropism 時間: 2025-4-1 08:23
Global Atmospheric-Biospheric Chemistryys. Theories specify the properties of the indexes and the elements of the arrays. Sets of states and transitions of a system are described by quantified first-order formulae. The core of the system is a backward reachability procedure which symbolically computes pre-images of the set of unsafe stat作者: somnambulism 時間: 2025-4-1 14:02 作者: left-ventricle 時間: 2025-4-1 15:43
https://doi.org/10.1057/9781137516145ntics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal c作者: 描述 時間: 2025-4-1 21:14 作者: deforestation 時間: 2025-4-2 01:35 作者: labile 時間: 2025-4-2 06:09
https://doi.org/10.1057/9781137516176ains. Monotonicity is undecidable in general, but we devised two calculi that infer it in many cases for higher-order logic. The stronger calculus has been implemented in Isabelle’s model finder Nitpick, where it is used to prune the search space, leading to dramatic speed improvements for formulas
