Sciweavers

2236 search results - page 324 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
SIGARCH
2008
107views more  SIGARCH 2008»
15 years 4 months ago
A lightweight streaming layer for multicore execution
As multicore architectures gain widespread use, it becomes increasingly important to be able to harness their additional processing power to achieve higher performance. However, e...
David Zhang, Qiuyuan J. Li, Rodric Rabbah, Saman A...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 8 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
LPNMR
1990
Springer
15 years 8 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
NDJFL
2000
74views more  NDJFL 2000»
15 years 4 months ago
Frege's New Science
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
Aldo Antonelli, Robert May
INFORMS
1998
150views more  INFORMS 1998»
15 years 4 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper