81 search results - page 1 / 17 » Extending Homeomorphic Embedding in the Context of Logic Pro... |
WLP
1997
Springer
13 years 8 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...
LOPSTR
1998
Springer
13 years 9 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
LOPSTR
2007
Springer
13 years 10 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
LICS
1991
IEEE
13 years 8 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
EPIA
2005
Springer
13 years 10 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...