|
СТ |
Characterisations of Termination in Logic Programming |
2004 |
Pedreschi D., Ruggieri S., Smaus J. -G. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
31.07.2004 |
|
СТ |
Mode Analysis Domains foe Typed Logic Programs |
2000 |
Smaus J. -G., Hill P. M., King A. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
30.08.2000 |
|
СТ |
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations |
1999 |
Smaus J. -G., Hill P., King A. |
|
|
|
Lecture Notes in Computer Science |
16.04.1999 |
|
СТ |
Proving Termination of Input-Consuming Logic Programs |
1999 |
Smaus J. -G. |
|
|
|
Logic Programming |
07.03.2001 |
|
СТ |
Quotienting Share for Dependency Analysis |
1999 |
King A., Smaus J. -G., Hill P. |
|
|
|
Lecture Notes in Computer Science |
07.04.1999 |
|
СТ |
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling |
2001 |
Bossi A., Etalle S., Rossi S., Smaus J. -G. |
|
|
|
Lecture Notes in Computer Science |
28.04.2001 |
|
СТ |
Termination of Logic Programs with Block Declarations Running in Several Modes |
1998 |
Smaus J. -G., Hill P., King A. |
|
|
|
Lecture Notes in Computer Science |
13.10.1998 |
|
СТ |
Using Modes to Ensure Subject Reduction for Typed Logic Progranms with Subtyping |
2000 |
Smaus J. -G., Fages F., Deransart P. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
31.01.2001 |
|
СТ |
Well-Typed Logic Programs Are not Wrong |
2001 |
Detaransart P., Smaus J. -G. |
|
|
|
Lecture Notes in Computer Science |
06.04.2001 |
