Sciweavers

15 search results - page 1 / 3
» The Complexity of Closed World Reasoning and Circumscription
Sort
View
AAAI
1990
13 years 5 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
LPNMR
2009
Springer
13 years 11 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
DLOG
2011
12 years 8 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...
EPIA
2007
Springer
13 years 10 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
TVCG
2010
176views more  TVCG 2010»
13 years 2 months ago
Evaluation of the Cognitive Effects of Travel Technique in Complex Real and Virtual Environments
—We report a series of experiments conducted to investigate the effects of travel technique on information gathering and cognition in complex virtual environments. In the first e...
Evan A. Suma, Samantha L. Finkelstein, Myra Reid, ...