884 search results - page 53 / 177 » A Proof Theory for DL-Lite |
165
click to vote
ECCC
2008
15 years 6 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
167
click to vote
TLCA
2007
Springer
16 years 6 days ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
139
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
163
click to vote
AAAI
1994
15 years 7 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
148
click to vote
ACTA
2006
15 years 6 months ago
2006
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...