Sciweavers

580 search results - page 66 / 116
» On the Foundations of Answer Set Programming
Sort
View
ENTCS
2006
115views more  ENTCS 2006»
13 years 8 months ago
Distributed Reactive XML
XML-centric models of computation have been proposed as an answer to the demand for interoperability, heterogeneity and openness in coordination models. We present a prototype imp...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen,...
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 9 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
NGC
2006
Springer
13 years 8 months ago
The Transformational Creativity Hypothesis
The work of Boden on the nature of creativity has been extremely influential, particularly the hypothesis that the highest form of creativity results from transformation of a conce...
Graeme Ritchie
ICLP
2003
Springer
14 years 1 months ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
IJCAI
1997
13 years 10 months ago
Compiling Prioritized Circumscription into Extended Logic Programs
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
Toshiko Wakaki, Ken Satoh