Sciweavers

764 search results - page 76 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
FOAL
2007
ACM
15 years 3 months ago
On the relation of aspects and monads
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
Christian Hofer, Klaus Ostermann
SIGSOFT
2010
ACM
14 years 9 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
DALT
2005
Springer
15 years 5 months ago
Agent-Oriented Programming with Underlying Ontological Reasoning
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...
Álvaro F. Moreira, Renata Vieira, Rafael H....
LPNMR
2005
Springer
15 years 5 months ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
ICALP
2009
Springer
15 years 4 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn