Sciweavers

1426 search results - page 120 / 286
» Specification of nonmonotonic reasoning
Sort
View
AAAI
2010
15 years 7 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia
ICCE
2007
141views Education» more  ICCE 2007»
15 years 7 months ago
Enriching Solution Space for Robustness in an Intelligent Tutoring System
: Intelligent tutoring systems assist medical faculty in training and equipping students with the required clinical reasoning skills. Plausible student solutions to a given problem...
Hameedullah Kazi, Peter Haddawy, Siriwan Suebnukar...
DLOG
2006
15 years 7 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
ECSCW
2001
15 years 7 months ago
y do tngrs luv 2 txt msg?
: "Text messaging" -- using a mobile phone to send a message -- has changed how teenagers use wireless phones to communicate and coordinate. While the media reports rapid...
Rebecca E. Grinter, Margery Eldridge
UAI
2001
15 years 7 months ago
A Calculus for Causal Relevance
We present a sound and complete calculus for causal relevance that uses Pearl's functional causal models as semantics. The calculus consists of axioms and rules of inference ...
Blai Bonet