Results 1  10
of
33
On the Integration of Learning, Logical Deduction and Probabilistic inductive Inference
 Invited paper for the First International Workshop on Inductive Logic Programming, Vienna do
, 1991
"... This paper introduces the conjecture that many kinds of cognition and computing may usefully be seen as a search for efficiency in information, where efficiency is defined in terms of Shannon's (1949) concept of redundancy in information. A prototype of a new kind of computing system which is b ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
is based on this theory is described in outline. Examples from the prototype are presented showing how a search for efficiency in information may achieve autonomous inductive learning, logical deduction and probabilistic inductive inference. 2 INTRODUCTION The nascent field of inductive logic programming
Probabilistic deduction and pattern recognition of complex events
 International Conference on Information Security and Privacy (ISP09
"... We propose a logic language for complex events based on a given set of atomic discrete temporal events and logic constraints built on them. Then we define a structuralprobabilistic composition for building the complex events from a set of basic events. We suppose that each complex event is probabi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is probabilistically defined from such atomicevents constraints in a complete way, so that satisfies the Kolmogorov’s probabilistic axioms. The data structure of basic complex events in this logic theory are ground atoms of a Herbrand base over a given domain/universe for events. The compositions of complex events
A Temporal and Probabilistic, Deductive and ObjectOriented Query Language
 In Workshop on Temporal Reasoning in Deductive and ObjectOriented Databases
, 1995
"... Novel concepts are presented to enhance query languages to represent time and uncertainty. We specifically enhance FQL , a deductive and objectoriented query language, with the abilities to adequately represent time and uncertainty. 1 Introduction Any piece of data can additionally be specifie ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Novel concepts are presented to enhance query languages to represent time and uncertainty. We specifically enhance FQL , a deductive and objectoriented query language, with the abilities to adequately represent time and uncertainty. 1 Introduction Any piece of data can additionally
Representation Dependence in Probabilistic Inference
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 2004
"... Nondeductive reasoning systems are often representation dependent: representing the same situation in two different ways may cause such a system to return two different answers. Some have viewed ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
Nondeductive reasoning systems are often representation dependent: representing the same situation in two different ways may cause such a system to return two different answers. Some have viewed
Semantics, Consistency and Query Processing of Empirical Deductive Databases
 IEEE Trans. Knowl. Data Eng
, 1997
"... In recent years, there has been growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most frameworks proposed thus far are either nonprobabilistic in nature or based on subjective probabilities. In this paper, we address the problem of incorporati ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
In recent years, there has been growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most frameworks proposed thus far are either nonprobabilistic in nature or based on subjective probabilities. In this paper, we address the problem
Towards Precision of Probabilistic Bounds Propagation
 PROC. OF THE 8 TH CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE
, 1992
"... The DUCKcalculus presented here is a recent approach to cope with probabilistic uncertainty in a sound and efficient way. Uncertain rules with bounds for probabilities and explicit conditional independences can be maintained incrementally. The basic inference mechanism relies on local bounds propag ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
The DUCKcalculus presented here is a recent approach to cope with probabilistic uncertainty in a sound and efficient way. Uncertain rules with bounds for probabilities and explicit conditional independences can be maintained incrementally. The basic inference mechanism relies on local bounds
Ordinal and probabilistic representations of acceptance
 J. Artificial Intelligence Research
, 2004
"... An accepted belief is a proposition considered likely enough by an agent, to be inferred from as if it were true. This paper bridges the gap between probabilistic and logical representations of accepted beliefs. To this end, natural properties of relations on propositions, describing relative streng ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
An accepted belief is a proposition considered likely enough by an agent, to be inferred from as if it were true. This paper bridges the gap between probabilistic and logical representations of accepted beliefs. To this end, natural properties of relations on propositions, describing relative
Datadriven parsing with probabilistic linear contextfree rewriting systems
 In Proceedings of the 23rd International Conference on Computational Linguistics
, 2010
"... This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with contextsummary estimates for parse items used to speed up parsing. LCFRS, an extension of CFG, can describe discontinuities both in ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with contextsummary estimates for parse items used to speed up parsing. LCFRS, an extension of CFG, can describe discontinuities both
Probabilistic Substitutivity at a Reduced Price
"... One of the many intriguing features of the axiomatic systems of probability investigated in Popper (1959), appendices ∗iv, ∗v, is the different status of the two arguments of the probability functor with regard to the laws of replacement and commutation. The laws for the first argument, (rep1) and ..."
Abstract
 Add to MetaCart
) and (comm1), follow from much simpler axioms, whilst (rep2) and (comm2) are independent of them, and have to be incorporated only when most of the important deductions have been accomplished. It is plain that, in the presence of (comm1), the principle (sub), which says that terms
Datadriven parsing using Probabilistic Linear ContextFree Rewriting Systems
 Computational Linguistics
, 2013
"... This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for datadriv ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for data
Results 1  10
of
33