662 search results - page 93 / 133 » Logic Programming with Ordered Disjunction |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
SOFTWARE
2011
13 years 2 months ago
2011
Developing parallel applications is notoriously diļ¬cult, but is even more complex for desktop applications. The added diļ¬culties are primarily because of their interactive nat...
PLILP
1992
Springer
13 years 11 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
LPNMR
1993
Springer
13 years 11 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reļ¬ect the c...