標(biāo)題: Titlebook: Artificial Intelligence and Symbolic Computation; 7th International Co Bruno Buchberger,John Campbell Conference proceedings 2004 Springer- [打印本頁(yè)] 作者: HEIR 時(shí)間: 2025-3-21 17:16
書目名稱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é)科排名
作者: COKE 時(shí)間: 2025-3-21 21:47 作者: 爭(zhēng)吵 時(shí)間: 2025-3-22 01:25
https://doi.org/10.1007/978-1-349-22597-2In this paper, we present the formal verification of a . implementation of Buchberger’s algorithm for computing Gr?bner bases of polynomial ideals. This work is carried out in the . system and shows how verified Computer Algebra can be achieved in an executable logic.作者: 不能約 時(shí)間: 2025-3-22 04:46 作者: Externalize 時(shí)間: 2025-3-22 12:29 作者: CODE 時(shí)間: 2025-3-22 14:28
Solving Equations Involving Sequence Variables and Sequence FunctionsTerm equations involving individual and sequence variables, and individual and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A new unification procedure for solving such equations is presented. Decidability of unification is proved. Completeness and almost minimality of the procedure is shown.作者: 認(rèn)識(shí) 時(shí)間: 2025-3-22 20:36
Verified Computer Algebra in ,In this paper, we present the formal verification of a . implementation of Buchberger’s algorithm for computing Gr?bner bases of polynomial ideals. This work is carried out in the . system and shows how verified Computer Algebra can be achieved in an executable logic.作者: DUST 時(shí)間: 2025-3-23 00:37 作者: DALLY 時(shí)間: 2025-3-23 05:23
https://doi.org/10.1007/b100361Variable; algorithms; automated deduction; automated reasoning; computational logics; computational mathe作者: Osmosis 時(shí)間: 2025-3-23 06:08
978-3-540-23212-4Springer-Verlag Berlin Heidelberg 2004作者: Pigeon 時(shí)間: 2025-3-23 09:46
Artificial Intelligence and Symbolic Computation978-3-540-30210-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: LIKEN 時(shí)間: 2025-3-23 15:01 作者: PAGAN 時(shí)間: 2025-3-23 18:37 作者: Indolent 時(shí)間: 2025-3-24 01:41 作者: climax 時(shí)間: 2025-3-24 03:58 作者: 機(jī)械 時(shí)間: 2025-3-24 06:31 作者: 正面 時(shí)間: 2025-3-24 12:02
Bruno Buchberger,John CampbellIncludes supplementary material: 作者: 暗語(yǔ) 時(shí)間: 2025-3-24 17:28 作者: Increment 時(shí)間: 2025-3-24 19:03 作者: 同義聯(lián)想法 時(shí)間: 2025-3-25 00:04
L. Fernández-Cruz,S. Navarro,A. Sáenzy 1970’s, the entanglement of logic and algebra has been successfully exploited in many areas of computer science from the theory of computation to Artificial Intelligence (AI)..The scientific outcome of the interplay between logic and universal algebra in computer science is rich and vast (cf. [2])作者: 開頭 時(shí)間: 2025-3-25 04:48 作者: Palliation 時(shí)間: 2025-3-25 11:15
G. Beger,W. H. Uhl,M. W. Büchler. When such a proof attempt fails, these failures can be analyzed and a patch formulated and applied. We also describe rippling: a powerful proof method used in proof planning. We pose and answer a number of common questions about proof planning and rippling.作者: 姑姑在炫耀 時(shí)間: 2025-3-25 13:51 作者: cringe 時(shí)間: 2025-3-25 16:43 作者: encomiast 時(shí)間: 2025-3-25 21:44
G. Angelini,A. Castagnini,D. Sgarbi in this logic is introduced. Since it is based on the DPLL method, the procedure can adopt its heuristics. Therefore the procedure can be used as a basis for efficient implementations of satisfiability checkers for EUF. A part of the introduced method is a technique for reducing the size of formula作者: Basal-Ganglia 時(shí)間: 2025-3-26 00:50 作者: 死貓他燒焦 時(shí)間: 2025-3-26 04:58
The Medical Costs of AIDS in Zimbabwen approaches, completion and abstract congruence closure, in a natural way by relying on a specialized and optimized version of the more general, but less efficient, SOUR graphs. This approach allows for efficient implementations and a visual presentation that better illuminates the basic ideas unde作者: 有花 時(shí)間: 2025-3-26 09:58 作者: 滲透 時(shí)間: 2025-3-26 15:59 作者: averse 時(shí)間: 2025-3-26 18:21 作者: Semblance 時(shí)間: 2025-3-27 00:46
The Impact of AIDS on Industry in Zimbabwesymbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in constraint satisfication problems. In this paper we analyse the structure of symmetry groups of constraint satisfa作者: machination 時(shí)間: 2025-3-27 01:06 作者: 的是兄弟 時(shí)間: 2025-3-27 06:36 作者: 鉗子 時(shí)間: 2025-3-27 11:37
The Algorithmization of Physics: Math Between Science and Engineeringlified by a recent result from my own research: a new symbolic solution method for linear two-point boundary value problems. The essential features of this method are discussed with regard to a potentially novel line of research in symbolic computation.作者: IVORY 時(shí)間: 2025-3-27 15:47
Planning and Patching Proof. When such a proof attempt fails, these failures can be analyzed and a patch formulated and applied. We also describe rippling: a powerful proof method used in proof planning. We pose and answer a number of common questions about proof planning and rippling.作者: peptic-ulcer 時(shí)間: 2025-3-27 19:16
Extending Finite Model Searching with Congruence Closure Computationnd mathematics. In this paper, we describe how to increase propagation of constraints by using the ground congruence closure algorithm. The experimental results show that using the congruence closure algorithm can reduce the search space for some benchmark problems.作者: candle 時(shí)間: 2025-3-27 23:47 作者: 發(fā)炎 時(shí)間: 2025-3-28 05:00 作者: 顛簸地移動(dòng) 時(shí)間: 2025-3-28 10:06 作者: 不來 時(shí)間: 2025-3-28 14:30
Proof Search in Minimal Logicy requiring that every higher order variable . can only occur in a context ., where . are distinct bound variables in the scope of the operator binding ., and of opposite polarity. Note that for first order logic this restriction does not mean anything, since there are no higher order variables. How作者: Keratin 時(shí)間: 2025-3-28 16:20
Planning and Patching Proof. When such a proof attempt fails, these failures can be analyzed and a patch formulated and applied. We also describe rippling: a powerful proof method used in proof planning. We pose and answer a number of common questions about proof planning and rippling.作者: 去才蔑視 時(shí)間: 2025-3-28 21:49
A Paraconsistent Higher Order Logicency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc..Higher order logics have the advantages of being expressive and wi作者: mettlesome 時(shí)間: 2025-3-29 02:59
Abstraction Within Partial Deduction for Linear Logic to apply abstraction within Partial Deduction (PD) formalism for Linear Logic (LL). The proposal is accompanied with formal results identifying limitations and advantages of the approach..We adapt a technique from AI planning for constructing abstraction hierarchies, which are then exploited during作者: Friction 時(shí)間: 2025-3-29 06:52 作者: Nonporous 時(shí)間: 2025-3-29 07:23 作者: BIBLE 時(shí)間: 2025-3-29 14:54 作者: refraction 時(shí)間: 2025-3-29 17:44
Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniqueseasoning on constraints. However, local computations may lead to slow convergences. In order to handle this problem, we introduce a symbolic technique to combine nonlinear constraints. Such redundant constraints are further simplified according to the precision of interval computations. As a consequ作者: CALL 時(shí)間: 2025-3-29 23:38 作者: 宿醉 時(shí)間: 2025-3-30 01:06
An Evolutionary Local Search Method for Incremental Satisfiabilitysatisfiability is maintained when new clauses are added to an initial satisfiable set of clauses. Since stochastic local search algorithms have been proved highly efficient for SAT, it is valuable to investigate their application to solve ISAT. Extremal Optimization is a simple heuristic local searc作者: 單純 時(shí)間: 2025-3-30 07:44
New Developments in Symmetry Breaking in Search Using Computational Group Theorysymbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in constraint satisfication problems. In this paper we analyse the structure of symmetry groups of constraint satisfa作者: 懶洋洋 時(shí)間: 2025-3-30 09:53 作者: jumble 時(shí)間: 2025-3-30 12:46 作者: Palatial 時(shí)間: 2025-3-30 16:47 作者: HAVOC 時(shí)間: 2025-3-30 23:42 作者: obligation 時(shí)間: 2025-3-31 03:09 作者: 愛花花兒憤怒 時(shí)間: 2025-3-31 06:03 作者: 四溢 時(shí)間: 2025-3-31 10:25
Proving and Constraint Solving in Computational Origami We illustrate this by a simple example of trisecting an angle by origami. The trisection of an angle is known to be impossible by means of a ruler and a compass. The entire process of computational origami shows nontrivial combination of symbolic constraint solving, theorem proving and graphical processing.作者: 參考書目 時(shí)間: 2025-3-31 14:13
G. Angelini,A. Castagnini,D. Sgarbi is new and rather different from traditional many-valued logics as well as from logics based on bilattices. Thus we try to build a bridge between the communities of higher order logic and many-valued logic..A case study is studied and a sequent calculus is proposed based on recent work by Muskens.作者: 極端的正確性 時(shí)間: 2025-3-31 17:51 作者: allergy 時(shí)間: 2025-3-31 23:35 作者: Myosin 時(shí)間: 2025-4-1 02:01 作者: ELUDE 時(shí)間: 2025-4-1 08:20 作者: cumber 時(shí)間: 2025-4-1 10:15
G. Beger,W. H. Uhl,M. W. Büchlerg ., and of opposite polarity. Note that for first order logic this restriction does not mean anything, since there are no higher order variables. However, when designing a proof search algorithm for first order logic only, one is naturally led into this fragment of higher order logic, where the algorithm works as well.
