Sciweavers

76 search results - page 2 / 16
» Complexity Results for Default Reasoning from Conditional Kn...
Sort
View
AAAI
1990
13 years 12 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
AI
2008
Springer
13 years 11 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
ECAI
1998
Springer
14 years 2 months ago
Probabilistic Logic Programming
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
Thomas Lukasiewicz
ECAI
2010
Springer
13 years 12 months ago
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
Lutz Schröder, Dirk Pattinson, Daniel Hausman...
AAAI
1996
14 years 2 days ago
Irrelevance and Conditioning in First-Order Probabilistic Logic
First-order probabilistic logic is a powerful knowledge representation language. Unfortunately, deductive reasoning based on the standard semantics for this logic does not support...
Daphne Koller, Joseph Y. Halpern