Sciweavers

150 search results - page 7 / 30
» Complexity of the Unique Extension Problem in Default Logic
Sort
View
AI
2008
Springer
14 years 9 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz
AAAI
1996
14 years 10 months ago
First-Order Conditional Logic Revisited
Conditional logics play an important role in recent attempts to investigate default reasoning. This paper investigates firstorder conditional logic. We show that, as for first-ord...
Nir Friedman, Joseph Y. Halpern, Daphne Koller
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
14 years 9 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
CORR
2007
Springer
78views Education» more  CORR 2007»
14 years 9 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
CADE
1999
Springer
15 years 1 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies