作者: DOLT 時(shí)間: 2025-3-21 22:56
An SMT Theory of Fixed-Point Arithmeticgrams relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive 作者: Hippocampus 時(shí)間: 2025-3-22 02:08 作者: amorphous 時(shí)間: 2025-3-22 06:07
The Resolution of Keller’s Conjecturest one of the graphs contains a clique of size .. We present an automated method to solve this conjecture by encoding the existence of such a clique as a propositional formula. We apply satisfiability solving combined with symmetry-breaking techniques to determine that no such clique exists. This re作者: Observe 時(shí)間: 2025-3-22 11:43
How QBF Expansion Makes Strategy Extraction Hardynomial time strategy extraction unless P=PSPACE. In our proof, the crucial property that makes strategy extraction PSPACE-hard for this proof format is universal expansion, even expansion on a single variable..While expansion reasoning used in other QBF calculi can admit polynomial time strategy ex作者: foreign 時(shí)間: 2025-3-22 16:51
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicatespropose a new technique for transforming CHCs with ADTs into CHCs where predicates are defined over basic types, such as integers and booleans, only. Thus, our technique avoids the explicit use of inductive proof rules during satisfiability proofs. The main extension over previous techniques for ADT作者: EXULT 時(shí)間: 2025-3-22 20:07
Solving Bitvectors with MCSAT: Explanations from Bits and Piecesd can be seen as an extension of CDCL to domains other than the Booleans. Our procedure uses BDDs to record and update the sets of feasible values of bitvector variables. For explaining conflicts and propagations, we develop specialized word-level interpolation for two common fragments of the theory作者: Compass 時(shí)間: 2025-3-22 22:49 作者: Awning 時(shí)間: 2025-3-23 02:13 作者: 美食家 時(shí)間: 2025-3-23 07:46 作者: elucidate 時(shí)間: 2025-3-23 11:23
Combined Covers and Beth Definabilitynted out in the literature. A successive parallel research line inside the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. In this paper, we investigate cover transfer to theory combinations in the disjoint 作者: 無(wú)脊椎 時(shí)間: 2025-3-23 14:27 作者: Paleontology 時(shí)間: 2025-3-23 20:13 作者: overreach 時(shí)間: 2025-3-24 00:43 作者: 暫時(shí)休息 時(shí)間: 2025-3-24 05:59
A Knuth-Bendix-Like Ordering for Orienting Combinator Equationse resultant ordering is highly suited to parameterising the first-order superposition calculus when dealing with the theory of higher-order logic, as it prevents inferences between the combinator axioms. We prove a number of desirable properties about the ordering including it having the subterm pro作者: Modify 時(shí)間: 2025-3-24 08:57 作者: 進(jìn)入 時(shí)間: 2025-3-24 13:25 作者: 召集 時(shí)間: 2025-3-24 17:38 作者: ANTI 時(shí)間: 2025-3-24 20:39
The Resolution of Keller’s Conjecturesult implies that every unit cube tiling of . contains a facesharing pair of cubes. Since a faceshare-free unit cube tiling of . exists (which we also verify), this completely resolves Keller’s conjecture.作者: tariff 時(shí)間: 2025-3-25 00:57
How QBF Expansion Makes Strategy Extraction Hardtraction, we find this is conditional on a property studied in proof complexity theory. We show that strategy extraction on expansion based systems can only happen when the underlying propositional calculus has the property of feasible interpolation.作者: 晚間 時(shí)間: 2025-3-25 06:49 作者: 減至最低 時(shí)間: 2025-3-25 08:39
A Decision Procedure for String to Code Point Conversiontion. We describe our implementation of this approach in the SMT solver CVC4, which contains a high-performance string subsolver, and show that the use of a native procedure for code points significantly improves its performance with respect to other state-of-the-art string solvers.作者: Instrumental 時(shí)間: 2025-3-25 11:51 作者: Foregery 時(shí)間: 2025-3-25 18:51 作者: anagen 時(shí)間: 2025-3-25 22:28 作者: 亞當(dāng)心理陰影 時(shí)間: 2025-3-26 02:38 作者: Metastasis 時(shí)間: 2025-3-26 04:27 作者: 殺菌劑 時(shí)間: 2025-3-26 12:13
Larry Purnell Ph.D., R.N., FAANtion. We describe our implementation of this approach in the SMT solver CVC4, which contains a high-performance string subsolver, and show that the use of a native procedure for code points significantly improves its performance with respect to other state-of-the-art string solvers.作者: 憤怒事實(shí) 時(shí)間: 2025-3-26 16:16
https://doi.org/10.1007/978-1-4614-5950-7ther arbitrary disjoint theories using polite combination. Our results cover both inductive and finite datatypes, as well as their union. The combination method uses a new, simple, and natural notion of additivity, that enables deducing strong politeness from (weak) politeness.作者: esoteric 時(shí)間: 2025-3-26 19:16 作者: WAX 時(shí)間: 2025-3-26 22:52
Conference proceedings 2020R 2020, held in Paris, France, in July 2020.* In 2020, IJCAR was a merger of the following leading events, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), ITP (International Conference on Interactive Theorem Proving),作者: infantile 時(shí)間: 2025-3-27 01:28 作者: 偶像 時(shí)間: 2025-3-27 06:06
Multidimensional sleeping tops,we prove that witnesses for covered clauses are hard to compute. Further, we show that not all covered clauses are propagation redundant, the most general, polynomially-verifiable standard redundancy property. Finally, we close a gap in the literature by demonstrating the complexity of clause redundancy itself.作者: 誘拐 時(shí)間: 2025-3-27 12:50 作者: genuine 時(shí)間: 2025-3-27 14:35 作者: 痛恨 時(shí)間: 2025-3-27 19:33
Beating the Union: Union Avoidance in the USelies on the extensive usage of the Beth definability property for primitive fragments to convert implicitly defined variables into their explicitly defining terms. In the non-convex case, we show by a counterexample that cover may not exist in the combined theories, even in case combined quantifier-free interpolants do exist.作者: disciplined 時(shí)間: 2025-3-27 22:41 作者: dermatomyositis 時(shí)間: 2025-3-28 05:47
Combined Covers and Beth Definabilityelies on the extensive usage of the Beth definability property for primitive fragments to convert implicitly defined variables into their explicitly defining terms. In the non-convex case, we show by a counterexample that cover may not exist in the combined theories, even in case combined quantifier-free interpolants do exist.作者: Minutes 時(shí)間: 2025-3-28 07:01 作者: emulsify 時(shí)間: 2025-3-28 13:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166322.jpg作者: parallelism 時(shí)間: 2025-3-28 14:38 作者: Brittle 時(shí)間: 2025-3-28 19:17 作者: BET 時(shí)間: 2025-3-29 00:35
Multidimensional sleeping tops,grams relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive 作者: FILLY 時(shí)間: 2025-3-29 05:03 作者: 陪審團(tuán) 時(shí)間: 2025-3-29 07:53
Modern and Contemporary Poetry and Poeticsst one of the graphs contains a clique of size .. We present an automated method to solve this conjecture by encoding the existence of such a clique as a propositional formula. We apply satisfiability solving combined with symmetry-breaking techniques to determine that no such clique exists. This re作者: 爭(zhēng)議的蘋(píng)果 時(shí)間: 2025-3-29 14:25 作者: CLEFT 時(shí)間: 2025-3-29 19:01
Beating the Union: Union Avoidance in the USpropose a new technique for transforming CHCs with ADTs into CHCs where predicates are defined over basic types, such as integers and booleans, only. Thus, our technique avoids the explicit use of inductive proof rules during satisfiability proofs. The main extension over previous techniques for ADT作者: 果核 時(shí)間: 2025-3-29 20:21 作者: 減弱不好 時(shí)間: 2025-3-30 01:51
https://doi.org/10.1057/9781137319067ombination of monadic predicates in the theory. Recently, Veanes et al. showed the usefulness of monadic decomposability in the context of SMT (i.e. the input formula is quantifier-free), and found various interesting applications including string analysis. However, checking monadic decomposability 作者: artless 時(shí)間: 2025-3-30 07:53
https://doi.org/10.1057/9781137319067ices to entail a given goal. We propose an approach for solving this problem that is based on syntax-guided enumeration. For scalability, we use a novel procedure that incrementally constructs a solution in disjunctive normal form that is built from enumerated formulas. The procedure can be configur作者: Curmudgeon 時(shí)間: 2025-3-30 11:46 作者: corpus-callosum 時(shí)間: 2025-3-30 15:51
Beating the Union: Union Avoidance in the USnted out in the literature. A successive parallel research line inside the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. In this paper, we investigate cover transfer to theory combinations in the disjoint 作者: languid 時(shí)間: 2025-3-30 17:41
https://doi.org/10.1007/978-3-319-69332-3cally generates a database of independent infinity axiom sets with fewer than 1000 characters. It starts with complete theories of pure first-order logic with only one binary relation (FOL.) and generates further infinity axiom sets . of FOL. with fewer than 1000 characters such that no other infini作者: 鞠躬 時(shí)間: 2025-3-31 00:25 作者: REP 時(shí)間: 2025-3-31 00:58
https://doi.org/10.1007/978-1-4614-5950-7 Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing also how it can be combined with o作者: overture 時(shí)間: 2025-3-31 07:18
Arzu Tay Bayramo?lu,Zafer ?ztürke resultant ordering is highly suited to parameterising the first-order superposition calculus when dealing with the theory of higher-order logic, as it prevents inferences between the combinator axioms. We prove a number of desirable properties about the ordering including it having the subterm pro作者: handle 時(shí)間: 2025-3-31 12:14
Automated Reasoning978-3-030-51074-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 尖 時(shí)間: 2025-3-31 16:03
Martin Behrens,Heiner Dribbuschsymbols are assumed to be commutative. We show that decidability in P is preserved if we also assume that certain function symbols . are . in the sense that . implies .. In addition, we investigate a variant of extensionality that is more appropriate for commutative function symbols, but which raises the complexity of the word problem to coNP.作者: dendrites 時(shí)間: 2025-3-31 18:37 作者: 切割 時(shí)間: 2025-3-31 23:09
