標(biāo)題: Titlebook: Applications of Declarative Programming and Knowledge Management; 17th International C Dietmar Seipel,Michael Hanus,Armin Wolf Conference p [打印本頁] 作者: Coenzyme 時(shí)間: 2025-3-21 19:11
書目名稱Applications of Declarative Programming and Knowledge Management影響因子(影響力)
書目名稱Applications of Declarative Programming and Knowledge Management影響因子(影響力)學(xué)科排名
書目名稱Applications of Declarative Programming and Knowledge Management網(wǎng)絡(luò)公開度
書目名稱Applications of Declarative Programming and Knowledge Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Applications of Declarative Programming and Knowledge Management被引頻次
書目名稱Applications of Declarative Programming and Knowledge Management被引頻次學(xué)科排名
書目名稱Applications of Declarative Programming and Knowledge Management年度引用
書目名稱Applications of Declarative Programming and Knowledge Management年度引用學(xué)科排名
書目名稱Applications of Declarative Programming and Knowledge Management讀者反饋
書目名稱Applications of Declarative Programming and Knowledge Management讀者反饋學(xué)科排名
作者: 古代 時(shí)間: 2025-3-21 21:38
Linear Weighted-Task-Sum – Scheduling Prioritized Tasks on a Single Resourceor the constraints within such constraint optimization problems, in particular for the constraints representing the objectives to be optimized, will result in faster convergence of branch?&?bound algorithms..This paper presents new pruning rules for linear weighted (task) sums where the summands are作者: Ostrich 時(shí)間: 2025-3-22 03:01
Efficient Edge-Finding on Unary Resources with Optional Activitiesin constraint programming environments. Often it depends on external factors if an activity will be included in the final schedule, making the activity optional. Currently known edge-finding algorithms cannot take optional activities into account. This paper introduces an edge-finding algorithm that作者: Blood-Vessels 時(shí)間: 2025-3-22 05:09 作者: 態(tài)學(xué) 時(shí)間: 2025-3-22 11:41
Constraint-Based Timetabling System for the German University in Cairoess. In this paper, we introduce the course and examination timetabling problems at the German University in Cairo. As manual generation of schedules is time-consuming and inconvenient, we show how these problems can be modeled as constraint satisfaction problems and can be solved using SICStus Prol作者: puzzle 時(shí)間: 2025-3-22 15:57 作者: auxiliary 時(shí)間: 2025-3-22 20:11
Relational Models for Tabling Logic Programs in a Databasehat compute large and/or many answers, memory exhaustion is a potential problem. In such cases, table deletion is the most common approach to recover space. In this work, we propose a different approach, storing tables into a relational database. Subsequent calls to stored tables import answers from作者: 結(jié)束 時(shí)間: 2025-3-23 01:00
Integrating XQuery and Logic Programming program. This logic program represents the document schema by means of rules and the document itself by means of facts. Now, XQuery expressions can be integrated into logic programming by considering a translation (i.e. encoding) of . expressions by means of logic rules and a goal.作者: FEIGN 時(shí)間: 2025-3-23 03:29
Causal Subgroup Analysis for Detecting Confounding by generating an extended causal subgroup network utilizing background knowledge. Using the links within the network we can identify relations that are potentially confounded by external (confounding) factors. In a semi-automatic approach, the network and the discovered relations are then presented作者: LAP 時(shí)間: 2025-3-23 06:08
Using Declarative Specifications of Domain Knowledge for Descriptive Data Miningproach for providing domain knowledge in a .: We utilize a Prolog knowledge base with facts for the specification of properties of ontological concepts and rules for the derivation of further ad-hoc relations between these concepts. This enhances the ., ., and . of the applied knowledge. Furthermore作者: 摘要記錄 時(shí)間: 2025-3-23 09:57
Integrating Temporal Annotations in a Modular Logic Languageeover, in those examples, time and modularity are considered orthogonal to each other. In this paper we propose the addition of temporal annotations to a modular extension of LP such that the usage of a module is influenced by temporal conditions. Besides illustrative examples we also provide an ope作者: 裙帶關(guān)系 時(shí)間: 2025-3-23 14:25 作者: harmony 時(shí)間: 2025-3-23 19:18
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semanticsaring of computed values. In this way, .-rewriting reflects the call-time choice semantics for non-determinism adopted by modern functional logic languages, where programs are rewrite systems possibly non-confluent and non-terminating. In this paper we extend that work providing a notion of .-narrow作者: TRACE 時(shí)間: 2025-3-24 00:05
Type Unification with Wildcardsex types can arise. The term...is for example a correct type in ...In this paper we present a type unification algorithm for . type terms. The algorithm unifies type terms, which are in subtype relationship. For this we define . type terms and its subtyping relation, formally..As . allows wildcards 作者: obsession 時(shí)間: 2025-3-24 03:07 作者: sacrum 時(shí)間: 2025-3-24 08:56 作者: carotenoids 時(shí)間: 2025-3-24 12:07 作者: ALIEN 時(shí)間: 2025-3-24 16:36 作者: accomplishment 時(shí)間: 2025-3-24 22:49
Encoding of Planning Problems and Their Optimizations in Linear Logic in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how some optimizations of planning problems can be encoded. These optimizations can help planners to improve the efficiency of finding solutions (plans).作者: HAWK 時(shí)間: 2025-3-25 00:01
Relational Models for Tabling Logic Programs in a Database the database, rather than performing a complete re-computation. To validate this approach, we have extended the YapTab tabling system, providing engine support for exporting and importing tables to and from the MySQL RDBMS. Three different relational models for data storage and two recordset retrieval strategies are compared.作者: itinerary 時(shí)間: 2025-3-25 07:08
Type Unification with Wildcardsas instances of generic types, the subtyping ordering contains infinite chains. We show that the type unification is still finitary. We give a type unification algorithm, which calculates the finite set of general unifiers.作者: GET 時(shí)間: 2025-3-25 10:53
0302-9743 . The topics covered are constraints; databases and data mining; extensions of logic programming; and system demonstrations.978-3-642-00674-6978-3-642-00675-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Explosive 時(shí)間: 2025-3-25 14:33 作者: Constant 時(shí)間: 2025-3-25 18:53
Kate Snyder,Kara Hume,Christi Carnahan the start times of tasks to be scheduled on an exclusively available resource and weighted by the tasks’ priorities. The presented pruning rules are proven to be correct and the speed-up of the optimization is shown in comparison with well-known general-purpose pruning rules for weighted sums.作者: 云狀 時(shí)間: 2025-3-25 20:00 作者: 小教堂 時(shí)間: 2025-3-26 01:15
Encyclopedia of Autism Spectrum Disorders the database, rather than performing a complete re-computation. To validate this approach, we have extended the YapTab tabling system, providing engine support for exporting and importing tables to and from the MySQL RDBMS. Three different relational models for data storage and two recordset retrieval strategies are compared.作者: BLAZE 時(shí)間: 2025-3-26 04:55 作者: macular-edema 時(shí)間: 2025-3-26 08:58 作者: BLANC 時(shí)間: 2025-3-26 16:36
7-Dehydrocholesterol Reductase Deficiency based on a lifting lemma for .-rewriting similar to Hullot’s lifting lemma for ordinary rewriting and narrowing. Our work copes with first order, left linear, constructor-based rewrite systems with no other restrictions about confluence, termination or presence of extra variables in right-hand sides of rules.作者: Tremor 時(shí)間: 2025-3-26 19:32 作者: STIT 時(shí)間: 2025-3-26 21:05 作者: Generalize 時(shí)間: 2025-3-27 04:17 作者: semiskilled 時(shí)間: 2025-3-27 06:13
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics based on a lifting lemma for .-rewriting similar to Hullot’s lifting lemma for ordinary rewriting and narrowing. Our work copes with first order, left linear, constructor-based rewrite systems with no other restrictions about confluence, termination or presence of extra variables in right-hand sides of rules.作者: 環(huán)形 時(shí)間: 2025-3-27 10:08
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc, alphabet of the context programs as well as the projection of the compared answer sets to a set of designated output atoms into account. This paper outlines a newly added component of .? for testing similarly parameterised correspondence problems based on ..作者: antiquated 時(shí)間: 2025-3-27 14:03
spock : A Debugging Support Tool for Logic Programs under the Answer-Set Semanticsper, we present the system ., a debugging support tool for answer-set programs making use of ASP itself. The implemented techniques maintain the declarative nature of ASP within the debugging process and are independent of the actual computation of answer sets.作者: 駕駛 時(shí)間: 2025-3-27 20:45 作者: 能量守恒 時(shí)間: 2025-3-27 22:42
A Guide for Manual Construction of Difference-List Proceduresroved and simplified rules are derived which substitute the formerly given ones. We can show that these rule allow us to write difference-list programs which supply result-lists that are either constructed in top-down -manner (elements in append order) or in bottom-up manner (elements in inverse order) in a simple schematic way.作者: uveitis 時(shí)間: 2025-3-28 03:50
0302-9743 ive Programming and Knowledge Management, INAP 2007, and the 21st Workshop on Logic Programming, WLP 2007, held in Würzburg, Germany, during October 4-6, 2007. The 16 thoroughly revised full papers presented together with 1 invited paper were carefully reviewed and selected from numerous submissions作者: 啟發(fā) 時(shí)間: 2025-3-28 07:28 作者: Blood-Clot 時(shí)間: 2025-3-28 11:00
Reference work 2021Latest editionre potentially confounded by external (confounding) factors. In a semi-automatic approach, the network and the discovered relations are then presented to the user as an intuitive visualization. The applicability and benefit of the presented technique is illustrated by examples from a case-study in the medical domain.作者: MORT 時(shí)間: 2025-3-28 15:37 作者: 故意 時(shí)間: 2025-3-28 21:21
https://doi.org/10.1007/978-3-319-91280-6o a modular extension of LP such that the usage of a module is influenced by temporal conditions. Besides illustrative examples we also provide an operational semantics together with a compiler, allowing this way for the development of applications based on such language.作者: 使殘廢 時(shí)間: 2025-3-29 00:37
Efficient Edge-Finding on Unary Resources with Optional Activitiesy optional. Currently known edge-finding algorithms cannot take optional activities into account. This paper introduces an edge-finding algorithm that finds restrictions for enabled . optional activities. The performance of this new algorithm is studied for modified job-shop and random-placement problems.作者: 可觸知 時(shí)間: 2025-3-29 03:23
Causal Subgroup Analysis for Detecting Confoundingre potentially confounded by external (confounding) factors. In a semi-automatic approach, the network and the discovered relations are then presented to the user as an intuitive visualization. The applicability and benefit of the presented technique is illustrated by examples from a case-study in the medical domain.作者: hair-bulb 時(shí)間: 2025-3-29 10:16 作者: 羅盤 時(shí)間: 2025-3-29 13:27
Integrating Temporal Annotations in a Modular Logic Languageo a modular extension of LP such that the usage of a module is influenced by temporal conditions. Besides illustrative examples we also provide an operational semantics together with a compiler, allowing this way for the development of applications based on such language.作者: Musket 時(shí)間: 2025-3-29 18:54 作者: 喃喃而言 時(shí)間: 2025-3-29 20:02 作者: 僵硬 時(shí)間: 2025-3-30 03:41 作者: 驚呼 時(shí)間: 2025-3-30 07:10
978-3-642-00674-6Springer-Verlag Berlin Heidelberg 2009作者: 寵愛 時(shí)間: 2025-3-30 12:17
https://doi.org/10.1007/978-3-319-91280-6 for automatic transformation of list programs into difference-list programs. However, we are interested in a construction of difference-list programs by the programmer, avoiding the need of a transformation. In [9] it was demonstrated, how left-recursive procedures with a dangling call of append/3 作者: 共同時(shí)代 時(shí)間: 2025-3-30 15:15 作者: 平常 時(shí)間: 2025-3-30 20:22
Encyclopedia of Autism Spectrum Disordersin constraint programming environments. Often it depends on external factors if an activity will be included in the final schedule, making the activity optional. Currently known edge-finding algorithms cannot take optional activities into account. This paper introduces an edge-finding algorithm that作者: 劇本 時(shí)間: 2025-3-30 23:27
Kate Snyder,Kara Hume,Christi Carnahaneasily understandable encoding of many problems. We concentrated on expressing planning problems by linear logic in this paper. We observed a rich usage of a construct of consumable resources in planning problem formulations. This fact motivates us to provide a possible encoding of planning problems作者: Banquet 時(shí)間: 2025-3-31 03:57
Kate Snyder,Kara Hume,Christi Carnahaness. In this paper, we introduce the course and examination timetabling problems at the German University in Cairo. As manual generation of schedules is time-consuming and inconvenient, we show how these problems can be modeled as constraint satisfaction problems and can be solved using SICStus Prol作者: badinage 時(shí)間: 2025-3-31 08:37
https://doi.org/10.1007/978-3-319-91280-6f the tables, and the logical relations between them..We have developed a tool named Squash (. Query Analyzer and Schema EnHancer) for visualizing, analyzing and refactoring database applications.Squash parses the . definition of the data-base schema and the queries into an . representation called S作者: VALID 時(shí)間: 2025-3-31 13:07
Encyclopedia of Autism Spectrum Disordershat compute large and/or many answers, memory exhaustion is a potential problem. In such cases, table deletion is the most common approach to recover space. In this work, we propose a different approach, storing tables into a relational database. Subsequent calls to stored tables import answers from作者: 捐助 時(shí)間: 2025-3-31 14:30
Reference work 2021Latest edition program. This logic program represents the document schema by means of rules and the document itself by means of facts. Now, XQuery expressions can be integrated into logic programming by considering a translation (i.e. encoding) of . expressions by means of logic rules and a goal.作者: GORGE 時(shí)間: 2025-3-31 20:26 作者: 施魔法 時(shí)間: 2025-3-31 23:24
Encyclopedia of Autism Spectrum Disordersproach for providing domain knowledge in a .: We utilize a Prolog knowledge base with facts for the specification of properties of ontological concepts and rules for the derivation of further ad-hoc relations between these concepts. This enhances the ., ., and . of the applied knowledge. Furthermore作者: 集合 時(shí)間: 2025-4-1 05:41
