Sciweavers

521 search results - page 48 / 105
» Reduction Strategies and Acyclicity
Sort
View
IJCAI
2003
13 years 9 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
TASE
2007
IEEE
14 years 2 months ago
Symmetry Reduced Model Checking for B
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (or...
Edd Turner, Michael Leuschel, Corinna Spermann, Mi...
ISMIS
2005
Springer
14 years 1 months ago
Scalable Inductive Learning on Partitioned Data
With the rapid advancement of information technology, scalability has become a necessity for learning algorithms to deal with large, real-world data repositories. In this paper, sc...
Qijun Chen, Xindong Wu, Xingquan Zhu
TLCA
2005
Springer
14 years 1 months ago
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
François-Régis Sinot
TSP
2008
131views more  TSP 2008»
13 years 7 months ago
Causal Compensation for Erasures in Frame Representations
In a variety of signal processing and communications contexts, erasures occur inadvertently or can be intentionally introduced as part of a data reduction strategy. This paper disc...
Petros Boufounos, Alan V. Oppenheim, Vivek K. Goya...