There have been many studies on termination analysis of logic programs but little has been done to analyze their non-termination, an even more important task, in our opinion. Non-termination analysis examines program ...
详细信息
We survey three of Paris Kanellakis's contributions to the complexity-theoretic analysis of constructs in the design of programming languages. These are (1) his result that first-order unification is complete for ...
详细信息
We attack an interesting open problem (an efficient algorithm to invert the generalized Cantor N-tupling bijection) and solve it through a sequence of equivalence preserving transformations of logic programs, that tak...
详细信息
We study the multiple specialization of logic programs based on abstract interpretation. This involves in general generating several versions of a program predicate for different uses of such predicate, making use of ...
详细信息
Answer Set programming (ASP) is a well-known AI formalism. Traditional ASP systems, that follow the 'ground&solve' approach, are intrinsically limited by the so-called grounding bottleneck. Basically, the ...
详细信息
Rules are definitely among the main kinds of knowledge representation in Artificial Intelligence. In recent years, there has been much discussion about production rules and logic programming to understand whether the ...
详细信息
Because query execution is the most crucial part of Induc- tive logic programming (ILP) algorithms, a lot of effort is invested in developing faster execution mechanisms. These execution mechanisms typically have a lo...
详细信息
Because query execution is the most crucial part of Induc- tive logic programming (ILP) algorithms, a lot of effort is invested in developing faster execution mechanisms. These execution mechanisms typically have a low-level implementation, making them hard to debug. Moreover, other factors such as the complexity of the problems handled by ILP algorithms and size of the code base of ILP data mining systems make debugging at this level a very difficult job. In this work, we present the trace-based debugging approach currently used in the development of new execution mechanisms in hipP, the engine underlying the ACE Data Mining system. This debugger uses the delta debugging algorithm to automatically reduce the total time needed to expose bugs in ILP execution, thus making manual debugging step much lighter.
The different semantics that can be assigned to a logic program correspond to different assumptions made concerning the atoms whose logical values cannot be inferred from the rules. Thus, the well founded semantics co...
详细信息
We propose an approach to placing usage-constraints on RT credentials;issuers specify constraints by designing non-deterministic finite automata. We show by examples that this approach can express constraints of pract...
详细信息
Answer Set programming is a well-known declarative programming paradigm proposed in the area of logic programming and non-monotonic reasoning. Although ASP features a simple syntax and an intuitive semantics, errors a...
详细信息
暂无评论