Sciweavers

3044 search results - page 380 / 609
» Linear logical approximations
Sort
View
PODS
2010
ACM
159views Database» more  PODS 2010»
15 years 8 months ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo
NAACL
2007
15 years 8 months ago
First-Order Probabilistic Models for Coreference Resolution
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...
Aron Culotta, Michael L. Wick, Andrew McCallum
IJCAI
2001
15 years 8 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
SLP
1994
121views more  SLP 1994»
15 years 8 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
AAAI
1990
15 years 7 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle