標(biāo)題: Titlebook: Artificial Intelligence and Symbolic Computation; 12th International C Gonzalo A. Aranda-Corral,Jacques Calmet,Francisco Conference procee [打印本頁] 作者: 他剪短 時間: 2025-3-21 17:54
書目名稱Artificial Intelligence and Symbolic Computation影響因子(影響力)
書目名稱Artificial Intelligence and Symbolic Computation影響因子(影響力)學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Computation網(wǎng)絡(luò)公開度
書目名稱Artificial Intelligence and Symbolic Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Computation被引頻次
書目名稱Artificial Intelligence and Symbolic Computation被引頻次學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Computation年度引用
書目名稱Artificial Intelligence and Symbolic Computation年度引用學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Computation讀者反饋
書目名稱Artificial Intelligence and Symbolic Computation讀者反饋學(xué)科排名
作者: collagen 時間: 2025-3-21 22:53
Symptom Manifestation Within Relationshipsvoted to verify an algorithm computing a diagonal form of an integer matrix (looking for the ACL2 executability that is missed in Isabelle/HOL). Moreover, we provide a formal proof of a fragment of the obtained ACL2 specification — this shows the suitability of our approach to reuse in ACL2 a proof strategy imported from Isabelle/HOL.作者: 詞匯記憶方法 時間: 2025-3-22 04:24 作者: canvass 時間: 2025-3-22 05:27
https://doi.org/10.1007/0-306-47216-3d decision rule is a particular case of the rule proposed in [4]. Second, we give experiments showing that our rule is able to decide on a set of hypotheses. Some experiments are handled on a set of mass functions generated randomly, others on real databases.作者: acolyte 時間: 2025-3-22 11:34
Developments in Sexology and Sex Therapys usually assigned by a heuristic analysis. Our mathematical hierarchy would be a universal tool which ensures the mathematical correctness of the level of a Sudoku puzzle given by a heuristic analysis.作者: unstable-angina 時間: 2025-3-22 14:37 作者: 放縱 時間: 2025-3-22 18:15
https://doi.org/10.1007/0-306-47216-3ty of conchoids and offset curves, as well as the corresponding help pages. In addition, we present a brief atlas where the offset and conchoids of several algebraic plane curves are obtained, their rationality analyzed, and parametrizations are provided using the created packages.作者: 全部 時間: 2025-3-22 21:23
https://doi.org/10.1007/0-306-47216-3des a new family of hyperelliptic curves of genus 3 for which the Jacobians completely split. The sublocus of such family when ..???.. is a 1-dimensional variety which we determine explicitly. We can also determine . and . starting form the .-invariant of ...作者: 來自于 時間: 2025-3-23 04:37 作者: Functional 時間: 2025-3-23 06:52 作者: NOT 時間: 2025-3-23 09:57
Rational Conchoid and Offset Constructions: Algorithms and Implementationty of conchoids and offset curves, as well as the corresponding help pages. In addition, we present a brief atlas where the offset and conchoids of several algebraic plane curves are obtained, their rationality analyzed, and parametrizations are provided using the created packages.作者: 演講 時間: 2025-3-23 15:09 作者: Grasping 時間: 2025-3-23 19:31
Conference proceedings 2014nd new Turing machines; logics including non-classical ones; reasoning; learning; decision support systems; and machine intelligence and epistemology and philosophy of symbolic mathematical computing.作者: 厚臉皮 時間: 2025-3-24 00:29 作者: 有常識 時間: 2025-3-24 05:39
Symptom Manifestation Within Relationshipsusing efficient methods. We consider different approaches to solve both kind of problems and provide a quantitative evaluation of performance that points to an early result by Pólya and Szeg?’s as an appropriate basis for implementations in most cases.作者: 青春期 時間: 2025-3-24 08:02 作者: 無能力之人 時間: 2025-3-24 12:24 作者: LANCE 時間: 2025-3-24 15:52 作者: ARC 時間: 2025-3-24 22:26 作者: APEX 時間: 2025-3-25 00:04
A Distance-Based Decision in the Credal Leveld decision rule is a particular case of the rule proposed in [4]. Second, we give experiments showing that our rule is able to decide on a set of hypotheses. Some experiments are handled on a set of mass functions generated randomly, others on real databases.作者: tattle 時間: 2025-3-25 05:36 作者: 巨頭 時間: 2025-3-25 11:33
Symptom Manifestation Within Relationshipsfied with the belief function theory where conditional beliefs are defined for all parents without having to transform the network into a junction tree. We explain how it is still possible to use the disjunctive rule of combination DRC and the generalized Bayesian theorem GBT to perform this propagation.作者: Adrenal-Glands 時間: 2025-3-25 13:11
Symptom Manifestation Within Relationshipsthem into ”good” SAT instances. We illustrate our technique on the well-known nqueens problem. Our technique is simpler, more expressive, and less error-prone than direct hand modeling. The SAT instances that we automatically generate are rather small w.r.t. hand-written instances.作者: 巡回 時間: 2025-3-25 19:23 作者: constitute 時間: 2025-3-25 22:41 作者: 存心 時間: 2025-3-26 00:47 作者: Induction 時間: 2025-3-26 07:43
From Declarative Set Constraint Models to “Good” SAT Instancesthem into ”good” SAT instances. We illustrate our technique on the well-known nqueens problem. Our technique is simpler, more expressive, and less error-prone than direct hand modeling. The SAT instances that we automatically generate are rather small w.r.t. hand-written instances.作者: ANNUL 時間: 2025-3-26 09:16 作者: Insufficient 時間: 2025-3-26 13:56 作者: JIBE 時間: 2025-3-26 20:34 作者: Sarcoma 時間: 2025-3-26 20:58
Proving and Computing: Applying Automated Reasoning to the Verification of Symbolic Computation Syst of the results computed by the system, beyond the classical approach of testing. Formal verification of properties of the implemented algorithms require not only to formalize the properties of the algorithm, but also of the underlying (usually rich) mathematical theory..We show how we can use ACL2,作者: 禁止 時間: 2025-3-27 02:12
Models for Logics and Conditional Constraints in Automated Proofs of Terminationthe logic, and also handling the . which are often obtained. The formal treatment of such constraints in automated proofs, often using . interpretations and (arithmetic) constraint solving, can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing 作者: 容易生皺紋 時間: 2025-3-27 08:41 作者: 宏偉 時間: 2025-3-27 12:15 作者: confide 時間: 2025-3-27 13:48 作者: MEET 時間: 2025-3-27 20:40
A Direct Propagation Method in Singly Connected Causal Belief Networks with Conditional Distributione. The aim of this paper is to propose a direct method of causal inference of both observations and interventions on the causal belief networks quantified with the belief function theory where conditional beliefs are defined for all parents without having to transform the network into a junction tre作者: MILL 時間: 2025-3-27 23:03 作者: artless 時間: 2025-3-28 05:22 作者: Lucubrate 時間: 2025-3-28 09:44
A Simple GUI for Developing Applications That Use Mathematical Software Systems..) and consider it useful for classroom use, do not use it in the classroom because they do not want to spend the time required to introduce the mathematical software system. Simultaneously, many small specific purpose mathematical applications (usually applets), that take much time to be programme作者: BILK 時間: 2025-3-28 10:49 作者: 流動才波動 時間: 2025-3-28 14:41
Dynamic Symmetry Breaking in Itemset Mining here, by the detection and elimination of local and global symmetries in the item-set mining problem. Recent works have provided effective encodings as Boolean constraints for these data mining tasks and some idea on symmetry elimination in this area begin to appear, but still few and the technique作者: chronology 時間: 2025-3-28 20:41
A Distance-Based Decision in the Credal Leveln making which can be handled by a range of decision rules. Some rules help to choose the most likely hypothesis. Others allow that a decision is made on a set of hypotheses. In [6], we proposed a decision rule based on a distance measure. First, in this paper, we aim to demonstrate that our propose作者: 帶來的感覺 時間: 2025-3-29 01:17
Multivalued Elementary Functions in Computer-Algebra Systemse-valued inverse function defined by computer systems and the multivalued function which represents the multiple solutions of the defining equation. The implementation takes an idea from complex analysis, namely the . of an inverse function, and defines an index for each branch. The branch index the作者: FLOUR 時間: 2025-3-29 05:32
Rational Conchoid and Offset Constructions: Algorithms and Implementation the conchoid to an algebraic plane curve and, in the affirmative case, the actual computation of parametrizations. We recall some of the basic definitions and main properties on offsets (see [13]), and conchoids (see [15]) as well as the algorithms for parametrizing their rational components (see [作者: Hyperplasia 時間: 2025-3-29 07:27
Algorithmic Aspects of Theory Blendings by constrained combination of available knowledge. It thereby provides a possible theoretical foundation for modeling high-level cognitive faculties such as the ability to understand, learn, and create new concepts and theories. This paper describes a logic-based framework which allows a formal tr作者: 記憶 時間: 2025-3-29 13:10
Decomposition of Some Jacobian Varieties of Dimension 3degree 2 cover to an elliptic curve . and degree 4?covers to elliptic curves .. and .. is a 2-dimensional subvariety of the hyperelliptic moduli .. We determine this subvariety explicitly. For any given moduli point . we determine explicitly if the corresponding genus 3 curve . belongs or not to suc作者: 獸群 時間: 2025-3-29 18:45
https://doi.org/10.1007/978-3-319-13770-4Algebraic Topology; Artificial Intelligence in Symbolic Mathematical Computing; Computer Algebra Syste作者: fallible 時間: 2025-3-29 21:45 作者: Audiometry 時間: 2025-3-30 01:06 作者: 損壞 時間: 2025-3-30 04:44 作者: Venules 時間: 2025-3-30 09:43 作者: 調(diào)色板 時間: 2025-3-30 15:59 作者: Deceit 時間: 2025-3-30 19:19 作者: onlooker 時間: 2025-3-30 21:49
Symptom Manifestation Within Relationshipsalysis of .). Several . for . polynomials . that are non-negative on [0,?+?∞?) have been investigated. They can often be used to . the property, thus providing a method for checking it by trying a . of . against the representation. We introduce a new characterization based on viewing polynomials . a作者: 潔凈 時間: 2025-3-31 02:39 作者: BRUNT 時間: 2025-3-31 08:44 作者: 排出 時間: 2025-3-31 11:11 作者: Rotator-Cuff 時間: 2025-3-31 15:43
Symptom Manifestation Within RelationshipsSAT) solvers can handle huge SAT instances. We thus present a technique to declaratively model set constraint problems, to reduce them, and to encode them into ”good” SAT instances. We illustrate our technique on the well-known nqueens problem. Our technique is simpler, more expressive, and less err
