1151 search results - page 108 / 231 » Collaborative Programming: Applications of Logic and Automat... |
169
click to vote
LPNMR
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
151
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
184
click to vote
FOIKS
2006
Springer
15 years 9 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
166
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
158
click to vote
ICLP
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...