標(biāo)題: Titlebook: Applications of Declarative Programming and Knowledge Management; 19th International C Hans Tompits,Salvador Abreu,Armin Wolf Conference pr [打印本頁] 作者: collude 時間: 2025-3-21 18:08
書目名稱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é)科排名
作者: CRAFT 時間: 2025-3-21 22:29
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems preferred, semi-stable, and respectively, stage extensions) with new . encodings. Moreover, we provide novel encodings for the recently introduced resolution-based grounded semantics. Our experimental results indicate that the . approach works well in those cases where the complexity of the encoded作者: Nuance 時間: 2025-3-22 01:25
A Descriptive Approach to Preferred Answer Setsed in a more declarative style, independent on the given preference relation on the rules..An argumentation framework (different from Dung’s framework) is proposed in this paper. Some argumentation structures are assigned to the rules of a given program. Other argumentation structures are derived us作者: 險(xiǎn)代理人 時間: 2025-3-22 06:00 作者: Vo2-Max 時間: 2025-3-22 10:56 作者: Fillet,Filet 時間: 2025-3-22 13:04 作者: 讓你明白 時間: 2025-3-22 17:38 作者: 注意 時間: 2025-3-22 23:33 作者: 比賽用背帶 時間: 2025-3-23 04:57 作者: HUMID 時間: 2025-3-23 06:11 作者: STENT 時間: 2025-3-23 11:23
Every Formula-Based Logic Program Has a Least Infinite-Valued Modelto formula-based logic programs (i.e., finite sets of rules of the form . where . is an atom and . an arbitrary first-order formula). We construct for a given program . an interpretation . and show that it is the least of all models of ..作者: 放棄 時間: 2025-3-23 14:35
A Declarative Approach for Computing Ordinal Conditional Functions Using Constraint Logic Programminnstraint satisfaction problem. In particular, the approach developed here supports the generation of all minimal solutions; this also holds for different notions of minimality which we discuss and implement in CLP. Minimal solutions are of special interest as they provide a basis for model-based inference from R.作者: 直覺好 時間: 2025-3-23 18:48 作者: 四牛在彎曲 時間: 2025-3-24 02:04
Molly Chamblee,Kristine O. Evanse a declarative policy language for inconsistency management in multi-context systems. We define its syntax and semantics, discuss methodologies for applying the language in real world applications, and outline an implementation by rewriting to ., a formalism extending Answer Set Programs.作者: LARK 時間: 2025-3-24 02:21 作者: maroon 時間: 2025-3-24 08:49
https://doi.org/10.1007/978-1-4419-6996-5ised for another SMT fragment, namely that based on fixed-width bit-vector theories. Consequently, even further SMT solvers can be harnessed for the task of computing answer sets. The results of a preliminary experimental comparison are also reported. They suggest a level of performance which is similar to that achieved via difference logic.作者: Fantasy 時間: 2025-3-24 12:43
The IMPL Policy Language for Managing Inconsistency in Multi-Context Systemse a declarative policy language for inconsistency management in multi-context systems. We define its syntax and semantics, discuss methodologies for applying the language in real world applications, and outline an implementation by rewriting to ., a formalism extending Answer Set Programs.作者: 哀求 時間: 2025-3-24 16:33
A Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases soft consequence operator. Additionally, we present improved transformation-based approaches to query optimization and update propagation and view updating which are all using this operator as underlying evaluation mechanism.作者: 極力證明 時間: 2025-3-24 19:48
Translating Answer-Set Programs into Bit-Vector Logicised for another SMT fragment, namely that based on fixed-width bit-vector theories. Consequently, even further SMT solvers can be harnessed for the task of computing answer sets. The results of a preliminary experimental comparison are also reported. They suggest a level of performance which is similar to that achieved via difference logic.作者: Accommodation 時間: 2025-3-25 00:13
Conference proceedings 2013, INAP 2011, and the 25th Workshop on Logic Programming, WLP 2011, held in Vienna, Austria, in September 2011. The 19 papers presented in this volume were carefully reviewed and selected from 27 papers presented at the conference and initially a total of 35 submissions. The book also contains the pa作者: 邊緣 時間: 2025-3-25 04:47 作者: Prostaglandins 時間: 2025-3-25 10:59
Applications to Real Size Biological Systemsto formula-based logic programs (i.e., finite sets of rules of the form . where . is an atom and . an arbitrary first-order formula). We construct for a given program . an interpretation . and show that it is the least of all models of ..作者: 喧鬧 時間: 2025-3-25 13:59 作者: 刪除 時間: 2025-3-25 19:48 作者: acetylcholine 時間: 2025-3-25 21:56 作者: AUGUR 時間: 2025-3-26 00:12 作者: Foreknowledge 時間: 2025-3-26 07:13
Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranksresults from the ordinary Codd’s model of data in which we consider ordinal ranks of tuples in data tables expressing degrees to which tuples match queries. In this setting, we show that ranks assigned to tuples are insensitive to small changes, i.e., small changes in the input data do not yield lar作者: BABY 時間: 2025-3-26 11:56 作者: 可能性 時間: 2025-3-26 16:02
Translating Answer-Set Programs into Bit-Vector Logic, in a uniform way and then solved by computing answer sets for programs. The satisfiability modulo theories (SMT) framework follows a similar modelling philosophy but the syntax is based on extensions of propositional logic rather than rules. Quite recently, a translation from answer-set programs i作者: 騎師 時間: 2025-3-26 19:54
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systemsgnificantly evolved within the last decade. Recent work in the field has thus focused on implementations for these frameworks, whereby one of the main approaches is to use Answer-Set Programming (ASP). While some of the argumentation semantics can be nicely expressed within the ASP language, others 作者: Innocence 時間: 2025-3-26 23:50
Confidentiality-Preserving Publishing of EDPs for Credulous and Skeptical Usersdentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality.作者: nephritis 時間: 2025-3-27 04:51 作者: 點(diǎn)燃 時間: 2025-3-27 05:46
A Declarative Approach for Computing Ordinal Conditional Functions Using Constraint Logic Programminording to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a constraint satisfaction problem. We present a high-level, declarative approach using constraint logic programming (CLP) techniques for solving this co作者: 磨坊 時間: 2025-3-27 11:01
A Descriptive Approach to Preferred Answer Sets set of (standard) answer sets of the given program..It is shown in a seminal paper by Brewka and Eiter that the goal mentioned above is incompatible with their second principle and it is not satisfied in their semantics of prioritized logic programs. Similarly, also according to other established s作者: Influx 時間: 2025-3-27 14:16 作者: 獨(dú)裁政府 時間: 2025-3-27 18:43
https://doi.org/10.1007/978-3-642-41524-1SAT; artificial intelligence; constraint problem solving; logic solvers; program transformation作者: 歡樂中國 時間: 2025-3-27 23:59 作者: Temporal-Lobe 時間: 2025-3-28 04:08
The Parameterized Complexity of Constraint Satisfaction and Reasoningalgorithms for their solution. The framework provides adequate concepts for taking structural aspects of problem instances into account. We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction and Reasoning.作者: Adenoma 時間: 2025-3-28 08:52
Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranksresults from the ordinary Codd’s model of data in which we consider ordinal ranks of tuples in data tables expressing degrees to which tuples match queries. In this setting, we show that ranks assigned to tuples are insensitive to small changes, i.e., small changes in the input data do not yield large changes in the results of queries.作者: 挑剔小責(zé) 時間: 2025-3-28 10:50
Confidentiality-Preserving Publishing of EDPs for Credulous and Skeptical Usersdentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality.作者: 者變 時間: 2025-3-28 16:13
Hans Tompits,Salvador Abreu,Armin WolfProceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management, INAP.Proceedings of the 25th Workshop on Logic Programming, WLP 2011.Includes supp作者: accomplishment 時間: 2025-3-28 21:25 作者: Expiration 時間: 2025-3-28 23:34 作者: Engaging 時間: 2025-3-29 03:57 作者: Perennial長期的 時間: 2025-3-29 09:12 作者: 消毒 時間: 2025-3-29 13:25 作者: induct 時間: 2025-3-29 18:39
Molly Chamblee,Kristine O. Evans rules. Interlinking knowledge provides ample opportunity for unexpected inconsistencies. These are undesired and come in different categories: some may simply be repaired automatically, while others are more serious and must be inspected by a human operator. In general, no one-fits-all solution exi作者: happiness 時間: 2025-3-29 23:14
Accipitriformes Sensory Systemsalgorithms for their solution. The framework provides adequate concepts for taking structural aspects of problem instances into account. We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction an作者: Esalate 時間: 2025-3-30 02:08 作者: 保留 時間: 2025-3-30 04:47
Ganesh Kumar Maurya,Roshni Singhresults from the ordinary Codd’s model of data in which we consider ordinal ranks of tuples in data tables expressing degrees to which tuples match queries. In this setting, we show that ranks assigned to tuples are insensitive to small changes, i.e., small changes in the input data do not yield lar作者: BINGE 時間: 2025-3-30 12:05 作者: 連系 時間: 2025-3-30 12:53
https://doi.org/10.1007/978-1-4419-6996-5, in a uniform way and then solved by computing answer sets for programs. The satisfiability modulo theories (SMT) framework follows a similar modelling philosophy but the syntax is based on extensions of propositional logic rather than rules. Quite recently, a translation from answer-set programs i作者: 埋葬 時間: 2025-3-30 19:23
Ratnakumar V. Bugga,Marshall C. Smartgnificantly evolved within the last decade. Recent work in the field has thus focused on implementations for these frameworks, whereby one of the main approaches is to use Answer-Set Programming (ASP). While some of the argumentation semantics can be nicely expressed within the ASP language, others 作者: 緩解 時間: 2025-3-30 21:08
Amina A. Qutub,Aleksander S. Popeldentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality.作者: 熱烈的歡迎 時間: 2025-3-31 02:23
Applications to Real Size Biological Systems programs there do not exist least models in general. However, according to a recent approach by Rondogiannis and Wadge, who consider infinite-valued models, every normal logic program does have a least model with respect to a program-independent ordering. We show that this approach can be extended
