|
СТ |
Declarative Semantics of Input Consuming Logic Programs |
2004 |
Bossi A., Cocco N., Etalle S., Rossi S. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
31.07.2004 |
|
СТ |
Transformation of Left Terminating Programs |
2000 |
Bossi A., Cocco N., Etalle S. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
30.08.2000 |
|
СТ |
Success in Logic Programs |
1999 |
Bossi A., Cocco N. |
|
|
|
Lecture Notes in Computer Science |
16.04.1999 |
|
СТ |
Programs Without Failures |
1998 |
Bossi A., Cocco N. |
|
|
|
Lecture Notes in Computer Science |
14.10.1998 |
|
СТ |
Replacement Can Preserve Termination |
1997 |
Bossi A., Cocco N. |
|
|
|
Lecture Notes in Computer Science |
12.04.1997 |
|
СТ |
Transformation of Left Terminating Programs: the Reordering Problem |
1996 |
Bossi A., Cocco N., Etalle S. |
|
|
|
Lecture Notes in Computer Science |
30.03.1996 |
|
СТ |
Preserving Universal Termination through Unfold/Fold |
1994 |
Bossi A., Cocco N. |
|
|
|
Lecture Notes in Computer Science |
01.11.1994 |
|
СТ |
Transforming Normal Programs by Replacement |
1992 |
Bossi A., Cocco N., Etalle S. |
|
|
|
Lecture Notes in Computer Science |
03.02.1993 |
|
СТ |
On Safe Folding |
1992 |
Bossi A., Cocco N., Etalle S. |
|
|
|
Lecture Notes in Computer Science |
13.10.1992 |
|
СТ |
Proving Termination of Logic Programs by Exploiting Term Properties |
1991 |
Bossi A., Cocco N., Fabris M. |
|
|
|
Lecture Notes in Computer Science |
21.05.1991 |
