754 search results - page 46 / 151 » An Ordered Logic Program Solver |
ICFP
2008
ACM
16 years 17 days ago
2008
ACM
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
112
Voted
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
83
Voted
WLP
1997
Springer
15 years 4 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
101
click to vote
PEPM
1993
ACM
15 years 4 months ago
1993
ACM
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
115
click to vote
AAAI
2008
15 years 2 months ago
2008
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...