Titlebook: Applications of Declarative Programming and Knowledge Management; 17th International C Dietmar Seipel,Michael Hanus,Armin Wolf Conference p

Coenzyme

書目名稱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é)科排名

古代

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

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

態(tài)學(xué)

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

auxiliary

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é)束

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

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

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