Sciweavers

966 search results - page 107 / 194
» Communicating Answer Set Programs
Sort
View
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
15 years 6 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
119
Voted
CHI
2003
ACM
16 years 2 months ago
Media inequality in conversation: how people behave differently when interacting with computers and people
How is interacting with computer programs different from interacting with people? One answer in the literature is that these two types of interactions are similar. The present stu...
Nicole Shechtman, Leonard M. Horowitz
UM
2001
Springer
15 years 7 months ago
User Modelling in I-Help: What, Why, When and How
This paper describes user modelling in I-Help, a system to facilitate communication amongst learners. There are two I-Help components: Private and Public Discussions. In the Privat...
Susan Bull, Jim E. Greer, Gordon I. McCalla, Lori ...
TOOLS
1999
IEEE
15 years 6 months ago
Cooperative Software Development: Concepts, Model and Tools
The development of large software systems demands intensive cooperation among multiple project team members with different responsibilities. The development process is often distr...
Josef Altmann, Gustav Pomberger
DKE
2008
114views more  DKE 2008»
15 years 2 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...