Sciweavers

1941 search results - page 171 / 389
» On the Hardness of Approximate Reasoning
Sort
View
LPNMR
2004
Springer
15 years 12 months ago
Planning with Sensing Actions and Incomplete Information Using Logic Programming
Abstract. We present a logic programming based conditional planner that is capable of generating both conditional and sequential conformant plans in the presence of sensing actions...
Tran Cao Son, Phan Huy Tu, Chitta Baral
APSEC
2000
IEEE
15 years 11 months ago
A comparative evaluation of techniques for syntactic level source code analysis
Many program maintenance tools rely on traditional parsing techniques to obtain syntactic level models of the code being maintained. When, for some reason, code cannot be parsed, ...
Anthony Cox, Charles L. A. Clarke
COLING
2008
15 years 8 months ago
Exact Inference for Multi-label Classification using Sparse Graphical Models
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
Yusuke Miyao, Jun-ichi Tsujii
OWLED
2008
15 years 8 months ago
Characterizing and Detecting Integrity Issues in OWL Instance Data
We view OWL instance data evaluation as a process in which instance data is checked for conformance with application requirements. We previously identified some integrity issues ra...
Jiao Tao, Li Ding, Jie Bao, Deborah L. McGuinness
IJCAI
1989
15 years 7 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane