Search Results for author:
Found 7 papers, 1 papers with code
ALIST: Associative Logic for Inference, Storage and Transfer. A Lingua Franca for Inference on the Web
Although alternative techniques in neural information retrieval embed the content of knowledge graphs in vector spaces, they fail to provide the representation and query expressivity needed (e. g. inability to handle non-trivial aggregation functions such as regression).
Investigating the use of Paraphrase Generation for Question Reformulation in the FRANK QA system
Our two main conclusions are that cleaning of LC-QuAD 2. 0 is required as the errors present can affect evaluation; and that, due to limitations of FRANK's parser, paraphrase generation is not a method which we can rely on to improve the variety of natural language questions that FRANK can answer.
Signature Entrenchment and Conceptual Changes in Automated Theory Repair
Human beliefs change, but so do the concepts that underpin them.
GPy-ABCD: A Configurable Automatic Bayesian Covariance Discovery Implementation
Gaussian Processes (GPs) are a very flexible class of nonparametric models frequently used in supervised learning tasks because of their ability to fit data with very few assumptions, namely just the type of correlation (kernel) the data is expected to display.
Automating change of representation for proofs in discrete mathematics
We give a brief overview of a general theory of transformations that we consider appropriate for thinking about the matter, and we explain how it relates to the Transfer package.
Incidence Calculus: A Mechanism for Probabilistic Reasoning
Mechanisms for the automation of uncertainty are required for expert systems.
On Some Equivalence Relations between Incidence Calculus and Dempster-Shafer Theory of Evidence
Incidence Calculus and Dempster-Shafer Theory of Evidence are both theories to describe agents' degrees of belief in propositions, thus being appropriate to represent uncertainty in reasoning systems.
