1545 search results - page 35 / 309 » Defeasible Description Logics |
87
Voted
CSL
2010
Springer
15 years 16 days ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
73
Voted
CSL
2000
Springer
15 years 4 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
114
click to vote
LANMR
2007
15 years 1 months ago
2007
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
104
Voted
TARK
1998
Springer
15 years 4 months ago
1998
Springer
If one has attributed certain initial beliefs to an agent, it is sometimes possible to reason about further beliefs the agent must hold by observing what conclusions one's ow...
102
Voted
CORR
2002
Springer
15 years 5 days ago
2002
Springer
A. Tarski 21] proposed the study of in nitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations...