24 citations · 24 across the 4 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2013
Non-monotonic Negation in Probabilistic Deductive Databases
Raymond T. Ng, V. S. Subrahmanian
In this paper we study the uses and the semantics of non-monotonic negation in probabilistic deductive data bases. Based on the stable semantics for classical logic programming, we…
cs.AI2013
Empirical Probabilities in Monadic Deductive Databases
Raymond T. Ng, V. S. Subrahmanian
We address the problem of supporting empirical probabilities in monadic logic databases. Though the semantics of multivalued logic programs has been studied extensively, the treatm…
cs.AI2013★ 24 cited
Hybrid Probabilistic Programs: Algorithms and Complexity
Michael I. Dekhtyar, Alex Dekhtyar, V. S. Subrahmanian
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the progr…