Sciweavers

3628 search results - page 461 / 726
» The Decision Diffie-Hellman Problem
Sort
View
KR
2010
Springer
15 years 11 months ago
Status QIO: Conjunctive Query Entailment Is Decidable
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
Birte Glimm, Sebastian Rudolph
LPNMR
2001
Springer
15 years 11 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
SIGCPR
1999
ACM
177views Hardware» more  SIGCPR 1999»
15 years 11 months ago
Interrogative theory of information and knowledge
This report offers an interrogative-based approach to differentiating and quantifying information and knowledge within text. We examine the work of Popper, Shannon, Weaver, Brooke...
Edward J. Quigley, Anthony Debons
HASE
1998
IEEE
15 years 11 months ago
Optimal Discrimination between Transient and Permanent Faults
An important practical problem in fault diagnosis is discriminating between permanent faults and transient faults. In many computer systems, the majority of errors are due to tran...
M. Pizza, Lorenzo Strigini, Andrea Bondavalli, Fel...
ECAI
1998
Springer
15 years 11 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein