Harrowing
发表于 2025-3-30 12:06:44
Towards an object-oriented methodology for deductive synthesis of logic programs,d inheritance (informally). In this paper, we show how our existing approach to deductive synthesis of logic programs can serve as the basis for an object-oriented methodology for formal program development that achieves reusability, extensibility and correctness (formally).
指数
发表于 2025-3-30 15:10:26
http://reply.papertrans.cn/59/5879/587880/587880_52.png
landfill
发表于 2025-3-30 18:23:53
Solving deductive planning problems using program analysis and transformation,em, are investigated. The work is based on a resource oriented approach to reasoning about actions and change using a logic programming paradigm. We show that ordinary resolution methods are insufficient for solving these problems and propose program analysis and transformation as a more promising and successful way to solve them.
敲竹杠
发表于 2025-3-30 22:55:07
http://reply.papertrans.cn/59/5879/587880/587880_54.png
Expediency
发表于 2025-3-31 04:57:02
https://doi.org/10.1007/3-540-60939-3Horn Clauses; Horn-Klauseln; Logic Programming; Logisches Programmieren; Program Semantics; Program Synth
上釉彩
发表于 2025-3-31 07:04:29
http://reply.papertrans.cn/59/5879/587880/587880_56.png
烦忧
发表于 2025-3-31 11:28:28
Complexity of Horn programs,This paper gives a method to estimate the space and time complexity of Horn programs executed under the OLDT search strategy (also called Earley Deduction or memoing).
失败主义者
发表于 2025-3-31 15:24:47
,Towards automatic control for CLP(χ) programs,We discuss issues of control for constraint logic programs. The problem we try to solve is to find, from the text of a program, a computation rule which ensures finiteness of the computation tree. In a single framework, we address two related areas, namely the generation of control annotations and the local level of control for partial deduction.
Fabric
发表于 2025-3-31 19:16:13
Ecological partial deduction: Preserving characteristic trees without constraints, which achieves the preservation of characteristic trees for . unfolding rule, . logic programs (it can even handle some built-in‘s if so desired) and . adding constraints to the partial deduction process (making the re-use of existing unfolding techniques very simple). We thus provide a powerful, g
使害羞
发表于 2025-3-31 22:15:12
Studying the cost of logic languages in an abstract interpretation framework for granularity analysogram. During transformed program execution, a process will be moved to a remote node only if the relation between the computational and communication costs given by the analysis will improve its execution.