Sciweavers

4401 search results - page 436 / 881
» Computing with Default Logic
Sort
View
ISHPC
2003
Springer
16 years 16 hour ago
A Simple Low-Energy Instruction Wakeup Mechanism
Instruction issue consumes a large amount of energy in out of order processors, largely in the wakeup logic. Proposed solutions to the problem require prediction or additional hard...
Marco A. Ramírez, Adrián Cristal, Al...
ERSHOV
2001
Springer
15 years 11 months ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema
AADEBUG
2000
Springer
15 years 11 months ago
Value Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
MOBIDE
1999
ACM
15 years 11 months ago
DataSpace - Querying and Monitoring Deeply Networked Collections in Physical Space
In this article we introduce a new conception of three-dimensional DataSpace, which is physical space enhanced by connectivity to the network. DataSpace is addressed geographicall...
Tomasz Imielinski, Samir Goel
TARK
1998
Springer
15 years 11 months ago
Simulative Inference About Nonmonotonic Reasoners
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...
Aaron N. Kaplan