標(biāo)題: Titlebook: Declarative Programming and Knowledge Management; Conference on Declar Dietmar Seipel,Michael Hanus,Salvador Abreu Conference proceedings 2 [打印本頁] 作者: raff淫雨霏霏 時間: 2025-3-21 17:15
書目名稱Declarative Programming and Knowledge Management影響因子(影響力)
書目名稱Declarative Programming and Knowledge Management影響因子(影響力)學(xué)科排名
書目名稱Declarative Programming and Knowledge Management網(wǎng)絡(luò)公開度
書目名稱Declarative Programming and Knowledge Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Declarative Programming and Knowledge Management被引頻次
書目名稱Declarative Programming and Knowledge Management被引頻次學(xué)科排名
書目名稱Declarative Programming and Knowledge Management年度引用
書目名稱Declarative Programming and Knowledge Management年度引用學(xué)科排名
書目名稱Declarative Programming and Knowledge Management讀者反饋
書目名稱Declarative Programming and Knowledge Management讀者反饋學(xué)科排名
作者: Truculent 時間: 2025-3-21 21:38
Run-Time Analysis of Temporal Constrained Objectsthe underlying constraint solving methods. We address this problem by extracting a run-time trace of the execution of a TCOB program and providing an analysis of the cause of error. The run-time trace also serves as a basis, in many cases, for constructing a finite-state machine which in turn can be作者: 好色 時間: 2025-3-22 03:56 作者: HILAR 時間: 2025-3-22 06:25 作者: 清晰 時間: 2025-3-22 12:01
Implementation of Logical Retraction in Constraint Handling Rules with Justificationssented a straightforward source-to-source transformation to implement this conservative extension. In this companion paper, we improve the performance of the transformation. We discuss its worst-case time complexity in general. Then we perform experiments. We benchmark the dynamic problem of maintai作者: 鉆孔 時間: 2025-3-22 15:36
The Proportional Constraint and Its Pruningefore rounding is used within its definition. For practical applications in finite domain Constraint Programming, pruning rules are presented and their correctness is proven. Further, it is shown by examples that the number of iterations necessary to reach a fixed-point while pruning depends on the 作者: 鉆孔 時間: 2025-3-22 17:59
An Operational Semantics for Constraint-Logic Imperative Programming data and operations working on them, as well as due to their support of inheritance. However, in contrast to constraint-logic languages, they are not particularly suited for solving search problems. During development of enterprise software, which occasionally requires some search, one option is to作者: 留戀 時間: 2025-3-23 01:04 作者: 存心 時間: 2025-3-23 03:29
Declarative Aspects in Explicative Data Mining for Computational Sensemakingsights and enhance understanding for supporting subsequent intelligent actions. Understandability and interpretability are key elements of that process as well as models and patterns captured therein. Here, . helps to include guiding knowledge structures into the process, while . provides interpreta作者: mechanism 時間: 2025-3-23 05:31
An Approach for Representing Answer Sets in Natural Language process, often it would be desirable to have a natural-language representation of answer sets, e.g., when dealing with domain experts unfamiliar with ASP. In this paper, we address this point and provide an approach for such a representation, defined in terms of a controlled natural language (CNL),作者: white-matter 時間: 2025-3-23 13:41
Techniques for Efficient Lazy-Grounding ASP Solvinge the ASP program to be variable-free, they thus ground the program upfront at the cost of a potential exponential explosion of the space required. Lazy-grounding, where solving and grounding are interleaved, circumvents this grounding bottleneck, but the resulting solvers lack many important search作者: SEMI 時間: 2025-3-23 14:55
The Syllogistic Reasoning Task: Reasoning Principles and Heuristic Strategies in Modeling Human Clusicipants’ answers systematically deviate from the classical logically correct answers. Recently, a new computational logic approach to modeling human syllogistic reasoning has been developed which seems to perform better than other state-of-the-art cognitive theories. We take this approach as starti作者: 財(cái)政 時間: 2025-3-23 20:44
Concolic Testing of Functional Logic Programseasing popularity. Concolic testing tools are initialized with expressions on concrete input data. But instead of just evaluating them, they additionally collect symbolic information along specific execution paths. This information can be used to systematically compute alternative inputs exploring y作者: FLEET 時間: 2025-3-24 00:06
Declarative XML Schema Validation with SWI–Prologlarative, currently available tools for . validation are not. In this paper we introduce an implementation of an . validator in .–Prolog, made publicly available as the package?.. Our approach is based on flattening the . and . documents into Prolog facts. The top–down validation makes great use of 作者: acrophobia 時間: 2025-3-24 05:17
plspec – A Specification Language for Prolog Dataype or mode are often made implicitly, without being directly represented in the source code. This complicates identifying the types or data structures anticipated by predicates. In consequence, Covington et?al. proposed that Prolog developers should implement their own runtime type checking system.作者: inspired 時間: 2025-3-24 08:55
0302-9743 ge Management, INAP 2017, the 31st Workshop on Logic Programming, WLP 2017, and the 25th Workshop on Functional and (Constraint) Logic Programming, WFLP 2017. The 12 full papers presented in this volume were carefully reviewed and selected from 26 submissions. The contributions were organized in top作者: ATOPY 時間: 2025-3-24 12:32 作者: STERN 時間: 2025-3-24 17:37
Demokratie als teleologisches Prinzips as well as models and patterns captured therein. Here, . helps to include guiding knowledge structures into the process, while . provides interpretability, transparency, and explainability. This paper provides an overview of the key points and important developments in these areas, and outlines future potential and challenges.作者: Esalate 時間: 2025-3-24 20:07
https://doi.org/10.1007/978-3-322-92248-9syllogistic reasoning has been developed which seems to perform better than other state-of-the-art cognitive theories. We take this approach as starting point, yet instead of trying to model . human reasoner, we aim at identifying clusters of reasoners, which can be characterized by reasoning principles or by heuristic strategies.作者: 是突襲 時間: 2025-3-25 01:10
Implementation of Logical Retraction in Constraint Handling Rules with Justifications of the transformation. We discuss its worst-case time complexity in general. Then we perform experiments. We benchmark the dynamic problem of maintaining shortest paths under addition and retraction of paths. The results validate our complexity considerations.作者: Afflict 時間: 2025-3-25 03:53
Declarative Aspects in Explicative Data Mining for Computational Sensemakings as well as models and patterns captured therein. Here, . helps to include guiding knowledge structures into the process, while . provides interpretability, transparency, and explainability. This paper provides an overview of the key points and important developments in these areas, and outlines future potential and challenges.作者: SUE 時間: 2025-3-25 10:32 作者: 先兆 時間: 2025-3-25 14:00 作者: 發(fā)酵劑 時間: 2025-3-25 18:14 作者: Range-Of-Motion 時間: 2025-3-25 20:26 作者: 占線 時間: 2025-3-26 01:34
https://doi.org/10.1007/978-3-658-34633-1Prolog’s backtracking and unification capabilities. To ensure the compliance to the . standard and to support the test–driven development, we have created a test framework based on the Test Anything Protocol and .–Prolog’s quasi–quotations.作者: 補(bǔ)助 時間: 2025-3-26 07:34
Aktuelle Probleme der Demokratie of declarative languages. In this work, we discuss the application of concolic testing to the functional logic language Curry. More precisely, we present ., a concolic interpreter which is adapted for the automated generation of test cases for both purely functional and non-deterministic programs.作者: 他姓手中拿著 時間: 2025-3-26 09:21
Concolic Testing of Functional Logic Programs of declarative languages. In this work, we discuss the application of concolic testing to the functional logic language Curry. More precisely, we present ., a concolic interpreter which is adapted for the automated generation of test cases for both purely functional and non-deterministic programs.作者: bypass 時間: 2025-3-26 15:07
Conference proceedings 2018ent, INAP 2017, the 31st Workshop on Logic Programming, WLP 2017, and the 25th Workshop on Functional and (Constraint) Logic Programming, WFLP 2017. The 12 full papers presented in this volume were carefully reviewed and selected from 26 submissions. The contributions were organized in topical secti作者: Default 時間: 2025-3-26 20:45
https://doi.org/10.1007/978-3-663-09578-1they have naturally drawn the attention of researchers in parallel constraint solving..In this paper, we address challenges faced when using multiple devices for constraint solving, especially GPUs, such as deciding on the appropriate level of parallelism to employ, load balancing and inter-device communication, and present our current solutions.作者: 積云 時間: 2025-3-26 20:56
Demokratie als Ordnungsbegriff,ive modeling of the Proportional Constraint is presented. The run-times of the implementations of both alternatives are compared showing that the implementation of the Proportional Constraint on the basis of the presented pruning rules performs always better on sample problem classes.作者: FRONT 時間: 2025-3-27 01:13 作者: slow-wave-sleep 時間: 2025-3-27 07:09
https://doi.org/10.1007/978-3-658-17369-2s of a given constraint network to cores for parallel constraint solving. Our benchmark evaluations have shown that?. can relatively evenly decompose a hypergraph for specific scale of constraint networks. Besides, we obtained competitive execution time as long as the hypergraphs are sufficiently simple.作者: Agnosia 時間: 2025-3-27 13:11 作者: bacteria 時間: 2025-3-27 17:03 作者: GORGE 時間: 2025-3-27 20:55 作者: 躺下殘殺 時間: 2025-3-27 23:08 作者: acrimony 時間: 2025-3-28 02:44 作者: floaters 時間: 2025-3-28 09:47 作者: Generalize 時間: 2025-3-28 14:04
Techniques for Efficient Lazy-Grounding ASP Solvingchnique of efficient ASP solving. This work presents how techniques for efficient propagation can be lifted to the lazy-grounding setting. The Alpha solver and its components are presented and detailed benchmarks comparing Alpha to other ASP solvers demonstrate the feasibility of this approach.作者: Magnitude 時間: 2025-3-28 16:28 作者: facilitate 時間: 2025-3-28 22:15
An Approach for Representing Answer Sets in Natural Language which in turn relies on the annotation language . for the specification of meta-information for answer-set programs. Our approach has been implemented as an Eclipse plug-in for ., a dedicated IDE for ASP.作者: 南極 時間: 2025-3-29 00:25 作者: constellation 時間: 2025-3-29 05:42
Declarative Programming and Knowledge Management978-3-030-00801-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: AGOG 時間: 2025-3-29 10:32 作者: 梯田 時間: 2025-3-29 11:33 作者: radiograph 時間: 2025-3-29 16:06 作者: 吞噬 時間: 2025-3-29 19:53 作者: Substance 時間: 2025-3-30 03:52
Demokratie als Ordnungsbegriff,efore rounding is used within its definition. For practical applications in finite domain Constraint Programming, pruning rules are presented and their correctness is proven. Further, it is shown by examples that the number of iterations necessary to reach a fixed-point while pruning depends on the 作者: 飲料 時間: 2025-3-30 05:43 作者: 油氈 時間: 2025-3-30 12:17 作者: 反話 時間: 2025-3-30 16:00 作者: Calibrate 時間: 2025-3-30 20:31
Albrecht Graf v. Kalnein,Ulrich Willems process, often it would be desirable to have a natural-language representation of answer sets, e.g., when dealing with domain experts unfamiliar with ASP. In this paper, we address this point and provide an approach for such a representation, defined in terms of a controlled natural language (CNL),作者: 農(nóng)學(xué) 時間: 2025-3-30 23:20 作者: 削減 時間: 2025-3-31 02:17 作者: wreathe 時間: 2025-3-31 05:24 作者: 讓你明白 時間: 2025-3-31 12:36 作者: 縱火 時間: 2025-3-31 14:29
Birgit Stark,Uta Ru?mann,Melanie Maginype or mode are often made implicitly, without being directly represented in the source code. This complicates identifying the types or data structures anticipated by predicates. In consequence, Covington et?al. proposed that Prolog developers should implement their own runtime type checking system.
