Sciweavers

428 search results - page 22 / 86
» Completeness of a Fact Extractor
Sort
View
LPNMR
2009
Springer
15 years 4 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
86
Voted
TARK
2007
Springer
15 years 3 months ago
Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
Thomas Ågotnes, Natasha Alechina
DOLAP
2004
ACM
15 years 2 months ago
A new OLAP aggregation based on the AHC technique
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
Riadh Ben Messaoud, Omar Boussaid, Sabine Rabas&ea...
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
15 years 2 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
PODS
1991
ACM
131views Database» more  PODS 1991»
15 years 1 months ago
Termination Detection in Logic Programs using Argument Sizes
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
Kirack Sohn, Allen Van Gelder