Sciweavers

19 search results - page 3 / 4
» Some Simplified Forms of Reasoning with Distance-Based Entai...
Sort
View
ILP
2003
Springer
15 years 2 months ago
ILP for Mathematical Discovery
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
Simon Colton, Stephen Muggleton
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi
AAAI
2007
14 years 11 months ago
Knowledge Compilation Properties of Tree-of-BDDs
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef ...
FAC
2002
66views more  FAC 2002»
14 years 9 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
BMCBI
2010
122views more  BMCBI 2010»
14 years 9 months ago
An overview of the CellML API and its implementation
Background: CellML is an XML based language for representing mathematical models, in a machine-independent form which is suitable for their exchange between different authors, and...
Andrew K. Miller, Justin Marsh, Adam Reeve, Alan G...