the standard selection rule in logicprogramming always selects the leftmost atom in each query. But for some applications this rule is not adequate, and dynamic scheduling, i.e. a mechanism to determine the selected ...
ISBN:
(纸本)3540206426
the standard selection rule in logicprogramming always selects the leftmost atom in each query. But for some applications this rule is not adequate, and dynamic scheduling, i.e. a mechanism to determine the selected atom at runtime, is needed. the complex (non-)termination behaviour related to dynamic scheduling has first been observed by Naish [3].
In an important recent paper, Lin and Zhao introduced the concept of a loop formula, and showed that the answer sets for a logic program are exactly the models of Clark's completion of the program that satisfy the...
详细信息
In an important recent paper, Lin and Zhao introduced the concept of a loop formula, and showed that the answer sets for a logic program are exactly the models of Clark's completion of the program that satisfy the loop formulas. Just as supported sets are a model-theoretic account of completion, "externally supported" sets, defined in this paper, are a model-theoretic counterpart of loop formulas. this reformulation of loop formulas shows that they are related to assumption sets (Sacca and Zaniolo) and to unfounded sets (Van Gelder, Ross and Schlipf;Leone, Rullo and Scarcello), invented many years earlier. Other contributions of this paper includes a simplification of the definition of a loop, extending it to programs with classical negation and infinite programs, and a generalization of the definition of a loop formula.
We present results concerning the computational complexity of the key execution mechanisms required to handle Dependent And-Parallel executions in logicprogramming. We develop formal abstractions of the problems in t...
详细信息
ISBN:
(纸本)3540206426
We present results concerning the computational complexity of the key execution mechanisms required to handle Dependent And-Parallel executions in logicprogramming. We develop formal abstractions of the problems in terms of dynamic trees, design efficient data structures, and present some lower bound results. this work is part of a larger effort to understand, formalize, and study the complexity-theoretic and algorithmic issues in parallel implementations of logicprogramming.
Concolic testing is a well-known validation technique for imperative and object-oriented programs. We have recently introduced an adaptation of this technique to logicprogramming. At the heart of our framework for co...
详细信息
ISBN:
(纸本)9781450352918
Concolic testing is a well-known validation technique for imperative and object-oriented programs. We have recently introduced an adaptation of this technique to logicprogramming. At the heart of our framework for concolic testing lies a logicprogramming specific procedure that we call "selective unification". In this paper, we consider concolic testing in the context of constraint logicprogramming and extend the notion of selective unification accordingly. We prove that the selective unification problem is generally undecidable for constraint logic programs, and we present a correct and complete algorithm for selective unification in the context of a class of constraint structures.
We introduce a general framework for specifying program correspondence under the answer-set semantics. the framework allows to define different kinds of equivalence notions, including previously defined notions like s...
详细信息
We introduce a general framework for specifying program correspondence under the answer-set semantics. the framework allows to define different kinds of equivalence notions, including previously defined notions like strong and uniform equivalence, in which programs are extended with rules from a given context, and correspondence is determined by means of a binary relation. In particular, refined equivalence notions based on projected answer sets can be defined within this framework, where not all parts of an answer set are of relevance. We study general characterizations of inclusion and equivalence problems, introducing novel semantical structures. Furthermore, we deal withthe issue of determining counterexamples for a given correspondence problem, and we analyze the computational complexity of correspondence checking.
this paper proposes the design of an ontology of multiple programming languages and give three examples to show the methodology. Our ontology aims to summarize the core of computational thinking logic by elaborating t...
详细信息
this paper presents an FPGA implementation of a low cost 8bit reconfigurable processor core for media processing applications. the core is optimized to provide all basic arithmetic and logic functions required by the ...
详细信息
ISBN:
(纸本)9781424438914
this paper presents an FPGA implementation of a low cost 8bit reconfigurable processor core for media processing applications. the core is optimized to provide all basic arithmetic and logic functions required by the media processing and other domains, as well as to make it easily integrable into a 2D array. this paper presents an investigation of the feasibility of the core as a potential soft processing architecture for FPGA platforms. the core was synthesized on the entire Virtex FPGA family to evaluate its overall performance, scalability and portability. A special feature of the proposed architecture is its simple programming model which allows low level programming. throughput results for popular benchmarks coded using the programming model and cycle accurate simulator are presented.
We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer set...
详细信息
ISBN:
(纸本)3540206426
We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. the concept of a tight program and Fages' theorem are extended to disjunctive programs as well.
作者：
Morozov, AARAS
Inst Radio Engn & Elect Moscow 125009 Russia
One of the most interesting and promising approaches to programming Internet agents is logicprogramming of agents. this approach has good prospects, because the ideology and principles of logicprogramming are very c...
ISBN:
(纸本)3540206426
One of the most interesting and promising approaches to programming Internet agents is logicprogramming of agents. this approach has good prospects, because the ideology and principles of logicprogramming are very convenient for searching, recognition, and analysis of unstructured, poorly structured, and hypertext information. Many ideas and methods of logicprogramming of Internet agents based on various modifications of Prolog and non-classical logic (linear, modal, etc.) were developed during the recent decade. Nevertheless, there has been no mathematical apparatus providing sound and complete operation of logic programs in the dynamic Internet environment (i.e., under conditions of permanent update and revision of information). To solve this problem, we have created a mathematical apparatus based on the principle of repeated proving of sub-goals (so-called logical actors).
this paper presents an approach for the application of clustering algorithms to uncover computer programming learning profiles by using evidence extracted from source code metrics. A system for automatic assessment of...
详细信息
ISBN:
(纸本)9781728134857
this paper presents an approach for the application of clustering algorithms to uncover computer programming learning profiles by using evidence extracted from source code metrics. A system for automatic assessment of programming activities featuring capture of source code metrics was developed, in order to build a dataset containing metrics extracted from programs developed by beginners in a computing course. the dataset was submitted to three clustering algorithms. the results were promising when clustering students according to these indicators using the K-means algorithm.
暂无评论