Innocence
发表于 2025-3-26 23:50:10
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:24
http://reply.papertrans.cn/16/1594/159366/159366_32.png
点燃
发表于 2025-3-27 05:46:25
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:05
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:37
http://reply.papertrans.cn/16/1594/159366/159366_35.png
独裁政府
发表于 2025-3-27 18:43:07
https://doi.org/10.1007/978-3-642-41524-1SAT; artificial intelligence; constraint problem solving; logic solvers; program transformation
欢乐中国
发表于 2025-3-27 23:59:36
http://reply.papertrans.cn/16/1594/159366/159366_37.png
Temporal-Lobe
发表于 2025-3-28 04:08:00
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:44
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.
挑剔小责
发表于 2025-3-28 10:50:54
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.