Sciweavers

36 search results - page 5 / 8
» Defaults and Revision in Structured Theories
Sort
View
AAAI
2008
13 years 10 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
CHI
2007
ACM
14 years 8 months ago
A minimal model for predicting visual search in human-computer interaction
Visual search is an important part of human-computer interaction. It is critical that we build theory about how people visually search displays in order to better support the user...
Tim Halverson, Anthony J. Hornof
AMC
2008
87views more  AMC 2008»
13 years 7 months ago
Mining classification rules with Reduced MEPAR-miner Algorithm
In this study, a new classification technique based on rough set theory and MEPAR-miner algorithm for association rule mining is introduced. Proposed method is called as `Reduced ...
Emel Kizilkaya Aydogan, Cevriye Gencer
SEMWEB
2010
Springer
13 years 5 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
KBSE
1995
IEEE
13 years 11 months ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose