Sciweavers

24 search results - page 5 / 5
» slp 1997
Sort
View
SLP
1993
110views more  SLP 1993»
13 years 6 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
SLP
1994
77views more  SLP 1994»
13 years 6 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
SLP
1994
89views more  SLP 1994»
13 years 6 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
SLP
1997
102views more  SLP 1997»
13 years 6 months ago
Compositionality of Normal Open Logic Programs
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
Sofie Verbaeten, Marc Denecker, Danny De Schreye