Sciweavers

1094 search results - page 104 / 219
» On Computing Explanations in Argumentation
Sort
View
LOGCOM
2008
120views more  LOGCOM 2008»
14 years 11 months ago
Reconstructing an Agent's Epistemic State from Observations about its Beliefs and Non-beliefs
We look at the problem in belief revision of trying to make inferences about what an agent believed--or will believe--at a given moment, based on an observation of how the agent h...
Richard Booth, Alexander Nittka
JWSR
2007
89views more  JWSR 2007»
14 years 11 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
COLING
2002
14 years 11 months ago
The Chinese Aspect System and its Semantic Interpretation
: Motivated by a systematic representation of the Chinese aspect forms that explores their intrinsic semantics and temporal logical relations, we are constructing a Chinese aspect ...
Guowen Yang, John A. Bateman
STTT
2002
86views more  STTT 2002»
14 years 10 months ago
What makes good research in software engineering?
Physics, biology, and medicine have well-refined public explanations of their research processes. Even in simplified form, these provide guidance about what counts as "good re...
Mary Shaw
MST
2010
121views more  MST 2010»
14 years 9 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna