Sciweavers

428 search results - page 31 / 86
» Completeness of a Fact Extractor
Sort
View
AAAI
1990
15 years 1 months ago
Very Fast Decision Table Execution of Propositional Expert Systems
A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expe...
Robert M. Colomb, Charles Y. C. Chung
APAL
2008
80views more  APAL 2008»
15 years 4 hour ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari
COMGEO
2010
ACM
14 years 12 months ago
Floodlight illumination of infinite wedges
The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles 1, . . . , n at n sites p1, . . . , pn...
Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik V...
CPC
2006
69views more  CPC 2006»
14 years 12 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
ENTCS
2006
101views more  ENTCS 2006»
14 years 12 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe