Sciweavers

292 search results - page 27 / 59
» First-order intensional logic
Sort
View
ICDT
2005
ACM
139views Database» more  ICDT 2005»
14 years 1 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx
AAAI
2008
13 years 10 months ago
A First-Order Theory of Stanislavskian Scene Analysis
At the turn of the last century, Constantin Stanislavski developed a new system of acting, replacing the mannered gestures and forced emotion then popular with a more natural styl...
Leora Morgenstern
NAACL
2007
13 years 9 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
13 years 9 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
IJCAI
2001
13 years 9 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...