標(biāo)題: Titlebook: Automated Reasoning; Second International David Basin,Micha?l Rusinowitch Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 200 [打印本頁(yè)] 作者: 抵押證書 時(shí)間: 2025-3-21 17:18
書目名稱Automated Reasoning影響因子(影響力)
書目名稱Automated Reasoning影響因子(影響力)學(xué)科排名
書目名稱Automated Reasoning網(wǎng)絡(luò)公開度
書目名稱Automated Reasoning網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automated Reasoning被引頻次
書目名稱Automated Reasoning被引頻次學(xué)科排名
書目名稱Automated Reasoning年度引用
書目名稱Automated Reasoning年度引用學(xué)科排名
書目名稱Automated Reasoning讀者反饋
書目名稱Automated Reasoning讀者反饋學(xué)科排名
作者: Nibble 時(shí)間: 2025-3-21 21:46
Marta Borda,Patrycja Kowalczyk-Rólczyńska transformed into an efficient interpreter. Furthermore, by using Maude’s breadth first search command, we also obtain for free a semi-decision procedure for finding failures of safety properties; and by using Maude’s LTL model checker, we obtain, also for free, a decision procedure for LTL properti作者: 顯示 時(shí)間: 2025-3-22 02:26
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools transformed into an efficient interpreter. Furthermore, by using Maude’s breadth first search command, we also obtain for free a semi-decision procedure for finding failures of safety properties; and by using Maude’s LTL model checker, we obtain, also for free, a decision procedure for LTL properti作者: lambaste 時(shí)間: 2025-3-22 08:34 作者: 創(chuàng)造性 時(shí)間: 2025-3-22 09:47 作者: 孵卵器 時(shí)間: 2025-3-22 16:11 作者: aristocracy 時(shí)間: 2025-3-22 19:30 作者: 我不明白 時(shí)間: 2025-3-22 23:32 作者: choroid 時(shí)間: 2025-3-23 04:24 作者: Malfunction 時(shí)間: 2025-3-23 06:09
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domainsof H?hnle . on multi-valued logics and Jeavons . on the algebraic approach to constraints. We view our work as a step toward a complete complexity classification of constraint satisfaction problems over finite domains.作者: 柔聲地說 時(shí)間: 2025-3-23 13:24 作者: 售穴 時(shí)間: 2025-3-23 15:59 作者: Inexorable 時(shí)間: 2025-3-23 19:34
Using Automated Theorem Provers to Certify Auto-generated Aerospace Softwaredividual simplification stages, which are implemented by rewriting, influence the ability of the ATPs to solve the proof tasks. Our results are based on 13 certification experiments that lead to more than 25,000 proof tasks which have each been attempted by Vampire, Spass, and e-setheo.作者: 高度贊揚(yáng) 時(shí)間: 2025-3-24 00:56 作者: CLEFT 時(shí)間: 2025-3-24 02:30
The Nature and Extent of Site Contamination,se and leads to significant speed-ups. The criterion uses a new sufficient test for the unsatisfiability of ordering constraints. The test runs in polynomial time, is easy to implement, and covers reduction orderings in a generic way, with possible extensions for LPO and KBO.作者: Kindle 時(shí)間: 2025-3-24 10:19
Conclusions and Recommendations,nd are a good target for optimisation. In this paper we present an efficient implementation technique for checking constraints in one of the most widely used simplification orderings, the Knuth-Bendix ordering. The technique is based on the idea of run-time algorithm specialisation, which is a close relative of partial evaluation.作者: 民間傳說 時(shí)間: 2025-3-24 13:59 作者: Licentious 時(shí)間: 2025-3-24 16:58
Global Aspects of Complex Geometryeasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and .-complete using an approach based on Büchi tree automata.作者: 不可救藥 時(shí)間: 2025-3-24 20:58 作者: Bureaucracy 時(shí)間: 2025-3-24 23:15
Efficient Checking of Term Ordering Constraintsnd are a good target for optimisation. In this paper we present an efficient implementation technique for checking constraints in one of the most widely used simplification orderings, the Knuth-Bendix ordering. The technique is based on the idea of run-time algorithm specialisation, which is a close relative of partial evaluation.作者: 滴注 時(shí)間: 2025-3-25 05:22
Second-Order Logic over Finite Structures – Report on a Research Programmeder logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.作者: Tartar 時(shí)間: 2025-3-25 10:03
PDL with Negation of Atomic Programseasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and .-complete using an approach based on Büchi tree automata.作者: FLAT 時(shí)間: 2025-3-25 12:19 作者: 柔軟 時(shí)間: 2025-3-25 16:47
Impacts of Global Warming on Arctic Biotap key protocol in a general way. By posing inductive conjectures about the trace of messages exchanged, we can investigate novel properties of the protocol, such as tolerance to disruption, and whether it results in agreement on a single key. This has allowed us to find three distinct novel attacks on groups of size two and three.作者: 大方一點(diǎn) 時(shí)間: 2025-3-25 21:17
Nabeel Khan Niazi,Irshad Bibi,Tariq Aftabs, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.作者: Melanoma 時(shí)間: 2025-3-26 02:17 作者: colloquial 時(shí)間: 2025-3-26 06:55
Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjecturesp key protocol in a general way. By posing inductive conjectures about the trace of messages exchanged, we can investigate novel properties of the protocol, such as tolerance to disruption, and whether it results in agreement on a single key. This has allowed us to find three distinct novel attacks on groups of size two and three.作者: laceration 時(shí)間: 2025-3-26 10:17 作者: 幸福愉悅感 時(shí)間: 2025-3-26 15:29
https://doi.org/10.1007/b110039lts..Our results can be applied as well to obtain a Knuth-Bendix completion procedure compatible with simplification techniques, which can be used for finding, whenever it exists, a convergent TRS for a given set of equations and a (possibly non-totalizable) reduction ordering.作者: 冷峻 時(shí)間: 2025-3-26 18:07
Mathilde Le Moullec,Morgan Lizabeth Bender whether the language has infinitely many constants and whether the theory has quantifiers. Our decision procedures for quantifier-free theories are based on Oppen’s algorithm for acyclic recursive data structures with infinite atom domain.作者: 世俗 時(shí)間: 2025-3-26 22:56
Richard H. Cushman,Larry M. Batesdividual simplification stages, which are implemented by rewriting, influence the ability of the ATPs to solve the proof tasks. Our results are based on 13 certification experiments that lead to more than 25,000 proof tasks which have each been attempted by Vampire, Spass, and e-setheo.作者: 相容 時(shí)間: 2025-3-27 03:47 作者: 珊瑚 時(shí)間: 2025-3-27 06:33
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Toolstools, can be the basis of powerful software analysis tools. Such tools can be obtained . from the semantic definitions; in our experience in just the few weeks required to define a language’s semantics even for large languages like Java. By combining, yet distinguishing, both equations and rules, r作者: 充氣球 時(shí)間: 2025-3-27 12:06
A Redundancy Criterion Based on Ground Reducibility by Ordered Rewritingtors saturating provers soon generate many similar equations, most of them are redundant. We present a new criterion that is specialized for the AC-case and leads to significant speed-ups. The criterion uses a new sufficient test for the unsatisfiability of ordering constraints. The test runs in pol作者: Fretful 時(shí)間: 2025-3-27 15:22 作者: limber 時(shí)間: 2025-3-27 19:52 作者: LEER 時(shí)間: 2025-3-27 22:45 作者: 愛得痛了 時(shí)間: 2025-3-28 05:04 作者: paleolithic 時(shí)間: 2025-3-28 08:33
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guardsn function, can be used to obtain a decision procedure for the guarded fragment with transitive guards. Another contribution of the paper is a special scheme notation, that allows to describe saturation strategies and show their correctness in a concise form.作者: KIN 時(shí)間: 2025-3-28 11:15
Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjecturesixed 2 or 3 party protocols may not be able to model a group protocol, or its intended security properties. Frequently, such tools require an abstraction to a group of fixed size to be made before the automated analysis takes place. This can prejudice chances of finding attacks on the protocol. In t作者: genuine 時(shí)間: 2025-3-28 15:37 作者: 訓(xùn)誡 時(shí)間: 2025-3-28 22:17 作者: 屈尊 時(shí)間: 2025-3-29 00:24
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modlogics—whose combination is not disjoint since they share the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other equational theories..In this paper, we present a n作者: 補(bǔ)助 時(shí)間: 2025-3-29 03:10
Using Automated Theorem Provers to Certify Auto-generated Aerospace Softwarey to generate proof obligations which are then processed by an automated first-order theorem prover (ATP). For full automation, however, the obligations must be aggressively preprocessed and simplified. We discuss the unique requirements this application places on the ATPs and demonstrate how the in作者: 纖細(xì) 時(shí)間: 2025-3-29 08:50 作者: 深淵 時(shí)間: 2025-3-29 13:20 作者: 剛開始 時(shí)間: 2025-3-29 16:43 作者: Euphonious 時(shí)間: 2025-3-29 22:29 作者: Solace 時(shí)間: 2025-3-30 03:53
PDL with Negation of Atomic Programs of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, as long-known, reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue tha作者: Enzyme 時(shí)間: 2025-3-30 07:52
Counter-Model Search in G?del-Dummett Logicses in bi-colored graphs and we propose a linear algorithm to detect r-cycles and build counter-models. Then we characterize the validity of formulae by the existence of r-cycles in boolean constrained graphs. We also give a parallel method to detect r-cycles under boolean constraints. Similar result作者: Nonporous 時(shí)間: 2025-3-30 09:54 作者: affluent 時(shí)間: 2025-3-30 12:58
978-3-540-22345-0Springer-Verlag Berlin Heidelberg 2004作者: audiologist 時(shí)間: 2025-3-30 16:42
Marta Borda,Patrycja Kowalczyk-Rólczyńskatools, can be the basis of powerful software analysis tools. Such tools can be obtained . from the semantic definitions; in our experience in just the few weeks required to define a language’s semantics even for large languages like Java. By combining, yet distinguishing, both equations and rules, r作者: Genetics 時(shí)間: 2025-3-30 21:16 作者: 真繁榮 時(shí)間: 2025-3-31 01:07
Conclusions and Recommendations,quires checking simple ordering constraints on substitutions as an essential part of many operations. Due to their frequency, such checks are costly and are a good target for optimisation. In this paper we present an efficient implementation technique for checking constraints in one of the most wide作者: 膽小懦夫 時(shí)間: 2025-3-31 05:18 作者: nonsensical 時(shí)間: 2025-3-31 12:29 作者: Tortuous 時(shí)間: 2025-3-31 13:25
https://doi.org/10.1007/b110039only implied the compatibility with too weak redundancy notions and, in particular, demodulation could not be applied at all..In this paper, we present a complete ordered paramodulation calculus compatible with powerful redundancy notions including demodulation, which strictly improves previous resu作者: parallelism 時(shí)間: 2025-3-31 19:34 作者: 敏捷 時(shí)間: 2025-3-31 21:46 作者: Graphite 時(shí)間: 2025-4-1 03:46 作者: 陪審團(tuán)每個(gè)人 時(shí)間: 2025-4-1 07:08
Pollution and Monitoring in the Arctic means that inferences are pure, only involving clauses over the alphabet of either one, but not both, of the theories. The calculus is shown to be complete provided that functions that are not in the intersection of the component signatures are declared as partial. This result also means that if th作者: Gene408 時(shí)間: 2025-4-1 11:25 作者: ANNUL 時(shí)間: 2025-4-1 18:14
Richard H. Cushman,Larry M. Batesy to generate proof obligations which are then processed by an automated first-order theorem prover (ATP). For full automation, however, the obligations must be aggressively preprocessed and simplified. We discuss the unique requirements this application places on the ATPs and demonstrate how the in
