標(biāo)題: Titlebook: Artificial Intelligence and Symbolic Mathematical Computing; International Confer Jacques Calmet,John A. Campbell Conference proceedings 19 [打印本頁] 作者: Cataplexy 時間: 2025-3-21 17:16
書目名稱Artificial Intelligence and Symbolic Mathematical Computing影響因子(影響力)
書目名稱Artificial Intelligence and Symbolic Mathematical Computing影響因子(影響力)學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computing網(wǎng)絡(luò)公開度
書目名稱Artificial Intelligence and Symbolic Mathematical Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computing被引頻次
書目名稱Artificial Intelligence and Symbolic Mathematical Computing被引頻次學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computing年度引用
書目名稱Artificial Intelligence and Symbolic Mathematical Computing年度引用學(xué)科排名
書目名稱Artificial Intelligence and Symbolic Mathematical Computing讀者反饋
書目名稱Artificial Intelligence and Symbolic Mathematical Computing讀者反饋學(xué)科排名
作者: 不真 時間: 2025-3-21 21:09 作者: 托運 時間: 2025-3-22 04:07 作者: nauseate 時間: 2025-3-22 06:24 作者: tattle 時間: 2025-3-22 11:39
On mathematical modeling in robotics, topological reasoning and so-called fibered logical spaces for logical reasoning in robotics. The main perspective is on interaction and combination of different fields and methods from symbolic mathematical computation and AI and the mutual stimulation given by the various disciplines.作者: 拒絕 時間: 2025-3-22 13:13
Completion and invariant theory in symbolic computation and artificial intelligence,igence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artificial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the sense of AI research.作者: adequate-intake 時間: 2025-3-22 20:52
A type-coercion problem in computer algebra,such a type system are polymorphism and coercion between types. Recently the use of order-sorted rewrite systems was proposed as a general framework..We will give a quite simple example of a family of types arising in computer algebra whose coercion relations cannot be captured by a finite set of first-order rewrite rules.作者: 寬度 時間: 2025-3-23 00:00
A desk-top sequent calculus machine,nts a desk-top machine used in interactive mode to solve verification as well as generation and abduction problems. The object oriented design is described and some implementation remarks are given. Examples of working sessions are presented.作者: 玉米 時間: 2025-3-23 01:53
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/162334.jpg作者: Type-1-Diabetes 時間: 2025-3-23 06:30
https://doi.org/10.1007/978-3-319-50079-9apers given at the 1992 Karlsruhe conference. Its main objective is to highlight some patterns that can be used to guide both sketches of the state of the art in this territory and suggestions for future research activities.作者: sleep-spindles 時間: 2025-3-23 13:33
Eco-Efficiency in Industry and Sciencetative level. Providing formalisms, languages, and systems for the acquisition and use of qualitative models is the goal of a very active research area in Artificial Intelligence. In this introductory survey, we discuss motivations for this research, illustrate different approaches by presenting som作者: 擁護者 時間: 2025-3-23 16:54 作者: Recessive 時間: 2025-3-23 19:07
Strategies to Increase Resource Efficiencynts that are relations on intervals. Problems of up to 500 variables may be solved in expected cubic time. Strong evidence is presented that significant backtracking on random problems occurs only in the range 6 ≤ . 15, for . ≥ 0.5, where . is the number of variables, and . is the ratio of non-trivi作者: 烤架 時間: 2025-3-24 01:36 作者: 矛盾心理 時間: 2025-3-24 04:28
Olaf Tschimpke,Benjamin Bongardt as an intelligent front-end, communicating with a back-end . sub-process. The rule base of the system has been extended to include knowledge about numerical solutions to problems that . is unable to solve algebraically, or on request by the user. The system incorporates an on-line documentation bro作者: chapel 時間: 2025-3-24 08:38
Olaf Tschimpke,Benjamin Bongardts already provide user-friendly interfaces to several software tools, but will AI play a still larger role in the future? We open a discussion on the interaction of AI and Symbolic Mathematical Computation, and pose many questions which should be addressed.作者: CRAB 時間: 2025-3-24 12:51 作者: 起皺紋 時間: 2025-3-24 18:05 作者: 話 時間: 2025-3-24 21:41
https://doi.org/10.1007/978-94-015-7202-6omial equations, dis-equations, and inequalities. The algebraic algorithm (a restructured version of Cylindrical Algebraic Decomposition) is non-deterministic, in the sense that it can often achieve the same goal, but following different paths requiring different amounts of computing times. Obviousl作者: Digitalis 時間: 2025-3-25 03:00
https://doi.org/10.1007/978-94-015-7202-6 project aiming at designing an environment for symbolic computing based upon knowledge representation and relying, when needed, on AI methods..We present a method for the specification of these ACS‘s which is embedded in the framework of algebraic specifications and of unified domains. The first pa作者: endoscopy 時間: 2025-3-25 04:40
Tullio Tolio,Giacomo Copani,Walter Terkajigence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artificial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the sense of AI research.作者: 飛來飛去真休 時間: 2025-3-25 10:21 作者: 有限 時間: 2025-3-25 13:16 作者: ARK 時間: 2025-3-25 19:26 作者: Anguish 時間: 2025-3-25 20:04
Tullio Tolio,Giacomo Copani,Walter Terkajnts a desk-top machine used in interactive mode to solve verification as well as generation and abduction problems. The object oriented design is described and some implementation remarks are given. Examples of working sessions are presented.作者: Accolade 時間: 2025-3-26 00:51
Tullio Tolio,Giacomo Copani,Walter Terkajee Gentzen-style systems which characterize prepositional SLDNF-resolution and propositional PROLOG‘s resolution in a sound and complete way (without assuming stratification or any other restrictions on programs.) Our analysis employs certain three-valued logics..The results of this paper can be of 作者: 影響帶來 時間: 2025-3-26 07:52 作者: 無法解釋 時間: 2025-3-26 10:08 作者: 小溪 時間: 2025-3-26 14:26 作者: Cacophonous 時間: 2025-3-26 17:49 作者: LAITY 時間: 2025-3-26 23:45
Olaf Tschimpke,Benjamin Bongardts already provide user-friendly interfaces to several software tools, but will AI play a still larger role in the future? We open a discussion on the interaction of AI and Symbolic Mathematical Computation, and pose many questions which should be addressed.作者: MAIZE 時間: 2025-3-27 05:03
Armin Reller,Volker Zepf,Benjamin Achzet topological reasoning and so-called fibered logical spaces for logical reasoning in robotics. The main perspective is on interaction and combination of different fields and methods from symbolic mathematical computation and AI and the mutual stimulation given by the various disciplines.作者: infantile 時間: 2025-3-27 05:56
Tullio Tolio,Giacomo Copani,Walter Terkajigence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artificial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the sense of AI research.作者: hardheaded 時間: 2025-3-27 09:31
Tullio Tolio,Giacomo Copani,Walter Terkajsuch a type system are polymorphism and coercion between types. Recently the use of order-sorted rewrite systems was proposed as a general framework..We will give a quite simple example of a family of types arising in computer algebra whose coercion relations cannot be captured by a finite set of first-order rewrite rules.作者: 散開 時間: 2025-3-27 15:19 作者: arousal 時間: 2025-3-27 20:59 作者: ABIDE 時間: 2025-3-27 23:37
Qualitative modeling of physical systems in AI research,tative level. Providing formalisms, languages, and systems for the acquisition and use of qualitative models is the goal of a very active research area in Artificial Intelligence. In this introductory survey, we discuss motivations for this research, illustrate different approaches by presenting som作者: 巨大沒有 時間: 2025-3-28 03:25 作者: BACLE 時間: 2025-3-28 10:14 作者: 陰險 時間: 2025-3-28 13:08 作者: 鐵砧 時間: 2025-3-28 15:15 作者: CHIP 時間: 2025-3-28 20:05 作者: Nonthreatening 時間: 2025-3-29 02:56
On mathematical modeling in robotics, topological reasoning and so-called fibered logical spaces for logical reasoning in robotics. The main perspective is on interaction and combination of different fields and methods from symbolic mathematical computation and AI and the mutual stimulation given by the various disciplines.作者: anaerobic 時間: 2025-3-29 04:26
,Gr?bner bases: Strategies and applications,he polynomial set involved in their specification into Gr?bner bases form. Gr?bner bases of a system of polynomials are canonical finite sets of multivariate polynomials which define the same algebraic structure as the initial polynomial system. But the computation of Gr?bner bases requires a large 作者: MEN 時間: 2025-3-29 10:02 作者: Servile 時間: 2025-3-29 12:08 作者: 背叛者 時間: 2025-3-29 17:15
Completion and invariant theory in symbolic computation and artificial intelligence,igence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artificial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the sense of AI research.作者: 先行 時間: 2025-3-29 22:07 作者: 提名 時間: 2025-3-29 23:59
Algorithmic development of power series,ce a goal of Computer Algebra is to work with formal objects and preserve such symbolic information, it should be possible to automate conversion between these forms in Computer Algebra Systems (CASs). However, only . provides a rather limited procedure powerseries to calculate FPS from analytic exp作者: 平息 時間: 2025-3-30 08:04 作者: Heresy 時間: 2025-3-30 08:25 作者: 良心 時間: 2025-3-30 13:00 作者: 多余 時間: 2025-3-30 18:57 作者: 前面 時間: 2025-3-30 23:24
Reasoning about time,een a set of events, we would like to have the ability to infer additional relationships which are implicit in those given. For example, the transitivity of “before” and “contains” may allow us to infer information regarding the sequence of events. Such inferences are essential in story understandin作者: 流眼淚 時間: 2025-3-31 01:54 作者: fatty-streak 時間: 2025-3-31 06:06 作者: Aspirin 時間: 2025-3-31 13:11
Factoring Ideals in Integral Domainsegments along a linear DNA chain involves similar problems..Interval consistency problems deal with events, each of which is assumed to be an interval on the real line or on any other linearly ordered set, and reasoning about such intervals when the precise topological relationships between them is 作者: Mindfulness 時間: 2025-3-31 14:09
Reasoning about time,egments along a linear DNA chain involves similar problems..Interval consistency problems deal with events, each of which is assumed to be an interval on the real line or on any other linearly ordered set, and reasoning about such intervals when the precise topological relationships between them is 作者: 使增至最大 時間: 2025-3-31 18:34 作者: 發(fā)起 時間: 2025-4-1 00:55
Strategies to Increase Resource Efficiencyal constraints to possible constraints in the problem. Space performance of the method is affected by the branching factor during search, and time performance by path-consistency calculations, including the calculation of compositions of relations.作者: 清澈 時間: 2025-4-1 02:57 作者: 財主 時間: 2025-4-1 06:25
Tullio Tolio,Giacomo Copani,Walter Terkajdescriptions of the individual queries and query fragments are retained along with the resulting access strategy, a description of the response, and costs to retrieve the desired information. This knowledge is then used to develop future access strategies.作者: Brain-Waves 時間: 2025-4-1 12:21 作者: 殺人 時間: 2025-4-1 15:42
A symbolic approach to interval constraint problems,al constraints to possible constraints in the problem. Space performance of the method is affected by the branching factor during search, and time performance by path-consistency calculations, including the calculation of compositions of relations.
