標(biāo)題: Titlebook: Artificial Intelligence and Symbolic Mathematical Computation; International Confer Jacques Calmet,John A. Campbell,Jochen Pfalzgraf Confer [打印本頁] 作者: Colossal 時間: 2025-3-21 18:30
書目名稱Artificial Intelligence and Symbolic Mathematical Computation影響因子(影響力)
書目名稱Artificial Intelligence and Symbolic Mathematical Computation影響因子(影響力)學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computation網(wǎng)絡(luò)公開度
書目名稱Artificial Intelligence and Symbolic Mathematical Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computation被引頻次
書目名稱Artificial Intelligence and Symbolic Mathematical Computation被引頻次學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computation年度引用
書目名稱Artificial Intelligence and Symbolic Mathematical Computation年度引用學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computation讀者反饋
書目名稱Artificial Intelligence and Symbolic Mathematical Computation讀者反饋學(xué)科排名
作者: 重力 時間: 2025-3-21 22:00
Compromised updates in labelled databases,the inference rules, part of the control mechanism for the compromised approach. This mechanism helps the update operations to perform the reconciliation of conflicting inputs. The update operations invoke a specific revision method, which applies some compromising criteria for achieving the revised作者: MOCK 時間: 2025-3-22 04:27
Programming by demonstration: A machine learning approach to support skill acquision for robots,tion representation. This task is not yet well understood nor solved in general. Second, if a generalization is required, induction algorithms must be applied to the sensor data trace, to find the most general user-intended robot function from only few examples. In this paper mainly the second probl作者: hyperuricemia 時間: 2025-3-22 04:52 作者: packet 時間: 2025-3-22 09:37
Solving geometrical constraint systems using CLP based on linear constraint solver, cooperation with a linear constraint solver. We define a representation for the real numbers, i.e. constructible numbers, occuring in Euclidean geometry. This representation preserves correctness and completeness of above algorithms. A survey over 512 theorems of Euclidean geometry shows that from 作者: miscreant 時間: 2025-3-22 15:17 作者: Prologue 時間: 2025-3-22 20:40 作者: Eclampsia 時間: 2025-3-22 22:51 作者: 閑蕩 時間: 2025-3-23 03:18 作者: condone 時間: 2025-3-23 09:10 作者: 未成熟 時間: 2025-3-23 13:01 作者: glacial 時間: 2025-3-23 16:08
Artificial Intelligence and Symbolic Mathematical ComputationInternational Confer作者: linguistics 時間: 2025-3-23 20:00 作者: Phagocytes 時間: 2025-3-23 22:53
Document recognition, semantics, and symbolic reasoning in reverse engineering of software,ering of legacy systems. It focusses on the recognition and analysis of diagrams rather than natural language processing of textual components of a software document. Rigorous analysis of diagrams requires a formal semantics for them, and utilises tools for symbolic reasoning..Data flow diagrams (DF作者: CHAFE 時間: 2025-3-24 03:40 作者: affect 時間: 2025-3-24 09:25 作者: CLOUT 時間: 2025-3-24 12:50 作者: HOWL 時間: 2025-3-24 18:30
,Knowledge-based information processing in manufacturing cells — The present and the future,owledge-based systems for diagnosis and quality assurance have a central structure. These approaches don‘t fulfill future requirements towards increased availability and malfunction tolerance. At the iwb a new hierarchic control concept for autonomous manufacturing cells was developed and implemente作者: 空氣 時間: 2025-3-24 22:03 作者: CLOWN 時間: 2025-3-25 00:01 作者: Urea508 時間: 2025-3-25 07:02
Proof transformation for non-compatible rewriting,transformation techniques using a very powerful new proof ordering. This new ordering improves over previously proposed orderings because (1) it can handle semi-compatible reduction relations and (2) it explains all known complete redundancy criteria in a uniform framework.作者: 印第安人 時間: 2025-3-25 09:40
PATCH Graphs: An efficient data structure for completion of finitely presented groups,ts rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH Graph data structure and inference rules compleme作者: Presbyopia 時間: 2025-3-25 15:09 作者: 黃油沒有 時間: 2025-3-25 17:34 作者: Obstruction 時間: 2025-3-25 21:05
Geometry machines: From AI to SMC,roaches are explained with a set of selected examples. Comments and analyses are provided to illustrate the encouraging success of GTP which interrelates AI and SMC. We also present some technological applications of GTP and discuss its challenges ahead.作者: CORE 時間: 2025-3-26 03:34
Solving geometrical constraint systems using CLP based on linear constraint solver,nd consequently belong to the domain of CLP(R). Unfortunately, CLP based on linear constraint solvers which are efficient and can deal with geometrical constraints such as parallelism, perpendicularity, belonging to a line i.e. pseudo-linear constraints, cannot handle quadratic constraints introduce作者: BANAL 時間: 2025-3-26 06:52 作者: 積習(xí)已深 時間: 2025-3-26 09:27 作者: Pepsin 時間: 2025-3-26 15:31 作者: mechanism 時間: 2025-3-26 20:50 作者: 祝賀 時間: 2025-3-26 23:31 作者: Solace 時間: 2025-3-27 03:29
https://doi.org/10.1007/978-3-658-41581-5er-Shafer theory to interpret both combinations of strategies based on qualitative measures and combinations of possibly conflicting quantitative measures. This is then applied in an expert system for selecting appropriate numerical routines for the solution of a range of mathematical problems.作者: 流行 時間: 2025-3-27 08:12 作者: Proclaim 時間: 2025-3-27 13:08 作者: 流動性 時間: 2025-3-27 16:34
PATCH Graphs: An efficient data structure for completion of finitely presented groups,g is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH Graph data structure and inference rules complement other extensions of Knuth-Bendix completion for finitely presented groups.作者: 輕率看法 時間: 2025-3-27 20:25 作者: vocation 時間: 2025-3-27 22:30
A new approach on solving 3-satisfiability,a solution in time less than .(1.476.), which improves the current well-known 3-satisfiability algorithms. Tests have shown the number of steps to be significantly smaller also in the average compared with the other algorithms.作者: mighty 時間: 2025-3-28 03:23 作者: CHARM 時間: 2025-3-28 07:02 作者: Hectic 時間: 2025-3-28 10:27 作者: callous 時間: 2025-3-28 18:15
,Knowledge-based information processing in manufacturing cells — The present and the future,entral degrees of freedom to react autonomously to occuring malfunctions requires knowledge-based approaches. An analysis of the distributed knowledge bases and the different representations of knowledge shows, that an integrated design of the knowledge-based systems is vital for the successful development of future autonomous manufacturing cells.作者: Flinch 時間: 2025-3-28 22:44 作者: MOAT 時間: 2025-3-29 01:51
Conference proceedings 1996; also included are four invited survey and state-of-the-art contributions by Scott, Dillmann and Friedrich, Cohn, and Wang. Among the topics addressed are theorem proving, rewriting systems, symbolic computation, spatial reasoning, computational geometry, and automated deduction.作者: UNT 時間: 2025-3-29 04:00 作者: 象形文字 時間: 2025-3-29 08:18 作者: Glaci冰 時間: 2025-3-29 12:59 作者: CBC471 時間: 2025-3-29 15:53 作者: 大暴雨 時間: 2025-3-29 22:36
Symbolic computation and teaching,Since 1989, the author has tried to show that it is possible to put a complete semester-long course in machine-held form. Several examples have been carried out (in .), and the paper reports on the experience, on the problems encountered, and on some suggestions for future developments.作者: 只有 時間: 2025-3-30 00:02 作者: RALES 時間: 2025-3-30 06:28
Data types in subdefinite models,We consider the mechanism of subdefinite models and the problem of representing data types in such models. A justification of the method of subdefinite models is given; various kinds of subdefinite extensions of data types are presented. We also investigate their efficiency in the solution of various problems.作者: Extricate 時間: 2025-3-30 10:15 作者: Projection 時間: 2025-3-30 16:13
Proof transformation for non-compatible rewriting,transformation techniques using a very powerful new proof ordering. This new ordering improves over previously proposed orderings because (1) it can handle semi-compatible reduction relations and (2) it explains all known complete redundancy criteria in a uniform framework.作者: 錫箔紙 時間: 2025-3-30 16:59 作者: 驚奇 時間: 2025-3-30 22:32 作者: 使苦惱 時間: 2025-3-31 03:42 作者: 時代 時間: 2025-3-31 07:44
Dead Zones in the Oceans – The P/N?Cycleone on qualitative . reasoning; this paper lays out a guide to the issues involved and surveys what has been achieved. The papers is generally informal and discursive, providing pointers to the literature where full technical details may be found.作者: Flatus 時間: 2025-3-31 10:47 作者: Enliven 時間: 2025-3-31 16:52
Michael Angrick,Andreas Burger,Harry Lehmannroaches are explained with a set of selected examples. Comments and analyses are provided to illustrate the encouraging success of GTP which interrelates AI and SMC. We also present some technological applications of GTP and discuss its challenges ahead.作者: 先兆 時間: 2025-3-31 18:49
Stefan Giljum,Friedrich Hinterbergerefinition for systems and define a category of systems. The main idea of the paper is that relationships between systems can be expressed by a suitable Grothendieck topology on the category of systems. We show that states and (parallel) actions can be expressed by sheaves and use this in order to study the behavior of systems in time.作者: tangle 時間: 2025-4-1 01:03 作者: Cryptic 時間: 2025-4-1 01:58 作者: 儲備 時間: 2025-4-1 06:51
https://doi.org/10.1007/978-3-662-65558-0cting inputs into knowledge bases, via restricting their consequences. The main idea is to update the database with as many consistent consequences of the inputs as possible, in the case that the inputs themselves are not allowed to be kept in it. And in the case that a revision applies, the idea is作者: 脾氣暴躁的人 時間: 2025-4-1 10:41
Species Extinction and BiodiversityKnowledge Based Systems..Let . be a set of propositions, . a proposition, and let us denote their images, in a certain isomorphism, by . and . respectively. It can be established whether or not . follows from . (. ? .) by checking the equality of ideals .·γ}>=<1> in the polynomial model (. is a new 作者: 燦爛 時間: 2025-4-1 16:31
https://doi.org/10.1007/978-3-662-65558-0ill in form of few examples. In the domain of robotics this paradigm offers the potential to reduce the complexity of robot task programming and to make programming more ”natural”. In case of programming an assembly task PbD allows with the help of a video or a laser camera and a data glove the auto
