4217 search results - page 105 / 844 » Computational indistinguishability logic |
169
Voted
LOGCOM
2006
15 years 6 months ago
2006
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
214
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
228
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...