蒙太奇
发表于 2025-3-26 23:51:03
Datalog with non-deterministic choice computes ,,augmented with the dynamic choice expresses exactly the non deterministic time-polynomial queries. We thus obtain a complete characterization of the expressiveness of the dynamic choice, and conversely achieve a characterization of the class of queries . by means of a simple, declarative and efficiently implementable language.
变化无常
发表于 2025-3-27 02:32:14
http://reply.papertrans.cn/27/2646/264516/264516_32.png
灰姑娘
发表于 2025-3-27 05:48:35
An implementation overview of the Aditi deductive database system,valuation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures.
xanthelasma
发表于 2025-3-27 10:17:08
http://reply.papertrans.cn/27/2646/264516/264516_34.png
凝乳
发表于 2025-3-27 15:05:13
http://reply.papertrans.cn/27/2646/264516/264516_35.png
orthodox
发表于 2025-3-27 21:13:16
http://reply.papertrans.cn/27/2646/264516/264516_36.png
小步舞
发表于 2025-3-27 23:58:48
On efficient reasoning with implication constraints, as the .. We show that several other important problems, such as the query containment problem, are polynomially equivalent to the IC-refuting problem. More importantly, we give criteria for designing a set of implication constraints so that an efficient process, called “units-refutation” process can be used to solve the IC-refuting problem.
混沌
发表于 2025-3-28 04:43:49
http://reply.papertrans.cn/27/2646/264516/264516_38.png
耐寒
发表于 2025-3-28 09:21:11
http://reply.papertrans.cn/27/2646/264516/264516_39.png
坦白
发表于 2025-3-28 13:19:50
http://reply.papertrans.cn/27/2646/264516/264516_40.png