884 search results - page 119 / 177 » A Proof Theory for DL-Lite |
CATS
2006
15 years 1 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
IJCAI
2003
15 years 1 months ago
2003
A default conditional α → β has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional. That is, the intui...
IJCAI
1989
15 years 1 months ago
1989
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
119
click to vote
CRYPTO
2010
Springer
15 years 28 days ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
104
click to vote
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...