標(biāo)題: Titlebook: Constraints in Computational Logics; First International Jean-Pierre Jouannaud Conference proceedings 1994 Springer-Verlag Berlin Heidelbe [打印本頁] 作者: affected 時(shí)間: 2025-3-21 18:54
書目名稱Constraints in Computational Logics影響因子(影響力)
書目名稱Constraints in Computational Logics影響因子(影響力)學(xué)科排名
書目名稱Constraints in Computational Logics網(wǎng)絡(luò)公開度
書目名稱Constraints in Computational Logics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Constraints in Computational Logics被引頻次
書目名稱Constraints in Computational Logics被引頻次學(xué)科排名
書目名稱Constraints in Computational Logics年度引用
書目名稱Constraints in Computational Logics年度引用學(xué)科排名
書目名稱Constraints in Computational Logics讀者反饋
書目名稱Constraints in Computational Logics讀者反饋學(xué)科排名
作者: 物種起源 時(shí)間: 2025-3-21 22:20 作者: 自傳 時(shí)間: 2025-3-22 00:45
Local simplification,h clause. The constraints are created when new clauses are generated and inherited by the descendants of that clause. Then the constraints can be used to perform demodulation and unit simplification, if certain conditions are satisfied. This reduces the search space of the theorem proving procedure 作者: omnibus 時(shí)間: 2025-3-22 08:38
Simplifying clausal satisfiability problems,g method that simplifies the linear 0–1 integer problem corresponding to a clausal satisfiability problem. Valid extended clauses, a generalization of classical clauses, are added to the problem as long as they dominate at least one extended clause of the problem. We describe how to efficiently obta作者: Armory 時(shí)間: 2025-3-22 11:15
Ordered Binary Decision Diagrams and the Davis-Putnam procedure,al results indicate that the Davis-Putnam procedure outperforms .s in hard constraint-satisfaction problems, while .s are clearly superior for Boolean functional equivalence problems from the circuit domain, and, in general, problems that require the schematization of a large number of solutions tha作者: moribund 時(shí)間: 2025-3-22 14:23 作者: moribund 時(shí)間: 2025-3-22 17:16
Constraints for polymorphic behaviours of concurrent ML,cution and resemble terms of a process algebra. The algorithm uses unification for the (essentially) free algebra of types and algebraic reconstruction for collecting constraints for the non-free algebra of behaviours. The algorithm and the statement and proof of soundness are designed so as to make作者: 健談的人 時(shí)間: 2025-3-22 23:54
A confluent relational calculus for higher-order programming with constraints,ogramming with first-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform confluence of the .-calculus. Uniform confluence implies that all maximal derivations i作者: LAIR 時(shí)間: 2025-3-23 04:46 作者: ABOUT 時(shí)間: 2025-3-23 07:01
Higher order disunification: Some decidable cases,l connectives ∧ and ∨ and universal and existential quantification. Contrary to the first-order case, higher-order disunification is undecidable and even not semi-decidable since it contains higher-order unification and its negation. Therefore we merely give general rules to simplify the basic const作者: 談判 時(shí)間: 2025-3-23 12:07 作者: acquisition 時(shí)間: 2025-3-23 17:42 作者: 大笑 時(shí)間: 2025-3-23 21:12 作者: 粗魯?shù)娜?nbsp; 時(shí)間: 2025-3-24 00:11
Path consistency in clp(FD),. constraint-solver of the clp(FD) system. Besides the clp(FD) . encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call ., which encode path-consistency methods. We describe how to accommodate these new constraints in the clp(FD) extended WAM architecture.作者: 膽大 時(shí)間: 2025-3-24 03:51 作者: invade 時(shí)間: 2025-3-24 08:51 作者: 陰險(xiǎn) 時(shí)間: 2025-3-24 14:42 作者: Irrepressible 時(shí)間: 2025-3-24 16:25
Liliana Miranda Sara,Karin Pfeffer,Isa Baudrd types. Previous approaches either lacked the principal type property or had to resort to adapting the types to the algorithm. The simplicity of our record calculus gives us principal types without having to make the types more complicated.作者: Platelet 時(shí)間: 2025-3-24 19:20
A record calculus with principal types,rd types. Previous approaches either lacked the principal type property or had to resort to adapting the types to the algorithm. The simplicity of our record calculus gives us principal types without having to make the types more complicated.作者: 態(tài)學(xué) 時(shí)間: 2025-3-25 01:44 作者: champaign 時(shí)間: 2025-3-25 05:06
Attosecond Polarization Spectroscopy, functional equivalence problems from the circuit domain, and, in general, problems that require the schematization of a large number of solutions that share a common structure. The two methods illustrate the different and often complementary strengths of constraint-oriented and search-oriented procedures.作者: 伸展 時(shí)間: 2025-3-25 07:52
Marcos Villagra,Abuzer Yakary?lmazrrent constraint programming language Oz. We prove the uniform confluence of the .-calculus. Uniform confluence implies that all maximal derivations issuing from a given expression have equal length. But even confluence of a nonfunctional calculus modelling computation with partial information is interesting on its own right.作者: 著名 時(shí)間: 2025-3-25 14:43 作者: Eclampsia 時(shí)間: 2025-3-25 18:46
Jonathan Wilcox,Sarah Bell,Fuzhan Nasirind to execute them. The evaluation mechanism is based on the one hand on the deduction rules specified in the (constraint) logic, and on the other hand on the resolution rules for constraints. ECOLOG is implemented in CAML.作者: 無孔 時(shí)間: 2025-3-25 20:04 作者: 尊敬 時(shí)間: 2025-3-26 01:08
Simplifying clausal satisfiability problems,in these valid extended clauses and apply the method to some combinatorial satisfiability problems. The reformulated 0–1 problems contain less but usually . 0–1 inequalities and are typically solved much faster than the original one with traditional 0–1 integer programming methods.作者: arsenal 時(shí)間: 2025-3-26 05:19 作者: alliance 時(shí)間: 2025-3-26 12:21 作者: ANN 時(shí)間: 2025-3-26 13:14 作者: iodides 時(shí)間: 2025-3-26 20:11
Conference proceedings 1994 issues of combining and extending programming paradigms, preferably by using constraints. The topics covered include symbolic constraints, set constraints, numerical constraints, multi-paradigm programming, combined calculi, constraints in rewriting, deduction, symbolic computations, and working systems.作者: 破譯密碼 時(shí)間: 2025-3-26 21:49
0302-9743 set constraints, numerical constraints, multi-paradigm programming, combined calculi, constraints in rewriting, deduction, symbolic computations, and working systems.978-3-540-58403-2978-3-540-48699-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 慢跑鞋 時(shí)間: 2025-3-27 04:01
Lecture Notes in Computer Science-calculus with logic variables..The .-calculus can be extended with primitives providing for constraint-based problem solving in the style of logic programming. A such extended .-calculus has the remarkable property that it combines first-order constraints with higher-order programming.作者: condone 時(shí)間: 2025-3-27 08:12
Ukrainian Migration to the European Union obtained by combining the algorithm for pure patterns and an AC unification algorithm for free patterns. Theoretically, the result presented here implies the decidability of AC unification of patterns. Practically, our algorithm can be used to extend higher-order logic programming and proof systems with AC operators.作者: falsehood 時(shí)間: 2025-3-27 11:34 作者: 挑剔小責(zé) 時(shí)間: 2025-3-27 17:34 作者: 前面 時(shí)間: 2025-3-27 19:35
Modular AC unification of higher-order patterns, obtained by combining the algorithm for pure patterns and an AC unification algorithm for free patterns. Theoretically, the result presented here implies the decidability of AC unification of patterns. Practically, our algorithm can be used to extend higher-order logic programming and proof systems with AC operators.作者: 有危險(xiǎn) 時(shí)間: 2025-3-28 00:00 作者: 捕鯨魚叉 時(shí)間: 2025-3-28 03:17 作者: 一再困擾 時(shí)間: 2025-3-28 06:15
A confluent relational calculus for higher-order programming with constraints,rrent constraint programming language Oz. We prove the uniform confluence of the .-calculus. Uniform confluence implies that all maximal derivations issuing from a given expression have equal length. But even confluence of a nonfunctional calculus modelling computation with partial information is interesting on its own right.作者: 集合 時(shí)間: 2025-3-28 11:24
Repeated redundant inequalities in constraint logic programming,nstraint set, thus resulting in dramatic savings in execution speed and space usage. We generalize the notion of future redundancy in a number of ways and thus broaden its applicability. Thus we show how to dramatically improve the performance of a wider class of programs that rely heavily on linear inequalities.作者: 暗諷 時(shí)間: 2025-3-28 15:03
ECOLOG: an Environment for constraint logics,nd to execute them. The evaluation mechanism is based on the one hand on the deduction rules specified in the (constraint) logic, and on the other hand on the resolution rules for constraints. ECOLOG is implemented in CAML.作者: mastoid-bone 時(shí)間: 2025-3-28 20:57
Introduction and Background Physics,and the length of the proofs obtained. We show that this process is sound, complete, and compatible with deletion rules (e.g., demodulation, subsumption, unit simplification, and tautology deletion), which do not have to be modified to preserve completeness. We also show the relationship between this technique and model elimination.作者: 防御 時(shí)間: 2025-3-29 01:05
Attosecond Polarization Spectroscopy,in these valid extended clauses and apply the method to some combinatorial satisfiability problems. The reformulated 0–1 problems contain less but usually . 0–1 inequalities and are typically solved much faster than the original one with traditional 0–1 integer programming methods.作者: 高射炮 時(shí)間: 2025-3-29 03:47
Lecture Notes in Computer Science no assumptions on the existence of “principal” be-haviours as these are unlikely to exist. The main complication is that the notion of expansiveness does not suffice for a sufficiently general treatment of the polymorphic let-construct.作者: 廢除 時(shí)間: 2025-3-29 08:22 作者: 轉(zhuǎn)換 時(shí)間: 2025-3-29 13:23
Sarah Bell,Adriana Allen,Tse-Hui Tehconsider solving equations modulo a theory given by a TRS. Here we present a modular narrowing strategy that can be combined with nearly all common narrowing strategies. Furthermore, we also prove some modularity results for decidability of unification and matching (via termination of narrowing).作者: 懲罰 時(shí)間: 2025-3-29 19:07 作者: vasospasm 時(shí)間: 2025-3-29 22:22 作者: Aspiration 時(shí)間: 2025-3-30 02:59 作者: 系列 時(shí)間: 2025-3-30 07:41
Attosecond Polarization Spectroscopy,al results indicate that the Davis-Putnam procedure outperforms .s in hard constraint-satisfaction problems, while .s are clearly superior for Boolean functional equivalence problems from the circuit domain, and, in general, problems that require the schematization of a large number of solutions tha作者: 排他 時(shí)間: 2025-3-30 09:48
Lecture Notes in Computer Science (both eager and lazy) and concurrent objects with encapsulated state and multiple inheritance. The primitives of the .-calculus are logic variables, names, procedural abstraction, and cells. Cells provide a notion of state that is fully compatible with concurrency and constraints. Although it does 作者: 新奇 時(shí)間: 2025-3-30 15:19
Lecture Notes in Computer Sciencecution and resemble terms of a process algebra. The algorithm uses unification for the (essentially) free algebra of types and algebraic reconstruction for collecting constraints for the non-free algebra of behaviours. The algorithm and the statement and proof of soundness are designed so as to make作者: prediabetes 時(shí)間: 2025-3-30 16:41
Marcos Villagra,Abuzer Yakary?lmazogramming with first-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform confluence of the .-calculus. Uniform confluence implies that all maximal derivations i作者: FLEET 時(shí)間: 2025-3-31 00:37
Ukrainian Migration to the European Unionts of a free variable are always .-equal to distinct bound variables. A pattern is called . if it can be written as λ.. ... λ...s.+...+.., where + is an AC function symbol and each .. is either a bound variable or a subterm starting with a free variable. As the main part of the paper, we propose an 作者: FECT 時(shí)間: 2025-3-31 01:01 作者: Decrepit 時(shí)間: 2025-3-31 06:47
https://doi.org/10.1007/978-3-319-42243-5all, usually in the context of a recursive procedure. It has been noted that such inequalities need only be tested for consistency with the current constraint set, thus resulting in dramatic savings in execution speed and space usage. We generalize the notion of future redundancy in a number of ways作者: aspersion 時(shí)間: 2025-3-31 09:35 作者: 外來 時(shí)間: 2025-3-31 16:19 作者: Intact 時(shí)間: 2025-3-31 19:14
The California Current Upwelling System,. constraint-solver of the clp(FD) system. Besides the clp(FD) . encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call ., which encode path-consistency methods. We describe how to accommodate these new constraints in the clp(FD) extended WAM architecture.作者: 技術(shù) 時(shí)間: 2025-4-1 00:09
Liliana Miranda Sara,Karin Pfeffer,Isa Baudcord calculus that has neither concatenation nor adjunction but is still sufficient for object-oriented languages with top-level classes. The type discipline features extensible record types and recursive types. For the formalization of the type inference algorithm and for the proofs showing its cor作者: CT-angiography 時(shí)間: 2025-4-1 05:13 作者: chastise 時(shí)間: 2025-4-1 07:29
Sarah Bell,Adriana Allen,Tse-Hui Tehhe idea is, that every normalization with ..+.. may be obtained by first normalizing with .. followed by an .. normalization..We develop criteria for this that cover non-convergent TRS ., where, as the main restriction, .. is required to be left-linear and convergent. As interesting applications we 作者: Ischemia 時(shí)間: 2025-4-1 10:48 作者: Armada 時(shí)間: 2025-4-1 14:44
https://doi.org/10.1007/BFb0016839Computational Logics; Constraint Programming; Constraint-Programmieren; Logic Programming; Logisches Pro
